( en | de | ru )

 

Disambiguation of "Newman, Ilan"

Author of the publication

copydeleteadd this publication to your clipboard
Hierarchy Theorems for Property Testing.

, , , and . Comput. Complex., 21 (1): 129-192 (2012)

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

Embedding k-Outerplanar Graphs into l 1., , , , and . SIAM J. Discret. Math., 20 (1): 119-136 (2006)On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity., , and . Theor. Comput. Sci., 107 (1): 63-76 (1993)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)Space Complexity vs. Query Complexity., , and . APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, page 426-437. Springer, (2006)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)Testing st -Connectivity., , , , and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 380-394. Springer, (2007)Hierarchy Theorems for Property Testing., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 504-519. Springer, (2009)Computing in Fault Tolerance Broadcast Networks.. CCC, page 113-122. IEEE Computer Society, (2004)