Ilan Newman

Private vs. common random bits in communication complexity

Ilan Newman · Information Processing Letters · 1991 · 333 citations

Computing, Communication, Computer Science +14

Monotonicity testing over general poset domains

Eldar Fischer, Eric Lehman, Ilan Newman et al. · 2002 · 196 citations

Computing, Computer Science, Mathematics +13

Cuts, Trees and ℓ1-Embeddings of Graphs*

Anupam Gupta†, Ilan Newman, Yuri Rabinovich et al. · COMBINATORICA · 2004 · 177 citations

Computing, Computer Science, Mathematics +8

A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity

Noga Alon, Eldar Fischer, Ilan Newman et al. · SIAM Journal on Computing · 2009 · 160 citations

Natural Sciences, Computer Science, Mathematics +9

Treewidth governs the complexity of target set selection

Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov et al. · Discrete Optimization · 2010 · 128 citations

Computing, Computer Science, Algorithms +8