Ronitt Rubinfeld (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

108 Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld: A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA 2012: 1123-1131

97 Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld: A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size CoRR abs/1110.1079: (2011)

91 Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243

89 Krzysztof Onak, Ronitt Rubinfeld: Dynamic Approximate Vertex Cover and Maximum Matching. Property Testing 2010: 341-345

88 Krzysztof Onak, Ronitt Rubinfeld: Maintaining a large matching and a small vertex cover. STOC 2010: 457-464

80 Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: External Sampling. ICALP (1) 2009: 83-94

72 Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan: Testing for Concise Representations. FOCS 2007: 549-558

69 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) 14(077): (2007)

Selection of 8 from 110 records - Ronitt Rubinfeld has 90 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

108		Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld: A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA 2012: 1123-1131
97		Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld: A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size CoRR abs/1110.1079: (2011)
91		Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243
89		Krzysztof Onak, Ronitt Rubinfeld: Dynamic Approximate Vertex Cover and Maximum Matching. Property Testing 2010: 341-345
88		Krzysztof Onak, Ronitt Rubinfeld: Maintaining a large matching and a small vertex cover. STOC 2010: 457-464
80		Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: External Sampling. ICALP (1) 2009: 83-94
72		Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan: Testing for Concise Representations. FOCS 2007: 549-558
69		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) 14(077): (2007)