The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Dana Ron" ( http://dblp.L3S.de/Authors/Dana_Ron )

URL (Homepage):  http://www.eng.tau.ac.il/~danar/  Author page on DBLP  Author page in RDF  Community of Dana Ron in ASPL-2

Publication years (Num. hits)
1993-1996 (17) 1997-1998 (17) 1999-2000 (15) 2001-2003 (23) 2004-2006 (19) 2007-2008 (15) 2009-2010 (18) 2011-2012 (22) 2013-2014 (24) 2015-2016 (20) 2017-2018 (18) 2019 (3)
Publication types (Num. hits)
article(126) incollection(6) inproceedings(77) phdthesis(1) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 37 occurrences of 29 keywords

Results
Found 212 publication records. Showing 211 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Talya Eden, Dana Ron, Will Rosenbaum The Arboricity Captures the Complexity of Sampling Edges. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron The Subgraph Testing Model. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Talya Eden, Dana Ron, Will Rosenbaum The Arboricity Captures the Complexity of Sampling Edges. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yonatan Nakar, Dana Ron On the Testability of Graph Partition Properties. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron The Subgraph Testing Model. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Talya Eden, Dana Ron, C. Seshadhri Faster sublinear approximations of k-cliques for low arboricity graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Reut Levi, Moti Medina, Dana Ron Property Testing of Planarity in the CONGEST model. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Guy Even, Moti Medina, Dana Ron Best of two local models: Centralized local and distributed local algorithms. Search on Bibsonomy Inf. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Talya Eden, Reut Levi, Dana Ron Testing bounded arboricity. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Talya Eden, Shweta Jain 0003, Ali Pinar, Dana Ron, C. Seshadhri Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. Search on Bibsonomy WWW The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Reut Levi, Moti Medina, Dana Ron Property Testing of Planarity in the CONGEST model. Search on Bibsonomy PODC The full citation details ... 2018 DBLP  BibTeX  RDF
1Talya Eden, Dana Ron, C. Seshadhri On approximating the number of k-cliques in sublinear time. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yonatan Nakar, Dana Ron On the Testability of Graph Partition Properties. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Learning and Testing Dynamic Environments. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Talya Eden, Reut Levi, Dana Ron Testing bounded arboricity. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Talya Eden, Dana Ron, C. Seshadhri On Approximating the Number of $k$-cliques in Sublinear Time. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Talya Eden, Shweta Jain 0003, Ali Pinar, Dana Ron, C. Seshadhri Provable and practical approximations for the degree distribution using sublinear graph samples. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira Constructing near spanning trees with few local inspections. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Talya Eden, Amit Levi, Dana Ron, C. Seshadhri Approximately Counting Triangles in Sublinear Time. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Talya Eden, Dana Ron, C. Seshadhri Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron Estimating Simple Graph Parameters in Sublinear Time. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron Testing Bipartiteness of Graphs in Sublinear Time. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron Testing Bipartiteness in the Dense-Graph Model. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld A Local Algorithm for Constructing Spanners in Minor-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Talya Eden, Dana Ron, C. Seshadhri Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Sample-Based Testers. Search on Bibsonomy TOCT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dana Ron, Gilad Tsur The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. Search on Bibsonomy TOCT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld A Local Algorithm for Constructing Spanners in Minor-Free Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dana Ron, Rocco A. Servedio Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira Constructing Near Spanning Trees with Few Local Inspections. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Talya Eden, Amit Levi, Dana Ron Approximately Counting Triangles in Sublinear Time. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira Constructing Near Spanning Trees with Few Local Inspections. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Talya Eden, Amit Levi, Dana Ron Approximately Counting Triangles in Sublinear Time. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Clément L. Canonne, Dana Ron, Rocco A. Servedio Testing Probability Distributions using Conditional Samples. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Sample-Based Testers. Search on Bibsonomy ITCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Talya Eden, Amit Levi, Dana Ron, C. Seshadhri Approximately Counting Triangles in Sublinear Time. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Guy Even, Moti Medina, Dana Ron Distributed Maximum Matching in Bounded Degree Graphs. Search on Bibsonomy ICDCN The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dana Ron, Gilad Tsur Testing Properties of Sparse Images. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Testing Similar Means. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Learning and Testing Dynamic Environments. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Dana Ron, Gilad Tsur The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Guy Even, Moti Medina, Dana Ron Distributed Maximum Matching in Bounded Degree Graphs. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Local Algorithms for Sparse Spanning Graphs. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Guy Even, Moti Medina, Dana Ron Best of Two Local Models: Local Centralized and Local Distributed Algorithms. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Artur Czumaj, Oded Goldreich 0001, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler Finding cycles and trees in sublinear time. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Clément L. Canonne, Dana Ron, Rocco A. Servedio Testing equivalence between distributions using conditional samples. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Learning and Testing Dynamic Environments. Search on Bibsonomy FOCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Guy Even, Moti Medina, Dana Ron Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. Search on Bibsonomy ESA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Local Algorithms for Sparse Spanning Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron Comparing the strength of query types in property testing: The case of k-colorability. Search on Bibsonomy Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Testing Properties of Collections of Distributions. Search on Bibsonomy Theory of Computing The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith Sublinear Algorithms for Approximating String Compressibility. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dana Ron, Rocco A. Servedio Exponentially improved algorithms and lower bounds for testing signed majorities. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Sample-Based Testers. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Reut Levi, Dana Ron A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Dana Ron, Gilad Tsur On Approximating the Number of Relevant Variables in a Function. Search on Bibsonomy TOCT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dana Ron, Rocco A. Servedio Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Shafi Goldwasser, Dana Ron On the possibilities and limitations of pseudodeterministic algorithms. Search on Bibsonomy ITCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. Search on Bibsonomy DCC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dana Ron, Gilad Tsur Testing computability by width-two OBDDs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Artur Czumaj, Oded Goldreich 0001, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler Finding Cycles and Trees in Sublinear Time. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Clément L. Canonne, Dana Ron, Rocco A. Servedio Testing probability distributions using conditional samples. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Shafi Goldwasser, Dana Ron On the possibilities and limitations of pseudodeterministic algorithms. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Testing Similar Means. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Clément L. Canonne, Dana Ron, Rocco A. Servedio Testing probability distributions using conditional samples Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Dana Ron, Ronitt Rubinfeld, Muli Safra, Alex Samorodnitsky, Omri Weinstein Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity. Search on Bibsonomy TOCT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Testing Similar Means. Search on Bibsonomy ICALP (1) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Elya Dolev, Dana Ron Distribution-Free Testing for Monomials with a Sublinear Number of Queries. Search on Bibsonomy Theory of Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mira Gonen, Dana Ron, Yuval Shavitt Counting Stars and Other Small Subgraphs in Sublinear-Time. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yaron Orenstein, Dana Ron Testing Eulerianity and connectivity in directed sparse graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dana Ron, Gilad Tsur Testing Computability by Width-Two OBDDs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Dana Ron, Gilad Tsur On Approximating the Number of Relevant Variables in a Function. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Proximity-Oblivious Testing. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron Algorithmic Aspects of Property Testing in the Dense Graphs Model. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Testing Expansion in Bounded-Degree Graphs. Search on Bibsonomy Studies in Complexity and Cryptography The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Testing Properties of Collections of Distributions. Search on Bibsonomy ICS The full citation details ... 2011 DBLP  BibTeX  RDF
1Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dana Ron, Gilad Tsur On Approximating the Number of Relevant Variables in a Function. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shahar Fattal, Dana Ron Approximating the distance to monotonicity in high dimensions. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mira Gonen, Dana Ron On the Benefits of Adaptivity in Property Testing of Dense Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Reut Levi, Dana Ron, Ronitt Rubinfeld Testing Properties of Collections of Distributions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Artur Czumaj, Oded Goldreich 0001, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler Finding Cycles and Trees in Sublinear Time Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Mira Gonen, Dana Ron, Yuval Shavitt Counting Stars and Other Small Subgraphs in Sublinear Time. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gilad Tsur, Dana Ron Testing Properties of Sparse Images. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dana Ron, Gilad Tsur Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. Search on Bibsonomy CIAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. Search on Bibsonomy Property Testing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron Algorithmic Aspects of Property Testing in the Dense Graphs Model. Search on Bibsonomy Property Testing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Elya Dolev, Dana Ron Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sharon Marko, Dana Ron Approximating the distance to properties in bounded-degree and general sparse graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Sublinear approximation algorithms, property testing, graph properties, distance approximation
1Dana Ron, Mira Gonen, Yuval Shavitt Counting Stars and Other Small Subgraphs in Sublinear Time. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Dana Ron Algorithmic and Analysis Techniques in Property Testing. Search on Bibsonomy Foundations and Trends in Theoretical Computer Science The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 211 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license