I
Ilan Newman
Researcher at University of Haifa
Publications - 146
Citations - 4292
Ilan Newman is an academic researcher from University of Haifa. The author has contributed to research in topics: Property testing & Boolean function. The author has an hindex of 34, co-authored 145 publications receiving 4053 citations. Previous affiliations of Ilan Newman include Hebrew University of Jerusalem & Eötvös Loránd University.
Papers
More filters
Journal ArticleDOI
Private vs. common random bits in communication complexity
TL;DR: It is shown that the models are essentially equal in communication complexity and the relative power of the common random string model vs. the private randomstring model is investigated.
Proceedings ArticleDOI
Monotonicity testing over general poset domains
Eldar Fischer,Eric Lehman,Ilan Newman,Sofya Raskhodnikova,Ronitt Rubinfeld,Alex Samorodnitsky +5 more
TL;DR: It is shown that in its most general setting, testing that Boolean functions are close to monotone is equivalent, with respect to the number of required queries, to several other testing problems in logic and graph theory.
Proceedings ArticleDOI
A combinatorial characterization of the testable graph properties: it's all about regularity
TL;DR: One of the main open problems in the area of property-testing, which was raised in the 1996 paper of Goldreich, Goldwasser and Ron, is resolved by a purely combinatorial characterization of the graph properties that are testable with a constant number of queries.
Journal ArticleDOI
Cuts, Trees and ℓ 1 -Embeddings of Graphs*
TL;DR: It is shown, surprisingly, that such metrics approximate distances very poorly even for families of graphs with low treewidth, and excludes the possibility of using them to explore the finer structure of ℓ1-embeddability.
Journal ArticleDOI
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
TL;DR: This paper shows that in some sense, testing for Szemeredi-partitions is as hard as testing any testable graph property, and gives an intuitive explanation as to what makes a graph property testable.