The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dana Ron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oded Goldreich, Dana Ron
    Approximating Average Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:363-374 [Conf]
  2. Sharon Marko, Dana Ron
    Distance Approximation in Bounded-Degree and General Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:475-486 [Conf]
  3. Scott E. Decatur, Oded Goldreich, Dana Ron
    Computational Sample Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:130-142 [Conf]
  4. Yoav Freund, Dana Ron
    Learning to Model Sequences Generated by Switching Distributions. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:41-50 [Conf]
  5. Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron
    An Experimental and Theoretical Comparison of Model Selection Methods. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:21-30 [Conf]
  6. Michael J. Kearns, Dana Ron
    Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:152-162 [Conf]
  7. Michael J. Kearns, Dana Ron
    Testing Problems with Sub-Learning Sample Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:268-279 [Conf]
  8. Nina Mishra, Dana Ron, Ram Swaminathan
    On Finding Large Conjunctive Clusters. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:448-462 [Conf]
  9. Dana Ron, Ronitt Rubinfeld
    Learning Fallible Finite State Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:218-227 [Conf]
  10. Dana Ron, Ronitt Rubinfeld
    Exactly Learning Automata with Small Cover Time. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:427-436 [Conf]
  11. Dana Ron, Yoram Singer, Naftali Tishby
    Learning Probabilistic Automata with Variable Memory Length. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:35-46 [Conf]
  12. Dana Ron, Yoram Singer, Naftali Tishby
    On the Learnability and Usage of Acyclic Probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:31-40 [Conf]
  13. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
    Testing of Clustering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:240-250 [Conf]
  14. Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
    Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:691-700 [Conf]
  15. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing Juntas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:103-112 [Conf]
  16. Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire
    Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:332-341 [Conf]
  17. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron
    Testing Monotonicity. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:426-435 [Conf]
  18. Oded Goldreich, Shafi Goldwasser, Dana Ron
    Property Testing and Its Connection to Learning and Approximation. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:339-348 [Conf]
  19. Tali Kaufman, Dana Ron
    Testing Polynomials over General Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:413-422 [Conf]
  20. Michael A. Bender, Dana Ron
    Testing Acyclicity of Directed Graphs in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:809-820 [Conf]
  21. Dana Ron, Yoram Singer, Naftali Tishby
    The Power of Amnesia. [Citation Graph (0, 0)][DBLP]
    NIPS, 1993, pp:176-183 [Conf]
  22. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Testing Parenthesis Languages. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:261-272 [Conf]
  23. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    On Testing Convexity and Submodularity. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:11-25 [Conf]
  24. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Proclaiming Dictators and Juntas or Testing Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:273-284 [Conf]
  25. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Low-Degree Polynomials over GF(2(. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:188-199 [Conf]
  26. Tali Kaufman, Michael Krivelevich, Dana Ron
    Tight Bounds for Testing Bipartiteness in General Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:341-353 [Conf]
  27. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
    Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:97-108 [Conf]
  28. Michal Parnas, Dana Ron
    Testing the Diameter of Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:85-96 [Conf]
  29. Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
    Testing triangle-freeness in general graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:279-288 [Conf]
  30. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
    The Power of a Pebble: Exploring and Mapping Directed Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:269-278 [Conf]
  31. Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
    Efficient learning of typical finite automata from random walks. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:315-324 [Conf]
  32. Oded Goldreich, Dana Ron
    Property Testing in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:406-415 [Conf]
  33. Oded Goldreich, Dana Ron
    A Sublinear Bipartiteness Tester for Bunded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:289-298 [Conf]
  34. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese Remaindering with Errors. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:225-234 [Conf]
  35. Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
    On the learnability of discrete distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:273-282 [Conf]
  36. Ilan Kremer, Noam Nisan, Dana Ron
    On randomized one-round communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:596-605 [Conf]
  37. Michal Parnas, Dana Ron
    Testing metric properties. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:276-285 [Conf]
  38. Oded Goldreich, Dana Ron
    Property Testing in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:302-343 [Journal]
  39. Ilan Kremer, Noam Nisan, Dana Ron
    Errata for: "On randomized one-round communication complexity". [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:314-315 [Journal]
  40. Ilan Kremer, Noam Nisan, Dana Ron
    On Randomized One-Round Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:1, pp:21-49 [Journal]
  41. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky
    Testing Monotonicity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:3, pp:301-337 [Journal]
  42. Oded Goldreich, Dana Ron
    A Sublinear Bipartiteness Tester for Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:3, pp:335-373 [Journal]
  43. Oded Goldreich, Dana Ron
    On Testing Expansion in Bounded-Degree Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:20, pp:- [Journal]
  44. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Proclaiming Dictators and Juntas or Testing Boolean Formulae [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:063, pp:- [Journal]
  45. Meir Feder, Dana Ron, Ami Tavory
    Bounds on Linear Codes for Network Multicast [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:033, pp:- [Journal]
  46. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Tolerant Property Testing and Distance Approximation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:010, pp:- [Journal]
  47. Oded Goldreich, Dana Ron
    On Estimating the Average Degree of a Graph [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:013, pp:- [Journal]
  48. Oded Goldreich, Dana Ron
    Approximating Average Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:073, pp:- [Journal]
  49. Michal Parnas, Dana Ron
    On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:094, pp:- [Journal]
  50. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith
    Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:125, pp:- [Journal]
  51. Scott E. Decatur, Oded Goldreich, Dana Ron
    Computational Sample Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:28, pp:- [Journal]
  52. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese Remaindering with Errors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:62, pp:- [Journal]
  53. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
    Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:17, pp:- [Journal]
  54. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
    The Power of a Pebble: Exploring and Mapping Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:1-21 [Journal]
  55. Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
    Efficient Learning of Typical Finite Automata from Random Walks. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:138, n:1, pp:23-48 [Journal]
  56. Michal Parnas, Dana Ron
    Testing metric properties. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:2, pp:155-195 [Journal]
  57. Michael Ben-Or, Dana Ron
    Agreement in the Presence of Faults, on Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:6, pp:329-334 [Journal]
  58. Oded Goldreich, Dana Ron
    On Universal Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:131-136 [Journal]
  59. Dana Ron, Amir Rosenfeld, Salil P. Vadhan
    The hardness of the Expected Decision Depth problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:112-118 [Journal]
  60. Oded Goldreich, Shafi Goldwasser, Dana Ron
    Property Testing and its Connection to Learning and Approximation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:4, pp:653-750 [Journal]
  61. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing juntas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:753-787 [Journal]
  62. Michael J. Kearns, Dana Ron
    Testing Problems with Sublearning Sample Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:3, pp:428-456 [Journal]
  63. Dana Ron, Yoram Singer, Naftali Tishby
    On the Learnability and Usage of Acyclic Probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:2, pp:133-152 [Journal]
  64. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Tolerant property testing and distance approximation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:6, pp:1012-1042 [Journal]
  65. Eric Lehman, Dana Ron
    On Disjoint Chains of Subsets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:2, pp:399-404 [Journal]
  66. Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron
    An Experimental and Theoretical Comparison of Model Selection Methods. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1997, v:27, n:1, pp:7-50 [Journal]
  67. Dana Ron
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1998, v:30, n:1, pp:5-6 [Journal]
  68. Nina Mishra, Dana Ron, Ram Swaminathan
    A New Conceptual Clustering Framework. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:115-151 [Journal]
  69. Dana Ron, Ronitt Rubinfeld
    Learning Fallible Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1995, v:18, n:2-3, pp:149-185 [Journal]
  70. Dana Ron, Ronitt Rubinfeld
    Exactly Learning Automata of Small Cover Time. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1997, v:27, n:1, pp:69-96 [Journal]
  71. Dana Ron, Yoram Singer, Naftali Tishby
    The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1996, v:25, n:2-3, pp:117-149 [Journal]
  72. Michael J. Kearns, Dana Ron
    Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1999, v:11, n:6, pp:1427-1453 [Journal]
  73. Michael A. Bender, Dana Ron
    Testing properties of directed graphs: acyclicity and connectivity. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:2, pp:184-205 [Journal]
  74. Michal Parnas, Dana Ron
    Testing the diameter of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:2, pp:165-183 [Journal]
  75. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Testing membership in parenthesis languages. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:1, pp:98-138 [Journal]
  76. Scott E. Decatur, Oded Goldreich, Dana Ron
    Computational Sample Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:854-879 [Journal]
  77. Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
    Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:33, n:1, pp:94-136 [Journal]
  78. Tali Kaufman, Michael Krivelevich, Dana Ron
    Tight Bounds for Testing Bipartiteness in General Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1441-1483 [Journal]
  79. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    On Testing Convexity and Submodularity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1158-1184 [Journal]
  80. Tali Kaufman, Dana Ron
    Testing Polynomials over General Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:779-802 [Journal]
  81. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
    Testing of Clustering. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:3, pp:393-417 [Journal]
  82. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Testing Basic Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:16, n:1, pp:20-46 [Journal]
  83. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4032-4039 [Journal]
  84. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese remaindering with errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1330-1338 [Journal]
  85. Tali Kaufman, Dana Ron
    A characterization of low-weight words that span generalized reed-muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4039-4043 [Journal]
  86. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
    Sublinear Algorithms for Approximating String Compressibility. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:609-623 [Conf]
  87. Mira Gonen, Dana Ron
    On the Benefits of Adaptivity in Property Testing of Dense Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:525-539 [Conf]
  88. Dana Ron
    Property Testing: A Learning Theory Perspective. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:1-2 [Conf]
  89. Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
    Finding a Dense-Core in Jellyfish Graphs. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:29-40 [Conf]
  90. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
    Sublinear Algorithms for Approximating String Compressibility [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  91. Michal Parnas, Dana Ron
    Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:183-196 [Journal]

  92. Testing Computability by Width Two OBDDs. [Citation Graph (, )][DBLP]


  93. Algorithmic Aspects of Property Testing in the Dense Graphs Model. [Citation Graph (, )][DBLP]


  94. Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries. [Citation Graph (, )][DBLP]


  95. Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. [Citation Graph (, )][DBLP]


  96. Approximating Average Parameters of Graphs. [Citation Graph (, )][DBLP]


  97. Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. [Citation Graph (, )][DBLP]


  98. Comparing the strength of query types in property testing: the case of testing k-colorability. [Citation Graph (, )][DBLP]


  99. Counting Stars and Other Small Subgraphs in Sublinear Time. [Citation Graph (, )][DBLP]


  100. On proximity oblivious testing. [Citation Graph (, )][DBLP]


  101. Finding a dense-core in Jellyfish graphs. [Citation Graph (, )][DBLP]


  102. Finding Cycles and Trees in Sublinear Time [Citation Graph (, )][DBLP]


  103. Algorithmic Aspects of Property Testing in the Dense Graphs Model. [Citation Graph (, )][DBLP]


  104. On Proximity Oblivious Testing. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.042secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002