Dana Ron - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On Proximity-Oblivious TestingOded Goldreich, Dana Ron. siamcomp, 40(2):534-566, 2011. [doi]

On Testing Expansion in Bounded-Degree GraphsOded Goldreich, Dana Ron. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 68-75, Springer, 2011. [doi]

Algorithmic Aspects of Property Testing in the Dense Graphs ModelOded Goldreich, Dana Ron. siamcomp, 40(2):376-445, 2011. [doi]

On Approximating the Number of Relevant Variables in a FunctionDana Ron, Gilad Tsur. approx 2011: 676-687 [doi]

On Approximating the Number of Relevant Variables in a FunctionDana Ron, Gilad Tsur. eccc, 18:78, 2011. [doi]

Approximating the Influence of Monotone Boolean Functions in O(/sqrt{n}) Query ComplexityDana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein. approx 2011: 664-675 [doi]

Testing Computability by Width-Two OBDDsDana Ron, Gilad Tsur. eccc, 18:41, 2011. [doi]

2010

Comparing the Strength of Query Types in Property Testing: The Case of Testing ::::k::::-ColorabilityIdo Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron. propertytesting 2010: 253-259 [doi]

Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of QueriesElya Dolev, Dana Ron. approx 2010: 531-544 [doi]

Approximating the distance to monotonicity in high dimensionsShahar Fattal, Dana Ron. talg, 6(3), 2010. [doi]

Algorithmic Aspects of Property Testing in the Dense Graphs ModelOded Goldreich, Dana Ron. propertytesting 2010: 295-305 [doi]

Counting Stars and Other Small Subgraphs in Sublinear TimeMira Gonen, Dana Ron, Yuval Shavitt. soda 2010: 99-116 [doi]

On the Benefits of Adaptivity in Property Testing of Dense GraphsMira Gonen, Dana Ron. algorithmica, 58(4):811-830, 2010. [doi]

Testing Properties of Collections of DistributionsReut Levi, Dana Ron, Ronitt Rubinfeld. eccc, 17:157, 2010. [doi]

Testing Computability by Width-2 OBDDs Where the Variable Order is UnknownDana Ron, Gilad Tsur. ciac 2010: 131-142 [doi]

Testing Properties of Sparse ImagesGilad Tsur, Dana Ron. focs 2010: 468-477 [doi]

2009

Scheduling with conflicts: online and offline algorithmsGuy Even, MagnÃºs M. HalldÃ³rsson, Lotem Kaplan, Dana Ron. scheduling, 12(2):199-224, 2009. [doi]

On proximity oblivious testingOded Goldreich, Dana Ron. stoc 2009: 141-150 [doi]

Algorithmic Aspects of Property Testing in the Dense Graphs ModelOded Goldreich, Dana Ron. approx 2009: 520-533 [doi]

Approximating the distance to properties in bounded-degree and general sparse graphsSharon Marko, Dana Ron. talg, 5(2), 2009. [doi]

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements ProblemSofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith. siamcomp, 39(3):813-842, 2009. [doi]

Counting Stars and Other Small Subgraphs in Sublinear TimeDana Ron, Mira Gonen, Yuval Shavitt. eccc, 16:83, 2009. [doi]

Testing Computability by Width Two OBDDsDana Ron, Gilad Tsur. approx 2009: 686-699 [doi]

Algorithmic and Analysis Techniques in Property TestingDana Ron. fttcs, 5(2):73-205, 2009. [doi]

2008

Testing Triangle-Freeness in General GraphsNoga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. siamdm, 22(2):786-819, 2008. [doi]

Comparing the strength of query types in property testing: the case of testing ::::k::::-colorabilityIdo Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron. soda 2008: 1213-1222 [doi]

On Proximity Oblivious TestingOded Goldreich, Dana Ron. eccc, 15(041), 2008. [doi]

Approximating average parameters of graphsOded Goldreich, Dana Ron. rsa, 32(4):473-493, 2008. [doi]

