|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 58 occurrences of 49 keywords
|
|
|
|
|
Results
Found 107 publication records. Showing 107 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie |
Space-efficient local computation algorithms.  |
SODA  |
2012 |
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. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Reut Levi, Ronitt Rubinfeld |
Approximating and testing k-histogram distributions in sub-linear time. |
PODS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Asaf Shapira |
Sublinear Time Algorithms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Reut Levi, Ronitt Rubinfeld |
Approximating and Testing k-Histogram Distributions in Sub-linear time. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie |
Fast Local Computation Algorithms |
CoRR |
2011 |
DBLP 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 | Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie |
Space-efficient Local Computation Algorithms |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Asaf Shapira |
Sublinear Time Algorithms. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld |
Sublinear Time Algorithms for Earth Mover's Distance. |
Theory Comput. Syst. |
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 | Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant |
Testing monotonicity of distributions over general partial orders. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie |
Fast Local Computation Algorithms. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Reut Levi, Dana Ron, Ronitt Rubinfeld |
Testing Properties of Collections of Distributions. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld |
A local decision test for sparse polynomials. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant |
Testing monotonicity of distributions over general partial orders. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
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 | Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White |
Testing Closeness of Discrete Distributions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing Halfspaces. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Ning Xie |
Testing Non-uniform k-Wise Independent Distributions over Product Spaces. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld |
Sublinear Algorithms in the External Memory Model. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing (Subclasses of) Halfspaces. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Onak, Ronitt Rubinfeld |
Dynamic Approximate Vertex Cover and Maximum Matching. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rubi Boim, Haim Kaplan, Tova Milo, Ronitt Rubinfeld |
Improved Recommendations via (More) Collaboration. |
WebDB |
2010 |
DBLP BibTeX RDF |
|
| 1 | Krzysztof Onak, Ronitt Rubinfeld |
Maintaining a large matching and a small vertex cover. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
data structures, vertex cover, dynamic algorithms, maximum matching |
| 1 | Ronitt Rubinfeld, Rocco A. Servedio |
Testing monotone high-dimensional distributions. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld |
Sublinear Time Algorithms for Earth Mover's Distance |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing halfspaces. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld |
External Sampling. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing ±1-weight halfspace. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld |
Non-abelian homomorphism testing, and distributions close to their self-convolutions. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld |
Linearity Testing/Testing Hadamard Codes. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld (eds.) |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings |
APPROX-RANDOM |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan |
Testing for Concise Representations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing Halfspaces. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith |
Sublinear Algorithms for Approximating String Compressibility |
CoRR |
2007 |
DBLP 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 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan |
Testing for Concise Representations. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie |
Testing k-wise and almost k-wise independence. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
almost k-wise independence, hidden clique, property testing, Fourier analysis, k-wise independence |
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Tolerant property testing and distance approximation. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (eds.) |
Sublinear Algorithms, 17.07. - 22.07.2005 |
Sublinear Algorithms |
2006 |
DBLP 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 | Tugkan Batu, Ronitt Rubinfeld, Patrick White |
Fast approximate PCPs for multidimensional bin-packing problems. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan |
Approximating the Minimum Spanning Tree Weight in Sublinear Time. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld |
The Complexity of Approximating the Entropy. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler |
05291 Abstracts Collection -- Sublinear Algorithms. |
Sublinear Algorithms |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Rocco A. Servedio |
Testing monotone high-dimensional distributions. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
monotone distributions, property testing, distribution testing, sublinear algorithms |
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Tolerant Property Testing and Distance Approximation |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld |
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld |
Fast approximate probabilistically checkable proofs. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal |
The Bloomier filter: an efficient data structure for static support lookup tables. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld |
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld |
Sublinear algorithms for testing monotone and unimodal distributions. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
monotone and unimodal distributions, property testing, distribution testing, sublinear algorithms |
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Testing membership in parenthesis languages. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi Kumar, Ronitt Rubinfeld |
Algorithms column: sublinear time algorithms. |
SIGACT News |
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 | Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler |
Sublinear-time approximation of Euclidean minimum spanning tree. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami |
A sublinear algorithm for weakly approximating edit distance. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
approximation, string matching, sublinear algorithms |
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
On Testing Convexity and Submodularity. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld |
The Complexity of Approximating the Entropy. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
entropy approximation, black-box distribution, monotone distribution, entropy, sample complexity |
| 1 | Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky |
Monotonicity testing over general poset domains. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
algorithms, property testing, monotone functions |
| 1 | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld |
The complexity of approximating entropy. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld |
Checking Approximate Computations of Polynomials and Functional Equations. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan |
Approximating the Minimum Spanning Tree Weight in Sublinear Time. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright |
Selective private function evaluation with applications to private statistics. |
PODC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Parnas, Dana Ron, Ronitt Rubinfeld |
Testing Parenthesis Languages. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White |
Testing Random Variables for Independence and Identity. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan |
Learning Polynomials with Queries: The Highly Noisy Case. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan |
Spot-Checkers. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White |
Testing that distributions are close. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
distribution closeness testing, rapidly mixing process, computational complexity, lower bound, probability, probability, sampling, Markov processes, Markov process, sublinear algorithm, sublinear algorithms, sampling methods |
| 1 | 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). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld |
On the Robustness of Functional Equations. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Ronitt Rubinfeld, Patrick White |
Fast Approximate PCPs for Multidimensional Bin-Packing Problems. |
RANDOM-APPROX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld |
Fast Approximate PCPs. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan |
Learning Polynomials with Queries - The Highly Noisy Case. |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan |
Reconstructing Algebraic Functions from Mixed Data. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan |
Spot-Checkers. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie |
Efficient Learning of Typical Finite Automata from Random Walks. |
Inf. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Ronitt Rubinfeld |
Exactly Learning Automata of Small Cover Time. |
Machine Learning |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld |
Learning Distributions from Random Walks. |
COLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld |
Designing Checkers for Programs that Run in Parallel. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Madhu Sudan |
Robust Characterizations of Polynomials with Applications to Program Testing. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Ronitt Rubinfeld |
Short Paths in Expander Graphs. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
inter-connection networks, disjoint paths problem, graph minor containment, polylogarithmic approximation, routing algorithms, greedy algorithm, network routing, multicommodity flow, expander graphs |
| 1 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld |
Approximate Checking of Polynomials and Functional Equations (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
approximate checking, polynomial computation, functional equation computation, addition theorems, approximate program output, self-correcting, stability theory, program testing, polynomials, reductions, functions, self-testing, program checking |
| 1 | Dana Ron, Ronitt Rubinfeld |
Learning Fallible Deterministic Finite Automata. |
Machine Learning |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld |
On Learning Bounded-Width Branching Programs. |
COLT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Ronitt Rubinfeld |
Exactly Learning Automata with Small Cover Time. |
COLT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
repeated games playing, computationally bounded adversaries, penny-matching, classically studied finite automata, learning (artificial intelligence), game theory, finite automata, learning algorithm, computational efficiency |
| 1 | Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan |
Learning Polynomials with Queries: The Highly Noisy Case. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
polynomials with queries learning, highly noisy case, n-variate inputs, n-variate degree d polynomials, learning (artificial intelligence), randomized algorithm, finite field, polynomials, explanation, running time, randomised algorithms |
| 1 | Ronitt Rubinfeld, Richard Zippel |
A new modular interpolation algorithm for factoring multivariate polynominals. |
ANTS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld |
On the robustness of functional equations |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
self-correctors, functional equations robustness, self-testing programs, self correcting programs, self-testers, quantifiers |
| 1 | Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie |
On the learnability of discrete distributions. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Blum, Michael Luby, Ronitt Rubinfeld |
Self-Testing/Correcting with Applications to Numerical Problems. |
J. Comput. Syst. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Ronitt Rubinfeld |
Learning Fallible Finite State Automata. |
COLT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie |
Efficient learning of typical finite automata from random walks. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld |
Batch Checking with Applications to Linear Functions. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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? |
Mathematical Systems Theory |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Madhu Sudan |
Self-Testing Polynomial Functions Efficiently and Over Rational Domains. |
SODA |
1992 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 107 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")