Ilan Newman

Cited by

	All	Since 2020
Citations	4205	998
h-index	33	19
i10-index	69	29

220

110

165

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202511 23 26 12 30 27 25 39 42 45 116 94 117 149 161 205 111 193 187 189 187 200 190 202 171 169 195 187 204 196 187 193 30

Public access

View all

5 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Yuri RabinovichCS Dept, Haifa UniversityVerified email at cs.haifa.ac.il
Oren Ben-ZwiComputer Science, Tel-Hai CollegeVerified email at cs.haifa.ac.il
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at quantinuum.com
Assaf SchusterProfessor of Computer Science, TechnionVerified email at technion.ac.il
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityVerified email at csail.mit.edu
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneVerified email at uni-koeln.de
Asaf ShapiraTel Aviv UniversityVerified email at tau.ac.il
Hein RoehrigGoogleVerified email at google.com
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityVerified email at post.tau.ac.il
Yosi Ben AsherProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Mario SzegedyProfessor of Computer Science, Rutgers UniversityVerified email at cs.rutgers.edu
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Nati LinialProfessor of Computer Science, The Hebrew University of JerusalemVerified email at cs.huji.ac.il
Oren WeimannUniversity of HaifaVerified email at cs.haifa.ac.il

Ilan Newman

Professor of Computer Science, University of Haifa

Verified email at cs.haifa.ac.il - Homepage

Theory of computer science combinatorial algorithms complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Private vs. common random bits in communication complexity I Newman Information processing letters 39 (2), 67-71, 1991	416	1991
A combinatorial characterization of the testable graph properties: it's all about regularity N Alon, E Fischer, I Newman, A Shapira Proceedings of the thirty-eighth annual ACM Symposium on Theory of Computing …, 2006	292	2006
Monotonicity testing over general poset domains E Fischer, E Lehman, I Newman, S Raskhodnikova, R Rubinfeld, ... Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	284	2002
Cuts, Trees and ℓ₁-Embeddings of Graphs A Gupta, I Newman, Y Rabinovich, A Sinclair Combinatorica 24 (2), 233-269, 2004	219	2004
Regular languages are testable with a constant number of queries N Alon, M Krivelevich, I Newman, M Szegedy SIAM Journal on Computing 30 (6), 1842-1862, 2001	196	2001
On grid intersection graphs IBA Hartman, I Newman, R Ziv Discrete Mathematics 87 (1), 41-52, 1991	153	1991
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	137	2011
Every property of hyperfinite graphs is testable I Newman, C Sohler Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	128	2011
Public vs. private coin flips in one round communication games I Newman, M Szegedy Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996	121	1996
Testing versus estimation of graph properties E Fischer, I Newman Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	117	2005
Embedding k-outerplanar graphs into l1 C Chekuri, A Gupta, I Newman, Y Rabinovich, A Sinclair SIAM Journal on Discrete Mathematics 20 (1), 119-136, 2006	94	2006
Search problems in the decision tree model L Lovász, M Naor, I Newman, A Wigderson SIAM Journal on Discrete Mathematics 8 (1), 119-132, 1995	89	1995
Optimal search in trees Y Ben-Asher, E Farchi, I Newman SIAM Journal on Computing 28 (6), 2090-2102, 1999	84	1999
Quantum property testing H Buhrman, L Fortnow, I Newman, H Röhrig SIAM Journal on Computing 37 (5), 1387-1400, 2008	83	2008
Combinatorial characterization of read-once formulae M Karchmer, N Linial, I Newman, M Saks, A Wigderson Discrete Mathematics 114 (1-3), 275-282, 1993	73	1993
A lower bound on the distortion of embedding planar metrics into Euclidean space I Newman, Y Rabinovich Proceedings of the eighteenth annual symposium on Computational geometry, 94-96, 2002	70	2002
Efficient testing of bipartite graphs for forbidden induced subgraphs N Alon, E Fischer, I Newman SIAM Journal on Computing 37 (3), 959-976, 2007	68*	2007
Robust polynomials and quantum algorithms H Buhrman, I Newman, H Rohrig, R de Wolf Theory of Computing Systems 40, 379-395, 2007	65	2007
The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59, 129-144, 2011	62	2011
Approximating the weight of the euclidean minimum spanning tree in sublinear time A Czumaj, F Ergün, L Fortnow, A Magen, I Newman, R Rubinfeld, ... SIAM Journal on Computing 35 (1), 91-109, 2005	62	2005

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors