Author of the publication

Constructing near spanning trees with few local inspections.

, , , , and . Random Struct. Algorithms, 50 (2): 183-200 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Lower Bound on the Complexity of Testing Grained Distributions., and . Electron. Colloquium Comput. Complex., (2021)On Sample-Based Testers., and . Electron. Colloquium Comput. Complex., (2013)Algorithmic Aspects of Property Testing in the Dense Graphs Model., and . Electron. Colloquium Comput. Complex., (2008)Tolerant property testing and distance approximation., , and . J. Comput. Syst. Sci., 72 (6): 1012-1042 (2006)Chinese remaindering with errors., , and . IEEE Trans. Inf. Theory, 46 (4): 1330-1338 (2000)The Subgraph Testing Model., and . ITCS, volume 124 of LIPIcs, page 37:1-37:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length., , and . Mach. Learn., 25 (2-3): 117-149 (1996)Learning Fallible Deterministic Finite Automata., and . Mach. Learn., 18 (2-3): 149-185 (1995)Comparing the strength of query types in property testing: The case of k-colorability., , , and . Comput. Complex., 22 (1): 89-135 (2013)Errata for: Ön randomized one-round communication complexity"., , and . Comput. Complex., 10 (4): 314-315 (2001)