×

zbMATH — the first resource for mathematics

Ron, Dana

Compute Distance To:
Author ID: ron.dana Recent zbMATH articles by "Ron, Dana"
Published as: Ron, Dana; Ron, D.
External Links: MGP · Wikidata · dblp
Documents Indexed: 129 Publications since 1993, including 2 Books

Publications by Year

Citations contained in zbMATH Open

104 Publications have been cited 1,227 times in 603 Documents Cited by Year
Property testing and its connection to learning and approximation. Zbl 1065.68575
Goldreich, Oded; Goldwasser, Shafi; Ron, Dana
197
1998
Property testing in bounded degree graphs. Zbl 0990.68103
Goldreich, O.; Ron, D.
63
2002
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. Zbl 1069.68120
Even, Guy; Lotker, Zvi; Ron, Dana; Smorodinsky, Shakhar
59
2003
Testing monotonicity. Zbl 0964.68148
Goldreich, Oded; Goldwasser, Shafi; Lehman, Eric; Ron, Dana; Samorodnitsky, Alex
38
2000
Algorithmic and analysis techniques in property testing. Zbl 1184.68610
Ron, Dana
35
2009
A sublinear bipartiteness tester for bounded degree graphs. Zbl 0932.68053
Goldreich, Oded; Ron, Dana
34
1999
Improved testing algorithms for monotonicity. Zbl 0949.68178
Dodis, Yevgeniy; Goldreich, Oded; Lehman, Eric; Raskhodnikova, Sofya; Ron, Dana; Samorodnitsky, Alex
32
1999
On testing expansion in bounded-degree graphs. Zbl 1343.68302
Goldreich, Oded; Ron, Dana
31
2011
The power of a pebble: Exploring and mapping directed graphs. Zbl 1012.68202
Bender, Michael A.; Fernández, Antonio; Ron, Dana; Sahai, Amit; Vadhan, Salil
30
2002
On the learnability of discrete distributions. Zbl 1345.68252
Kearns, Michael; Mansour, Yishay; Ron, Dana; Rubinfeld, Ronitt; Schapire, Robert E.; Sellie, Linda
29
1994
Property testing. Zbl 1048.68064
Ron, Dana
29
2001
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Zbl 1188.68358
Parnas, Michal; Ron, Dana
27
2007
Testing the diameter of graphs. Zbl 1052.68104
Parnas, Michal; Ron, Dana
25
2002
Scheduling with conflicts: Online and offline algorithms. Zbl 1170.90390
Even, Guy; Halldórsson, Magnús M.; Kaplan, Lotem; Ron, Dana
24
2009
Testing Reed-Muller codes. Zbl 1247.94057
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Litsyn, Simon; Ron, Dana
24
2005
The power of a pebble: Exploring and mapping directed graphs. Zbl 1027.68652
Bender, Michael A.; Fernández, Antonio; Ron, Dana; Sahai, Amit; Vadhan, Salil
24
1998
Testing juntas. Zbl 1076.68112
Fischer, Eldar; Kindler, Guy; Ron, Dana; Safra, Shmuel; Samorodnitsky, Alex
23
2004
Tolerant property testing and distance approximation. Zbl 1100.68109
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
23
2006
Testing basic Boolean formulae. Zbl 1041.68050
Parnas, Michal; Ron, Dana; Samorodnitsky, Alex
21
2002
Approximating average parameters of graphs. Zbl 1155.05057
Goldreich, Oded; Ron, Dana
20
2008
On randomized one-round communication complexity. Zbl 0942.68059
Kremer, Ilan; Nisan, Noam; Ron, Dana
20
1999
The power of amnesia: Learning probabilistic automata with variable memory length. Zbl 0869.68066
Ron, Dana; Singer, Yoram; Tishby, Naftali
20
1996
Tight bounds for testing bipartiteness in general graphs. Zbl 1101.68607
Kaufman, Tali; Krivelevich, Michael; Ron, Dana
18
2004
Strong lower bounds for approximating distribution support size and the distinct elements problem. Zbl 1194.68124
Raskhodnikova, Sofya; Ron, Dana; Shpilka, Amir; Smith, Adam
15
2009
Testing polynomials over general fields. Zbl 1120.68058
Kaufman, Tali; Ron, Dana
15
2006
Property testing in bounded degree graphs. Zbl 0963.68154
Goldreich, Oded; Ron, Dana
15
1999
Testing low-degree polynomials over \(\text{GF}(2)\). Zbl 1247.94058
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Litsyn, Simon; Ron, Dana
14
2003
On the learnability and usage of acyclic probabilistic finite automata. Zbl 0915.68124
Ron, Dana; Singer, Yoram; Tishby, Naftali
14
1998
Property testing. A learning theory perspective. Zbl 1162.68035
Ron, Dana
13
2008
Testing problems with sublearning sample complexity. Zbl 0970.68074
Kearns, Michael; Ron, Dana
12
2000
Chinese remaindering with errors. Zbl 1007.94026
Goldreich, Oded; Ron, Dana; Sudan, Madhu
11
2000
Testing of clustering. Zbl 1041.68048
Alon, Noga; Dar, Seannie; Parnas, Michal; Ron, Dana
10
2003
On proximity-oblivious testing. Zbl 1223.68045
Goldreich, Oded; Ron, Dana
10
2011
Testing properties of directed graphs: Acyclicity and connectivity. Zbl 1002.68113
Bender, Michael A.; Ron, Dana
10
2002
Testing probability distributions using conditional samples. Zbl 1328.68293
Canonne, Clément L.; Ron, Dana; Servedio, Rocco A.
10
2015
Approximately counting triangles in sublinear time. Zbl 1380.68445
Eden, Talya; Levi, Amit; Ron, Dana; Seshadhri, C.
9
2017
On randomized one-round communication complexity. Zbl 0926.94022
Kremer, Ilan; Nisan, Noam; Ron, Dana
9
1995
Approximating the distance to properties in bounded-degree and general sparse graphs. Zbl 1446.68197
Marko, Sharon; Ron, Dana
9
2009
Counting stars and other small subgraphs in sublinear-time. Zbl 1234.68138
Gonen, Mira; Ron, Dana; Shavitt, Yuval
8
2011
On disjoint chains of subsets. Zbl 0989.06002
Lehman, Eric; Ron, Dana
8
2001
Efficient learning of typical finite automata from random walks. Zbl 1310.68131
Freund, Yoav; Kearns, Michael; Ron, Dana; Rubinfeld, Ronitt; Schapire, Robert E.; Sellie, Linda
8
1993
Approximating the distance to monotonicity in high dimensions. Zbl 1300.68066
Fattal, Shahar; Ron, Dana
7
2010
Deterministic stateless centralized local algorithms for bounded degree graphs. Zbl 1425.68456
Even, Guy; Medina, Moti; Ron, Dana
7
2014
Distance approximation in bounded-degree and general sparse graphs. Zbl 1155.68582
Marko, Sharon; Ron, Dana
7
2006
Finding cycles and trees in sublinear time. Zbl 1307.05210
Czumaj, Artur; Goldreich, Oded; Ron, Dana; Seshadhri, C.; Shapira, Asaf; Sohler, Christian
6
2014
On proximity oblivious testing. Zbl 1304.05134
Goldreich, Oded; Ron, Dana
6
2009
A new conceptual clustering framework. Zbl 1093.68101
Mishra, Nina; Ron, Dana; Swaminathan, Ram
5
2004
Testing triangle-freeness in general graphs. Zbl 1163.68018
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Ron, Dana
5
2008
On the benefits of adaptivity in property testing of dense graphs. Zbl 1171.68696
Gonen, Mira; Ron, Dana
5
2007
Computational sample complexity. Zbl 0941.68108
Decatur, Scott E.; Goldreich, Oded; Ron, Dana
5
2000
Proclaiming dictators and juntas or testing Boolean formulae. Zbl 0998.68224
Parnas, Michal; Ron, Dana; Samorodnitsky, Alex
5
2001
Efficient learning of typical finite automata from random walks. Zbl 0889.68131
Freund, Yoav; Kearns, Michael; Ron, Dana; Rubinfeld, Ronitt; Schapire, Robert E.; Sellie, Linda
5
1997
Testing computability by width two OBDDs. Zbl 1255.68296
Ron, Dana; Tsur, Gilad
4
2009
Testing computability by width-two OBDDs. Zbl 1234.68462
Ron, Dana; Tsur, Gilad
4
2012
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. Zbl 1422.68310
Onak, Krzysztof; Ron, Dana; Rosen, Michal; Rubinfeld, Ronitt
4
2012
Tight bounds for testing bipartiteness in general graphs. Zbl 1279.05068
Kaufman, Tali; Krivelevich, Michael; Ron, Dana
4
2003
Algorithmic aspects of property testing in the dense graphs model. Zbl 1234.68137
Goldreich, Oded; Ron, Dana
4
2011
Testing parenthesis languages. Zbl 0998.68076
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
4
2001
Testing membership in parenthesis languages. Zbl 1057.68050
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
4
2003
On testing convexity and submodularity. Zbl 1026.68166
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
4
2003
On finding large conjunctive clusters. Zbl 1274.68340
Mishra, Nina; Ron, Dana; Swaminathan, Ram
4
2003
A quasi-polynomial time partition oracle for graphs with an excluded minor. Zbl 1400.68158
Levi, Reut; Ron, Dana
4
2015
Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity. Zbl 1322.68109
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Samorodnitsky, Alex; Weinstein, Omri
3
2012
On sample-based testers (extended abstract). Zbl 1364.68361
Goldreich, Oded; Ron, Dana
3
2015
Testing metric properties. Zbl 1323.68319
Parnas, Michal; Ron, Dana
3
2001
Local algorithms for sparse spanning graphs. Zbl 1360.05168
Levi, Reut; Ron, Dana; Rubinfeld, Ronitt
3
2014
Testing properties of collections of distributions. Zbl 1366.68360
Levi, Reut; Ron, Dana; Rubinfeld, Ronitt
3
2013
Algorithmic aspects of property testing in the dense graphs model. Zbl 1309.68222
Goldreich, Oded; Ron, Dana
3
2010
Comparing the strength of query types in property testing: the case of testing \(k\)-colorability. Zbl 1192.68470
Ben-Eliezer, Ido; Kaufman, Tali; Krivelevich, Michael; Ron, Dana
3
2008
Approximating average parameters of graphs. Zbl 1155.68571
Goldreich, Oded; Ron, Dana
3
2006
Learning fallible deterministic finite automata. Zbl 0831.68088
Ron, Dana; Rubinfeld, Ronitt
3
1995
Testing acyclicity of directed graphs in sublinear time. Zbl 0973.05072
Bender, Michael A.; Ron, Dana
3
2000
A sublinear bipartiteness tester for bounded degree graphs. Zbl 1027.68649
Goldreich, Oded; Ron, Dana
3
1998
On sample-based testers. Zbl 1427.68360
Goldreich, Oded; Ron, Dana
3
2016
Exponentially improved algorithms and lower bounds for testing signed majorities. Zbl 1322.68260
Ron, Dana; Servedio, Rocco A.
2
2015
Constructing near spanning trees with few local inspections. Zbl 1359.05022
Levi, Reut; Moshkovitz, Guy; Ron, Dana; Rubinfeld, Ronitt; Shapira, Asaf
2
2017
On the possibilities and limitations of pseudodeterministic algorithms (extended abstract). Zbl 1361.68089
Goldreich, Oded; Goldwasser, Shafi; Ron, Dana
2
2013
Testing bounded arboricity. Zbl 1403.68160
Eden, Talya; Levi, Reut; Ron, Dana
2
2018
A local algorithm for constructing spanners in minor-free graphs. Zbl 1398.05203
Levi, Reut; Ron, Dana; Rubinfeld, Ronitt
2
2016
Testing of clustering. Zbl 1105.68050
Alon, Noga; Dar, Seannie; Parnas, Michal; Ron, Dana
2
2004
Testing Eulerianity and connectivity in directed sparse graphs. Zbl 1238.05110
Orenstein, Yaron; Ron, Dana
2
2011
Testing computability by width-2 OBDDs where the variable order is unknown. Zbl 1284.68650
Ron, Dana; Tsur, Gilad
2
2010
Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity. Zbl 1343.68305
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Weinstein, Omri
2
2011
Testing the diameter of graphs. Zbl 0945.05057
Parnas, Michal; Ron, Dana
2
1999
Testing equivalence between distributions using conditional samples. Zbl 1421.68183
Canonne, Clement; Ron, Dana; Servedio, Rocco A.
2
2014
Sublinear time estimation of degree distribution moments: the degeneracy connection. Zbl 1441.68174
Eden, Talya; Ron, Dana; Seshadhri, C.
2
2017
On approximating the number of relevant variables in a function. Zbl 1322.68261
Ron, Dana; Tsur, Gilad
1
2013
On universal learning algorithms. Zbl 1337.68144
Goldreich, Oded; Ron, Dana
1
1997
Chinese remaindering with errors. Zbl 1345.94105
Goldreich, Oded; Ron, Dana; Sudan, Madhu
1
1999
On learning and testing dynamic environments. Zbl 1426.68297
Goldreich, Oded; Ron, Dana
1
2017
Testing metric properties. Zbl 1076.68034
Parnas, Michal; Ron, Dana
1
2003
Algorithmic aspects of property testing in the dense graphs model. Zbl 1255.68291
Goldreich, Oded; Ron, Dana
1
2009
A quasi-polynomial time partition oracle for graphs with an excluded minor. Zbl 1336.68138
Levi, Reut; Ron, Dana
1
2013
The Boolean rank of the uniform intersection matrix and a family of its submatrices. Zbl 1411.05173
Parnas, Michal; Ron, Dana; Shraibman, Adi
1
2019
Finding a dense-core in jellyfish graphs. Zbl 1152.68340
Gonen, Mira; Ron, Dana; Weinsberg, Udi; Wool, Avishai
1
2008
Sublinear algorithms for approximating string compressibility. Zbl 1171.68474
Raskhodnikova, Sofya; Ron, Dana; Rubinfeld, Ronitt; Smith, Adam
1
2007
On approximating the number of relevant variables in a function. Zbl 1343.68315
Ron, Dana; Tsur, Gilad
1
2011
Agreement in the presence of faults, on networks of bounded degree. Zbl 0900.68017
Ben-Or, Michael; Ron, Dana
1
1996
Best of two local models: centralized local and distributed local algorithms. Zbl 1401.68356
Even, Guy; Medina, Moti; Ron, Dana
1
2018
Counting stars and other small subgraphs in sublinear time. Zbl 1288.05274
Gonen, Mira; Ron, Dana; Shavitt, Yuval
1
2010
On approximating the number of \(k\)-cliques in sublinear time. Zbl 1452.68276
Eden, Talya; Ron, Dana; Seshadhri, C.
1
2020
The Boolean rank of the uniform intersection matrix and a family of its submatrices. Zbl 1411.05173
Parnas, Michal; Ron, Dana; Shraibman, Adi
1
2019
Testing bounded arboricity. Zbl 1403.68160
Eden, Talya; Levi, Reut; Ron, Dana
2
2018
Best of two local models: centralized local and distributed local algorithms. Zbl 1401.68356
Even, Guy; Medina, Moti; Ron, Dana
1
2018
Property testing of planarity in the CONGEST model. Zbl 1428.68386
Levi, Reut; Medina, Moti; Ron, Dana
1
2018
Approximately counting triangles in sublinear time. Zbl 1380.68445
Eden, Talya; Levi, Amit; Ron, Dana; Seshadhri, C.
9
2017
Constructing near spanning trees with few local inspections. Zbl 1359.05022
Levi, Reut; Moshkovitz, Guy; Ron, Dana; Rubinfeld, Ronitt; Shapira, Asaf
2
2017
Sublinear time estimation of degree distribution moments: the degeneracy connection. Zbl 1441.68174
Eden, Talya; Ron, Dana; Seshadhri, C.
2
2017
On learning and testing dynamic environments. Zbl 1426.68297
Goldreich, Oded; Ron, Dana
1
2017
On sample-based testers. Zbl 1427.68360
Goldreich, Oded; Ron, Dana
3
2016
A local algorithm for constructing spanners in minor-free graphs. Zbl 1398.05203
Levi, Reut; Ron, Dana; Rubinfeld, Ronitt
2
2016
Testing probability distributions using conditional samples. Zbl 1328.68293
Canonne, Clément L.; Ron, Dana; Servedio, Rocco A.
10
2015
A quasi-polynomial time partition oracle for graphs with an excluded minor. Zbl 1400.68158
Levi, Reut; Ron, Dana
4
2015
On sample-based testers (extended abstract). Zbl 1364.68361
Goldreich, Oded; Ron, Dana
3
2015
Exponentially improved algorithms and lower bounds for testing signed majorities. Zbl 1322.68260
Ron, Dana; Servedio, Rocco A.
2
2015
Deterministic stateless centralized local algorithms for bounded degree graphs. Zbl 1425.68456
Even, Guy; Medina, Moti; Ron, Dana
7
2014
Finding cycles and trees in sublinear time. Zbl 1307.05210
Czumaj, Artur; Goldreich, Oded; Ron, Dana; Seshadhri, C.; Shapira, Asaf; Sohler, Christian
6
2014
Local algorithms for sparse spanning graphs. Zbl 1360.05168
Levi, Reut; Ron, Dana; Rubinfeld, Ronitt
3
2014
Testing equivalence between distributions using conditional samples. Zbl 1421.68183
Canonne, Clement; Ron, Dana; Servedio, Rocco A.
2
2014
Testing properties of sparse images. Zbl 1398.68642
Ron, Dana; Tsur, Gilad
1
2014
Testing properties of collections of distributions. Zbl 1366.68360
Levi, Reut; Ron, Dana; Rubinfeld, Ronitt
3
2013
On the possibilities and limitations of pseudodeterministic algorithms (extended abstract). Zbl 1361.68089
Goldreich, Oded; Goldwasser, Shafi; Ron, Dana
2
2013
On approximating the number of relevant variables in a function. Zbl 1322.68261
Ron, Dana; Tsur, Gilad
1
2013
A quasi-polynomial time partition oracle for graphs with an excluded minor. Zbl 1336.68138
Levi, Reut; Ron, Dana
1
2013
Comparing the strength of query types in property testing: the case of \(k\)-colorability. Zbl 1280.68091
Ben-Eliezer, Ido; Kaufman, Tali; Krivelevich, Michael; Ron, Dana
1
2013
Testing computability by width-two OBDDs. Zbl 1234.68462
Ron, Dana; Tsur, Gilad
4
2012
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. Zbl 1422.68310
Onak, Krzysztof; Ron, Dana; Rosen, Michal; Rubinfeld, Ronitt
4
2012
Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity. Zbl 1322.68109
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Samorodnitsky, Alex; Weinstein, Omri
3
2012
On testing expansion in bounded-degree graphs. Zbl 1343.68302
Goldreich, Oded; Ron, Dana
31
2011
On proximity-oblivious testing. Zbl 1223.68045
Goldreich, Oded; Ron, Dana
10
2011
Counting stars and other small subgraphs in sublinear-time. Zbl 1234.68138
Gonen, Mira; Ron, Dana; Shavitt, Yuval
8
2011
Algorithmic aspects of property testing in the dense graphs model. Zbl 1234.68137
Goldreich, Oded; Ron, Dana
4
2011
Testing Eulerianity and connectivity in directed sparse graphs. Zbl 1238.05110
Orenstein, Yaron; Ron, Dana
2
2011
Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity. Zbl 1343.68305
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Weinstein, Omri
2
2011
On approximating the number of relevant variables in a function. Zbl 1343.68315
Ron, Dana; Tsur, Gilad
1
2011
Approximating the distance to monotonicity in high dimensions. Zbl 1300.68066
Fattal, Shahar; Ron, Dana
7
2010
Algorithmic aspects of property testing in the dense graphs model. Zbl 1309.68222
Goldreich, Oded; Ron, Dana
3
2010
Testing computability by width-2 OBDDs where the variable order is unknown. Zbl 1284.68650
Ron, Dana; Tsur, Gilad
2
2010
Counting stars and other small subgraphs in sublinear time. Zbl 1288.05274
Gonen, Mira; Ron, Dana; Shavitt, Yuval
1
2010
Algorithmic and analysis techniques in property testing. Zbl 1184.68610
Ron, Dana
35
2009
Scheduling with conflicts: Online and offline algorithms. Zbl 1170.90390
Even, Guy; Halldórsson, Magnús M.; Kaplan, Lotem; Ron, Dana
24
2009
Strong lower bounds for approximating distribution support size and the distinct elements problem. Zbl 1194.68124
Raskhodnikova, Sofya; Ron, Dana; Shpilka, Amir; Smith, Adam
15
2009
Approximating the distance to properties in bounded-degree and general sparse graphs. Zbl 1446.68197
Marko, Sharon; Ron, Dana
9
2009
On proximity oblivious testing. Zbl 1304.05134
Goldreich, Oded; Ron, Dana
6
2009
Testing computability by width two OBDDs. Zbl 1255.68296
Ron, Dana; Tsur, Gilad
4
2009
Algorithmic aspects of property testing in the dense graphs model. Zbl 1255.68291
Goldreich, Oded; Ron, Dana
1
2009
Approximating average parameters of graphs. Zbl 1155.05057
Goldreich, Oded; Ron, Dana
20
2008
Property testing. A learning theory perspective. Zbl 1162.68035
Ron, Dana
13
2008
Testing triangle-freeness in general graphs. Zbl 1163.68018
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Ron, Dana
5
2008
Comparing the strength of query types in property testing: the case of testing \(k\)-colorability. Zbl 1192.68470
Ben-Eliezer, Ido; Kaufman, Tali; Krivelevich, Michael; Ron, Dana
3
2008
Finding a dense-core in jellyfish graphs. Zbl 1152.68340
Gonen, Mira; Ron, Dana; Weinsberg, Udi; Wool, Avishai
1
2008
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Zbl 1188.68358
Parnas, Michal; Ron, Dana
27
2007
On the benefits of adaptivity in property testing of dense graphs. Zbl 1171.68696
Gonen, Mira; Ron, Dana
5
2007
Sublinear algorithms for approximating string compressibility. Zbl 1171.68474
Raskhodnikova, Sofya; Ron, Dana; Rubinfeld, Ronitt; Smith, Adam
1
2007
Tolerant property testing and distance approximation. Zbl 1100.68109
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
23
2006
Testing polynomials over general fields. Zbl 1120.68058
Kaufman, Tali; Ron, Dana
15
2006
Distance approximation in bounded-degree and general sparse graphs. Zbl 1155.68582
Marko, Sharon; Ron, Dana
7
2006
Approximating average parameters of graphs. Zbl 1155.68571
Goldreich, Oded; Ron, Dana
3
2006
Testing Reed-Muller codes. Zbl 1247.94057
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Litsyn, Simon; Ron, Dana
24
2005
Testing juntas. Zbl 1076.68112
Fischer, Eldar; Kindler, Guy; Ron, Dana; Safra, Shmuel; Samorodnitsky, Alex
23
2004
Tight bounds for testing bipartiteness in general graphs. Zbl 1101.68607
Kaufman, Tali; Krivelevich, Michael; Ron, Dana
18
2004
A new conceptual clustering framework. Zbl 1093.68101
Mishra, Nina; Ron, Dana; Swaminathan, Ram
5
2004
Testing of clustering. Zbl 1105.68050
Alon, Noga; Dar, Seannie; Parnas, Michal; Ron, Dana
2
2004
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. Zbl 1069.68120
Even, Guy; Lotker, Zvi; Ron, Dana; Smorodinsky, Shakhar
59
2003
Testing low-degree polynomials over \(\text{GF}(2)\). Zbl 1247.94058
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Litsyn, Simon; Ron, Dana
14
2003
Testing of clustering. Zbl 1041.68048
Alon, Noga; Dar, Seannie; Parnas, Michal; Ron, Dana
10
2003
Tight bounds for testing bipartiteness in general graphs. Zbl 1279.05068
Kaufman, Tali; Krivelevich, Michael; Ron, Dana
4
2003
Testing membership in parenthesis languages. Zbl 1057.68050
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
4
2003
On testing convexity and submodularity. Zbl 1026.68166
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
4
2003
On finding large conjunctive clusters. Zbl 1274.68340
Mishra, Nina; Ron, Dana; Swaminathan, Ram
4
2003
Testing metric properties. Zbl 1076.68034
Parnas, Michal; Ron, Dana
1
2003
Property testing in bounded degree graphs. Zbl 0990.68103
Goldreich, O.; Ron, D.
63
2002
The power of a pebble: Exploring and mapping directed graphs. Zbl 1012.68202
Bender, Michael A.; Fernández, Antonio; Ron, Dana; Sahai, Amit; Vadhan, Salil
30
2002
Testing the diameter of graphs. Zbl 1052.68104
Parnas, Michal; Ron, Dana
25
2002
Testing basic Boolean formulae. Zbl 1041.68050
Parnas, Michal; Ron, Dana; Samorodnitsky, Alex
21
2002
Testing properties of directed graphs: Acyclicity and connectivity. Zbl 1002.68113
Bender, Michael A.; Ron, Dana
10
2002
Property testing. Zbl 1048.68064
Ron, Dana
29
2001
On disjoint chains of subsets. Zbl 0989.06002
Lehman, Eric; Ron, Dana
8
2001
Proclaiming dictators and juntas or testing Boolean formulae. Zbl 0998.68224
Parnas, Michal; Ron, Dana; Samorodnitsky, Alex
5
2001
Testing parenthesis languages. Zbl 0998.68076
Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt
4
2001
Testing metric properties. Zbl 1323.68319
Parnas, Michal; Ron, Dana
3
2001
Testing monotonicity. Zbl 0964.68148
Goldreich, Oded; Goldwasser, Shafi; Lehman, Eric; Ron, Dana; Samorodnitsky, Alex
38
2000
Testing problems with sublearning sample complexity. Zbl 0970.68074
Kearns, Michael; Ron, Dana
12
2000
Chinese remaindering with errors. Zbl 1007.94026
Goldreich, Oded; Ron, Dana; Sudan, Madhu
11
2000
Computational sample complexity. Zbl 0941.68108
Decatur, Scott E.; Goldreich, Oded; Ron, Dana
5
2000
Testing acyclicity of directed graphs in sublinear time. Zbl 0973.05072
Bender, Michael A.; Ron, Dana
3
2000
A sublinear bipartiteness tester for bounded degree graphs. Zbl 0932.68053
Goldreich, Oded; Ron, Dana
34
1999
Improved testing algorithms for monotonicity. Zbl 0949.68178
Dodis, Yevgeniy; Goldreich, Oded; Lehman, Eric; Raskhodnikova, Sofya; Ron, Dana; Samorodnitsky, Alex
32
1999
On randomized one-round communication complexity. Zbl 0942.68059
Kremer, Ilan; Nisan, Noam; Ron, Dana
20
1999
Property testing in bounded degree graphs. Zbl 0963.68154
Goldreich, Oded; Ron, Dana
15
1999
Testing the diameter of graphs. Zbl 0945.05057
Parnas, Michal; Ron, Dana
2
1999
Chinese remaindering with errors. Zbl 1345.94105
Goldreich, Oded; Ron, Dana; Sudan, Madhu
1
1999
Property testing and its connection to learning and approximation. Zbl 1065.68575
Goldreich, Oded; Goldwasser, Shafi; Ron, Dana
197
1998
The power of a pebble: Exploring and mapping directed graphs. Zbl 1027.68652
Bender, Michael A.; Fernández, Antonio; Ron, Dana; Sahai, Amit; Vadhan, Salil
24
1998
On the learnability and usage of acyclic probabilistic finite automata. Zbl 0915.68124
Ron, Dana; Singer, Yoram; Tishby, Naftali
14
1998
A sublinear bipartiteness tester for bounded degree graphs. Zbl 1027.68649
Goldreich, Oded; Ron, Dana
3
1998
Efficient learning of typical finite automata from random walks. Zbl 0889.68131
Freund, Yoav; Kearns, Michael; Ron, Dana; Rubinfeld, Ronitt; Schapire, Robert E.; Sellie, Linda
5
1997
On universal learning algorithms. Zbl 1337.68144
Goldreich, Oded; Ron, Dana
1
1997
The power of amnesia: Learning probabilistic automata with variable memory length. Zbl 0869.68066
Ron, Dana; Singer, Yoram; Tishby, Naftali
20
1996
Agreement in the presence of faults, on networks of bounded degree. Zbl 0900.68017
Ben-Or, Michael; Ron, Dana
1
1996
...and 4 more Documents
all top 5