Algorithmic Aspects of Property Testing in the Dense Graphs ModelOded Goldreich, Dana Ron. eccc, 15(039), 2008. [doi]

Finding a dense-core in Jellyfish graphsMira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool. cn, 52(15):2831-2841, 2008. [doi]

Property Testing: A Learning Theory PerspectiveDana Ron. ftml, 1(3):307-402, 2008. [doi]

2007

On the Benefits of Adaptivity in Property Testing of Dense GraphsMira Gonen, Dana Ron. approx 2007: 525-539 [doi]

Finding a Dense-Core in Jellyfish GraphsMira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool. waw 2007: 29-40 [doi]

Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithmsMichal Parnas, Dana Ron. TCS, 381(1-3):183-196, 2007. [doi]

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements ProblemSofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith. focs 2007: 559-569 [doi]

Sublinear Algorithms for Approximating String CompressibilitySofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith. approx 2007: 609-623 [doi]

The hardness of the Expected Decision Depth problemDana Ron, Amir Rosenfeld, Salil P. Vadhan. ipl, 101(3):112-118, 2007. [doi]

Property Testing: A Learning Theory PerspectiveDana Ron. colt 2007: 1-2 [doi]

2006

2005

2004

Testing juntasEldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky. jcss, 68(4):753-787, 2004. [doi]

On Estimating the Average Degree of a GraphOded Goldreich, Dana Ron. eccc, (013), 2004. [doi]

Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and CompuKlaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron, editors, Volume 3122 of Lecture Notes in Computer Science, Springer, 2004.

Testing Polynomials over General FieldsTali Kaufman, Dana Ron. focs 2004: 413-422 [doi]

Tight Bounds for Testing Bipartiteness in General GraphsTali Kaufman, Michael Krivelevich, Dana Ron. siamcomp, 33(6):1441-1483, 2004. [doi]

A New Conceptual Clustering FrameworkNina Mishra, Dana Ron, Ram Swaminathan. ml, 56(1-3):115-151, 2004. [doi]

Tolerant Property Testing and Distance ApproximationMichal Parnas, Dana Ron, Ronitt Rubinfeld. eccc, (010), 2004. [doi]

2003

Testing of ClusteringNoga Alon, Seannie Dar, Michal Parnas, Dana Ron. siamdm, 16(3):393-417, 2003. [doi]

