Author of the publication

The Arboricity Captures the Complexity of Sampling Edges.

, , and . ICALP, volume 132 of LIPIcs, page 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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 Sublinear Bipartiteness Tester for Bounded Degree Graphs., and . Combinatorica, 19 (3): 335-373 (1999)Estimating Simple Graph Parameters in Sublinear Time., and . Encyclopedia of Algorithms, (2016)Algorithmic Aspects of Property Testing in the Dense Graphs Model., and . SIAM J. Comput., 40 (2): 376-445 (2011)On Proximity-Oblivious Testing., and . SIAM J. Comput., 40 (2): 534-566 (2011)Testing metric properties., and . STOC, page 276-285. ACM, (2001)Approximating average parameters of graphs., and . Random Struct. Algorithms, 32 (4): 473-493 (2008)Testing the diameter of graphs., and . Random Struct. Algorithms, 20 (2): 165-183 (2002)Chinese remaindering with errors., , and . IEEE Trans. Inf. Theory, 46 (4): 1330-1338 (2000)Tolerant property testing and distance approximation., , and . J. Comput. Syst. Sci., 72 (6): 1012-1042 (2006)Algorithmic Aspects of Property Testing in the Dense Graphs Model., and . Electron. Colloquium Comput. Complex., (2008)