Cited by 928 Authors

35 Ron, Dana
25 Goldreich, Oded
25 Rubinfeld, Ronitt
17 Pelc, Andrzej
15 Alon, Noga M.
14 Ilcinkas, David
14 Servedio, Rocco A.
14 Shapira, Asaf
12 Grigorescu, Elena
11 Seshadhri, Comandur
11 Yoshida, Yuichi
10 Flocchini, Paola
10 Santoro, Nicola
9 Fischer, Eldar
9 Fraigniaud, Pierre
9 Raskhodnikova, Sofya
8 Newman, Ilan I.
8 Pach, János
8 Rothblum, Ron D.
8 Sohler, Christian
8 Sudan, Madhu
7 Bhattacharyya, Arnab
7 Czumaj, Artur
7 Czyzowicz, Jurek
7 Gąsieniec, Leszek Antoni
7 Gur, Tom
7 Kaufman, Tali
7 Smorodinsky, Shakhar
6 Bollig, Beate
6 Boudhar, Mourad
6 Canonne, Clement Louis
6 Fox, Jacob
6 Klasing, Ralf
6 Li, Xueliang
6 Onak, Krzysztof
6 Xie, Ning
5 Blais, Eric
5 Cardinal, Jean
5 Chakraborty, Sourav
5 Chang, Ching-Lueh
5 Cheilaris, Panagiotis
5 de Berg, Mark Theodoor
5 Dereniowski, Dariusz
5 Diakonikolas, Ilias
5 Eden, Talya
5 Krivelevich, Michael
5 Marković, Aleksandar
5 Mossel, Elchanan
5 Parnas, Michal
5 Tardos, Gábor
4 Ailon, Nir
4 Ben-Sasson, Eli
4 Das, Shantanu
4 Disser, Yann
4 Dobrev, Stefan
4 Drăgan, Constantin Cătălin
4 Hoppen, Carlos
4 Ito, Hiro
4 Kohayakawa, Yoshiharu
4 Kumar, Akash
4 Levi, Reut
4 Lovász, László
4 Matulef, Kevin
4 Pajak, Dominik
4 Tao, Terence
4 Ţiplea, Ferucio Laurenţiu
4 Weinstein, Amit
4 Widmayer, Peter
4 Wimmer, Karl
4 Woodruff, David P.
4 Ziegler, Tamar
3 Bampas, Evangelos
3 Bendraouche, Mohamed
3 Chakrabarty, Deeparnab
3 Chazelle, Bernard
3 Dachman-Soled, Dana
3 Daskalakis, Constantinos
3 Fekete, Sándor P.
3 Gouleakis, Themis
3 Jain, Pallavi
3 Kanesh, Lawqueen
3 Keldenich, Phillip
3 Keszegh, Balázs
3 Klir, George J.
3 Kosowski, Adrian
3 Lachish, Oded
3 Lang, Richard
3 Lefmann, Hanno
3 Matsliah, Arie
3 Mihalák, Matúš
3 Molinaro, Marco
3 Pálvölgyi, Dömötör
3 Rajsbaum, Sergio
3 Rozenberg, Eyal
3 Samorodnitsky, Alex
3 Sauerhoff, Martin
3 Saurabh, Saket
3 Stagni, Henrique
3 Sudakov, Benny
3 Szemerédi, Endre
...and 828 more Authors
all top 5

