( en | de | ru )

 

Disambiguation of "Newman, Ilan"

Author of the publication

copydeleteadd this publication to your clipboard
Testing versus Estimation of Graph Properties.

, and . SIAM J. Comput., 37 (2): 482-501 (2007)

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.

Ilan Moradi

Dragutin Ilan i

Ilan Katz

Ilan Wolff

Ilan Golan

 

Other publications of authors with the same name

A combinatorial characterization of the testable graph properties: it's all about regularity., , , and . STOC, page 251-260. ACM, (2006)LCS Approximation via Embedding into Local Non-repetitive Strings., , and . CPM, volume 5577 of Lecture Notes in Computer Science, page 92-105. Springer, (2009)Partitioning multi-dimensional sets in a small number of üniform" parts., , , , and . Eur. J. Comb., 28 (1): 134-144 (2007)On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs., , and . Comput. Complex., 29 (1): 1 (2020)Increasing Kolmogorov Complexity., , , and . STACS, volume 3404 of Lecture Notes in Computer Science, page 412-421. Springer, (2005)Coresets for Decision Trees of Signals., , , and . NeurIPS, page 30352-30364. (2021)Hierarchy Theorems for Property Testing., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 504-519. Springer, (2009)Testing st -Connectivity., , , , and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 380-394. Springer, (2007)Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs., , , , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 95-109. Springer, (2010)Space Complexity vs. Query Complexity., , and . APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, page 426-437. Springer, (2006)