The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ronitt Rubinfeld: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronitt Rubinfeld, Richard Zippel
    A new modular interpolation algorithm for factoring multivariate polynominals. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:93-107 [Conf]
  2. Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
    Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:273-285 [Conf]
  3. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
    The Complexity of Approximating the Entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:17- [Conf]
  4. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    On Learning Bounded-Width Branching Programs. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:361-368 [Conf]
  5. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    Learning Distributions from Random Walks. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:243-249 [Conf]
  6. Dana Ron, Ronitt Rubinfeld
    Learning Fallible Finite State Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:218-227 [Conf]
  7. Dana Ron, Ronitt Rubinfeld
    Exactly Learning Automata with Small Cover Time. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:427-436 [Conf]
  8. Joe Kilian, Ronitt Rubinfeld
    Interactive Proofs with Space Bounded Provers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:225-231 [Conf]
  9. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
    Reconstructing Algebraic Functions from Mixed Data [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:503-512 [Conf]
  10. Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
    Testing Random Variables for Independence and Identity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:442-451 [Conf]
  11. Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
    Testing that distributions are close. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:259-269 [Conf]
  12. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    Approximate Checking of Polynomials and Functional Equations (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:592-601 [Conf]
  13. 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]
  14. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:294-303 [Conf]
  15. Jon M. Kleinberg, Ronitt Rubinfeld
    Short Paths in Expander Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:86-95 [Conf]
  16. Ronitt Rubinfeld
    On the robustness of functional equations [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:288-299 [Conf]
  17. Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
    Approximating the Minimum Spanning Tree Weight in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:190-200 [Conf]
  18. Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
    Selective private function evaluation with applications to private statistics. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:293-304 [Conf]
  19. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Testing Parenthesis Languages. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:261-272 [Conf]
  20. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    On Testing Convexity and Submodularity. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:11-25 [Conf]
  21. Tugkan Batu, Ronitt Rubinfeld, Patrick White
    Fast Approximate PCPs for Multidimensional Bin-Packing Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:245-256 [Conf]
  22. Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal
    The Bloomier filter: an efficient data structure for static support lookup tables. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:30-39 [Conf]
  23. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:813-822 [Conf]
  24. Ronitt Rubinfeld, Madhu Sudan
    Self-Testing Polynomial Functions Efficiently and Over Rational Domains. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:23-32 [Conf]
  25. Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
    A sublinear algorithm for weakly approximating edit distance. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:316-324 [Conf]
  26. Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
    Sublinear algorithms for testing monotone and unimodal distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:381-390 [Conf]
  27. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
    The complexity of approximating entropy. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:678-687 [Conf]
  28. Manuel Blum, Michael Luby, Ronitt Rubinfeld
    Self-Testing/Correcting with Applications to Numerical Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:73-83 [Conf]
  29. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
    Spot-Checkers. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:259-268 [Conf]
  30. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    Fast Approximate PCPs. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:41-50 [Conf]
  31. Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins
    Random walks with ``back buttons'' (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:484-493 [Conf]
  32. Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
    Monotonicity testing over general poset domains. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:474-483 [Conf]
  33. 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]
  34. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson
    Self-Testing/Correcting for Polynomials and for Approximate Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:32-42 [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. Ronitt Rubinfeld, Rocco A. Servedio
    Testing monotone high-dimensional distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:147-156 [Conf]
  37. Ronitt Rubinfeld
    Designing Checkers for Programs that Run in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:4, pp:287-301 [Journal]
  38. 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]
  39. Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
    Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:052, pp:- [Journal]
  40. 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]
  41. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries - The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:60, pp:- [Journal]
  42. Tugkan Batu, Ronitt Rubinfeld, Patrick White
    Fast approximate PCPs for multidimensional bin-packing problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:196, n:1, pp:42-56 [Journal]
  43. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    Fast approximate probabilistically checkable proofs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:2, pp:135-159 [Journal]
  44. 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]
  45. Sandy Irani, Ronitt Rubinfeld
    A Competitive 2-Server Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:2, pp:85-91 [Journal]
  46. Ronitt Rubinfeld
    The Cover Time of a Regular Expander is O(n log n). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:1, pp:49-51 [Journal]
  47. Ronitt Rubinfeld
    Batch Checking with Applications to Linear Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:2, pp:77-80 [Journal]
  48. Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld
    Reversing Trains: A Turn of the Century Sorting Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:3, pp:413-428 [Journal]
  49. Manuel Blum, Michael Luby, Ronitt Rubinfeld
    Self-Testing/Correcting with Applications to Numerical Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:3, pp:549-595 [Journal]
  50. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
    Spot-Checkers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:717-751 [Journal]
  51. 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]
  52. 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]
  53. 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]
  54. Sandy Irani, Moni Naor, Ronitt Rubinfeld
    On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil? [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:2, pp:141-159 [Journal]
  55. 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]
  56. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
    Reconstructing Algebraic Functions from Mixed Data. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:487-510 [Journal]
  57. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
    The Complexity of Approximating the Entropy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:132-150 [Journal]
  58. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal]
  59. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    Checking Approximate Computations of Polynomials and Functional Equations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:550-576 [Journal]
  60. 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]
  61. Ronitt Rubinfeld
    On the Robustness of Functional Equations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:1972-1997 [Journal]
  62. Ronitt Rubinfeld, Madhu Sudan
    Robust Characterizations of Polynomials with Applications to Program Testing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:252-271 [Journal]
  63. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:535-570 [Journal]
  64. 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]
  65. Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie
    Testing k-wise and almost k-wise independence. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:496-505 [Conf]
  66. 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]

  67. Testing ±1-weight halfspace. [Citation Graph (, )][DBLP]


  68. 05291 Abstracts Collection -- Sublinear Algorithms. [Citation Graph (, )][DBLP]


  69. Testing for Concise Representations. [Citation Graph (, )][DBLP]


  70. External Sampling. [Citation Graph (, )][DBLP]


  71. Testing Non-uniform k-Wise Independent Distributions over Product Spaces. [Citation Graph (, )][DBLP]


  72. Testing halfspaces. [Citation Graph (, )][DBLP]


  73. Maintaining a large matching and a small vertex cover. [Citation Graph (, )][DBLP]


  74. Improved Recommendations via (More) Collaboration. [Citation Graph (, )][DBLP]


  75. Sublinear Time Algorithms for Earth Mover's Distance [Citation Graph (, )][DBLP]


  76. Testing for Concise Representations. [Citation Graph (, )][DBLP]


  77. Testing Halfspaces. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.466secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002