| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
Testing computability by width-two OBDDs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld |
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
Testing Computability by Width-Two OBDDs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
On Approximating the Number of Relevant Variables in a Function. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yaron Orenstein, Dana Ron |
Testing Eulerianity and connectivity in directed sparse graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elya Dolev, Dana Ron |
Distribution-Free Testing for Monomials with a Sublinear Number of Queries. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein |
Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld |
A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mira Gonen, Dana Ron, Yuval Shavitt |
Counting Stars and Other Small Subgraphs in Sublinear-Time. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Proximity-Oblivious Testing. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Testing Expansion in Bounded-Degree Graphs. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein |
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
On Approximating the Number of Relevant Variables in a Function. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Reut Levi, Dana Ron, Ronitt Rubinfeld |
Testing Properties of Collections of Distributions. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Reut Levi, Dana Ron, Ronitt Rubinfeld |
Testing Properties of Collections of Distributions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mira Gonen, Dana Ron |
On the Benefits of Adaptivity in Property Testing of Dense Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shahar Fattal, Dana Ron |
Approximating the distance to monotonicity in high dimensions. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mira Gonen, Dana Ron, Yuval Shavitt |
Counting Stars and Other Small Subgraphs in Sublinear Time. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elya Dolev, Dana Ron |
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Tsur, Dana Ron |
Testing Properties of Sparse Images. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Mira Gonen, Yuval Shavitt |
Counting Stars and Other Small Subgraphs in Sublinear Time. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dana Ron |
Algorithmic and Analysis Techniques in Property Testing. |
Foundations and Trends in Theoretical Computer Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron |
Scheduling with conflicts: online and offline algorithms. |
J. Scheduling |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharon Marko, Dana Ron |
Approximating the distance to properties in bounded-degree and general sparse graphs. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Sublinear approximation algorithms, property testing, graph properties, distance approximation |
| 1 | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith |
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
Testing Computability by Width Two OBDDs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On proximity oblivious testing. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
graph propeties, property testing |
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Proximity Oblivious Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Approximating average parameters of graphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron |
Property Testing: A Learning Theory Perspective. |
Foundations and Trends in Machine Learning |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool |
Finding a dense-core in Jellyfish graphs. |
Computer Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing Triangle-Freeness in General Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
Comparing the strength of query types in property testing: the case of testing k-colorability. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Amir Rosenfeld, Salil P. Vadhan |
The hardness of the Expected Decision Depth problem. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron |
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith |
Sublinear Algorithms for Approximating String Compressibility |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool |
Finding a Dense-Core in Jellyfish Graphs. |
WAW |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith |
Sublinear Algorithms for Approximating String Compressibility. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mira Gonen, Dana Ron |
On the Benefits of Adaptivity in Property Testing of Dense Graphs. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron |
Property Testing: A Learning Theory Perspective. |
COLT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith |
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Tolerant property testing and distance approximation. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Dana Ron |
Testing Polynomials over General Fields. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing triangle-freeness in general graphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharon Marko, Dana Ron |
Distance Approximation in Bounded-Degree and General Sparse Graphs. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Approximating Average Parameters of Graphs. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith |
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron |
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Approximating Average Parameters of Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Reed-Muller codes. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Dana Ron |
A characterization of low-weight words that span generalized reed-muller codes. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Approximating Average Parameters of Graphs. |
Sublinear Algorithms |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Tolerant Property Testing and Distance Approximation |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Estimating the Average Degree of a Graph |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Nina Mishra, Dana Ron, Ram Swaminathan |
A New Conceptual Clustering Framework. |
Machine Learning |
2004 |
DBLP DOI BibTeX RDF |
maximum edge biclustering, conceptual clustering |
| 1 | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
Testing juntas. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Michael Krivelevich, Dana Ron |
Tight Bounds for Testing Bipartiteness in General Graphs. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron (eds.) |
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 Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings |
APPROX-RANDOM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Dana Ron |
Testing Polynomials over General Fields. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Meir Feder, Dana Ron, Ami Tavory |
Bounds on Linear Codes for Network Multicast |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron |
Testing metric properties. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Testing membership in parenthesis languages. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Seannie Dar, Michal Parnas, Dana Ron |
Testing of Clustering. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky |
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
On Testing Convexity and Submodularity. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Michael Krivelevich, Dana Ron |
Tight Bounds for Testing Bipartiteness in General Graphs. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Low-Degree Polynomials over GF(2(. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nina Mishra, Dana Ron, Ram Swaminathan |
On Finding Large Conjunctive Clusters. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Property Testing in Bounded Degree Graphs. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Randomized algorithms, Graph algorithms, Property testing |
| 1 | Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan |
The Power of a Pebble: Exploring and Mapping Directed Graphs. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Dana Ron |
Testing properties of directed graphs: acyclicity and connectivity. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron |
Testing the diameter of graphs. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Alex Samorodnitsky |
Testing Basic Boolean Formulae. |
SIAM J. Discrete Math. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
On Testing Convexity and Submodularity. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
Testing Juntas. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky |
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Lehman, Dana Ron |
On Disjoint Chains of Subsets. |
J. Comb. Theory, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Alex Samorodnitsky |
Proclaiming Dictators and Juntas or Testing Boolean Formulae |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ilan Kremer, Noam Nisan, Dana Ron |
Errata for: "On randomized one-round communication complexity". |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Testing Parenthesis Languages. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Alex Samorodnitsky |
Proclaiming Dictators and Juntas or Testing Boolean Formulae. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron |
Testing metric properties. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Testing Expansion in Bounded-Degree Graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky |
Testing Monotonicity. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R05, 68Q05 |
| 1 | Michael J. Kearns, Dana Ron |
Testing Problems with Sublearning Sample Complexity. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron, Madhu Sudan |
Chinese remaindering with errors. |
IEEE Transactions on Information Theory |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Dana Ron |
Testing Acyclicity of Directed Graphs in Sublinear Time. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Seannie Dar, Michal Parnas, Dana Ron |
Testing of Clustering. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
clustering testing, optimal cost, computational complexity, lower bounds, sampling, statistical analysis, pattern clustering, cost measures |
| 1 | Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky |
Improved Testing Algorithms for Monotonicity. |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R10 |
| 1 | Ilan Kremer, Noam Nisan, Dana Ron |
On Randomized One-Round Communication Complexity. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Kearns, Dana Ron |
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation. |
Neural Computation |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")