Testing Low-Degree Polynomials over GF(2(Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron. random 2003: 188-199 [doi]

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular NetworksGuy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky. siamcomp, 33(1):94-136, 2003. [doi]

Bounds on Linear Codes for Network MulticastMeir Feder, Dana Ron, Ami Tavory. eccc, 10(033), 2003. [doi]

Tight Bounds for Testing Bipartiteness in General GraphsTali Kaufman, Michael Krivelevich, Dana Ron. random 2003: 341-353 [doi]

On Finding Large Conjunctive ClustersNina Mishra, Dana Ron, Ram Swaminathan. colt 2003: 448-462 [doi]

Testing metric propertiesMichal Parnas, Dana Ron. iandc, 187(2):155-195, 2003. [doi]

Testing membership in parenthesis languagesMichal Parnas, Dana Ron, Ronitt Rubinfeld. rsa, 22(1):98-138, 2003. [doi]

On Testing Convexity and SubmodularityMichal Parnas, Dana Ron, Ronitt Rubinfeld. siamcomp, 32(5):1158-1184, 2003. [doi]

2002

Testing properties of directed graphs: acyclicity and connectivityMichael A. Bender, Dana Ron. rsa, 20(2):184-205, 2002.

The Power of a Pebble: Exploring and Mapping Directed GraphsMichael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan. iandc, 176(1):1-21, 2002. [doi]

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular NetworksGuy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky. focs 2002: 691-700 [doi]

Testing JuntasEldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky. focs 2002: 103-112 [doi]

Property Testing in Bounded Degree GraphsOded Goldreich, Dana Ron. algorithmica, 32(2):302-343, 2002. [doi]

Testing Basic Boolean FormulaeMichal Parnas, Dana Ron, Alex Samorodnitsky. siamdm, 16(1):20-46, 2002. [doi]

On Testing Convexity and SubmodularityMichal Parnas, Dana Ron, Ronitt Rubinfeld. random 2002: 11-25 [doi]

Testing the diameter of graphsMichal Parnas, Dana Ron. rsa, 20(2):165-183, 2002.

2001

Errata for: On randomized one-round communication complexity Ilan Kremer, Noam Nisan, Dana Ron. cc, 10(4):314-315, 2001. [doi]

On Disjoint Chains of SubsetsEric Lehman, Dana Ron. JCT, 94(2):399-404, 2001. [doi]

Proclaiming Dictators and Juntas or Testing Boolean FormulaeMichal Parnas, Dana Ron, Alex Samorodnitsky. eccc, 8(063), 2001. [doi]

Testing Parenthesis LanguagesMichal Parnas, Dana Ron, Ronitt Rubinfeld. random 2001: 261-272 [doi]

Testing metric propertiesMichal Parnas, Dana Ron. stoc 2001: 276-285 [doi]

Proclaiming Dictators and Juntas or Testing Boolean FormulaeMichal Parnas, Dana Ron, Alex Samorodnitsky. random 2001: 273-284 [doi]

2000

Testing of ClusteringNoga Alon, Seannie Dar, Michal Parnas, Dana Ron. focs 2000: 240-250

Testing Acyclicity of Directed Graphs in Sublinear TimeMichael A. Bender, Dana Ron. icalp 2000: 809-820 [doi]

Chinese remaindering with errorsOded Goldreich, Dana Ron, Madhu Sudan. TIT, 46(4):1330-1338, 2000.

Testing MonotonicityOded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky. combinatorica, 20(3):301-337, 2000. [doi]

On Testing Expansion in Bounded-Degree GraphsOded Goldreich, Dana Ron. eccc, 7(20), 2000. [doi]

Testing Problems with Sublearning Sample ComplexityMichael J. Kearns, Dana Ron. jcss, 61(3):428-456, 2000.

1999

Computational Sample ComplexityScott E. Decatur, Oded Goldreich, Dana Ron. siamcomp, 29(3):854-879, 1999.

Improved Testing Algorithms for MonotonicityYevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky. eccc, 6(17), 1999. [doi]

Improved Testing Algorithms for MonotonicityYevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky. random 1999: 97-108

Chinese Remaindering with ErrorsOded Goldreich, Dana Ron, Madhu Sudan. stoc 1999: 225-234 [doi]

A Sublinear Bipartiteness Tester for Bounded Degree GraphsOded Goldreich, Dana Ron. combinatorica, 19(3):335-373, 1999. [doi]

Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-ValidationMichael J. Kearns, Dana Ron. neco, 11(6):1427-1453, 1999.

On Randomized One-Round Communication ComplexityIlan Kremer, Noam Nisan, Dana Ron. cc, 8(1):21-49, 1999. [doi]

Testing the Diameter of GraphsMichal Parnas, Dana Ron. random 1999: 85-96

1998

Chinese Remaindering with ErrorsOded Goldreich, Dana Ron, Madhu Sudan. eccc, 5(62), 1998. [doi]

Property Testing and its Connection to Learning and ApproximationOded Goldreich, Shafi Goldwasser, Dana Ron. JACM, 45(4):653-750, 1998. [doi]

Testing MonotonicityOded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron. focs 1998: 426-435 [doi]

A Sublinear Bipartiteness Tester for Bunded Degree GraphsOded Goldreich, Dana Ron. stoc 1998: 289-298 [doi]

Testing Problems with Sub-Learning Sample ComplexityMichael J. Kearns, Dana Ron. colt 1998: 268-279 [doi]

On the Learnability and Usage of Acyclic Probabilistic Finite AutomataDana Ron, Yoram Singer, Naftali Tishby. jcss, 56(2):133-152, 1998.

Guest Editor s IntroductionDana Ron. ml, 30(1):5-6, 1998.

PreviousNext