Ilan Newman

Cited by

	All	Since 2016
Citations	3348	974
h-index	30	18
i10-index	64	24

220

110

165

19921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202111 11 20 23 14 24 31 21 37 39 47 86 100 111 130 142 198 130 186 187 173 193 193 183 187 162 185 213 205 17

Co-authors

Yuri RabinovichCS Dept, Haifa UniversityVerified 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
Assaf SchusterProfessor of Computer Science, TechnionVerified email at cs.technion.ac.il
Oren Ben-ZwiRuppin Academic CenterVerified email at ruppin.ac.il
Harry BuhrmanGroup leader CWI & Distinguished Research Professor University of Amsterdam & Director QuSoftVerified email at cwi.nl
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Asaf ShapiraTel Aviv UniversityVerified email at tau.ac.il
Anupam GuptaProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Hein RoehrigGoogleVerified email at google.com
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneVerified email at uni-koeln.de
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityVerified email at csail.mit.edu
Yosi Ben AsherProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityVerified email at post.tau.ac.il
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
Mario SzegedyProfessor of Computer Science, Rutgers UniversityVerified email at cs.rutgers.edu
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Nati LinialProfessor of Computer Science, The Hebrew University of JerusalemVerified email at cs.huji.ac.il
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
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	330	1991
A combinatorial characterization of the testable graph properties: it's all about regularity N Alon, E Fischer, I Newman, A Shapira SIAM Journal on Computing 39 (1), 143-167, 2009	251	2009
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	222	2002
Cuts, Trees and ℓ₁-Embeddings of Graphs A Gupta, I Newman, Y Rabinovich, A Sinclair Combinatorica 24 (2), 233-269, 2004	182	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	167	2001
On grid intersection graphs IBA Hartman, I Newman, R Ziv Discrete Mathematics 87 (1), 41-52, 1991	127	1991
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	101	1996
Testing versus estimation of graph properties E Fischer, I Newman SIAM Journal on Computing 37 (2), 482-501, 2007	97	2007
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	96	2011
Every property of hyperfinite graphs is testable I Newman, C Sohler SIAM Journal on Computing 42 (3), 1095-1112, 2013	93	2013
Quantum property testing H Buhrman, L Fortnow, I Newman, H Röhrig SIAM Journal on Computing 37 (5), 1387-1400, 2008	65	2008
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	65	2006
Combinatorial characterization of read-once formulae M Karchmer, N Linial, I Newman, M Saks, A Wigderson Discrete Mathematics 114 (1-3), 275-282, 1993	63	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	60	2002
Optimal search in trees Y Ben-Asher, E Farchi, I Newman SIAM Journal on Computing 28 (6), 2090-2102, 1999	60	1999
Hot-potato algorithms for permutation routing I Newman, A Schuster IEEE Transactions on Parallel and Distributed Systems 6 (11), 1168-1176, 1995	57	1995
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	57*	1995
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	53	2005
Testing membership in languages that have small width branching programs I Newman SIAM Journal on Computing 31 (5), 1557-1570, 2002	52	2002
The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011	50	2011

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

Upload PDF

Follow this author

Cited by

Co-authors