Cited in 109 Serials

58 Theoretical Computer Science
39 Algorithmica
26 SIAM Journal on Computing
24 Journal of Computer and System Sciences
22 Random Structures & Algorithms
18 Information Processing Letters
16 Information and Computation
16 Computational Complexity
15 Discrete Applied Mathematics
13 Combinatorics, Probability and Computing
13 Theory of Computing Systems
12 Distributed Computing
11 SIAM Journal on Discrete Mathematics
9 Combinatorica
9 Machine Learning
5 Discrete Mathematics
5 Discrete & Computational Geometry
5 Journal of Cryptology
5 Computational Geometry
4 Journal of Combinatorial Theory. Series A
4 European Journal of Combinatorics
4 Graphs and Combinatorics
4 International Journal of Computational Geometry & Applications
4 International Journal of Foundations of Computer Science
4 Cybernetics and Systems Analysis
4 Electronic Journal of Statistics
3 Advances in Mathematics
3 Fuzzy Sets and Systems
3 Information Sciences
3 Computers & Operations Research
3 Designs, Codes and Cryptography
3 Geometric and Functional Analysis. GAFA
3 Pattern Recognition
3 Journal of Combinatorial Optimization
3 Annals of Mathematics. Second Series
3 Journal of Machine Learning Research (JMLR)
2 Israel Journal of Mathematics
2 The Annals of Statistics
2 Networks
2 European Journal of Operational Research
2 The Australasian Journal of Combinatorics
2 Finite Fields and their Applications
2 The Electronic Journal of Combinatorics
2 Bernoulli
2 RAIRO. Theoretical Informatics and Applications
2 Quantum Information Processing
2 Journal of Discrete Algorithms
2 The Annals of Applied Statistics
2 Discrete Mathematics, Algorithms and Applications
1 Advances in Applied Probability
1 Artificial Intelligence
1 Journal d’Analyse Mathématique
1 Journal of Mathematical Biology
1 Theory of Probability and its Applications
1 Annals of the Institute of Statistical Mathematics
1 Applied Mathematics and Computation
1 Automatica
1 Illinois Journal of Mathematics
1 The Journal of Symbolic Logic
1 Mathematische Annalen
1 Mathematics of Operations Research
1 Advances in Applied Mathematics
1 Science of Computer Programming
1 Acta Mathematica Hungarica
1 Order
1 Probability Theory and Related Fields
1 Statistical Science
1 Journal of Computer Science and Technology
1 New Generation Computing
1 MCSS. Mathematics of Control, Signals, and Systems
1 Science in China. Series A
1 Journal of Parallel and Distributed Computing
1 Neural Networks
1 Annals of Operations Research
1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence
1 Neural Computation
1 The Annals of Applied Probability
1 Automation and Remote Control
1 Computational Statistics and Data Analysis
1 SIAM Journal on Scientific Computing
1 Applied and Computational Harmonic Analysis
1 Selecta Mathematica. New Series
1 Annals of Mathematics and Artificial Intelligence
1 Discussiones Mathematicae. Graph Theory
1 Sbornik: Mathematics
1 Journal of Scheduling
1 Journal of the ACM
1 PAA. Pattern Analysis and Applications
1 Annals of Combinatorics
1 Data Mining and Knowledge Discovery
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 International Journal of Applied Mathematics and Computer Science
1 Integers
1 Journal of Systems Science and Complexity
1 Statistical Modelling
1 Statistical Analysis and Data Mining
1 International Journal of Intelligent Computing and Cybernetics
1 Groups, Complexity, Cryptology
1 Cryptography and Communications
1 Science China. Information Sciences
...and 9 more Serials

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.