Ilan Newman

Cited by

	All	Since 2018
Citations	3873	1053
h-index	32	18
i10-index	66	30

220

110

165

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202321 27 12 27 31 24 43 39 43 108 90 128 144 162 193 114 188 181 186 198 203 195 195 176 173 195 186 220 200 79

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
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Oren Ben-ZwiUniversity of HaifaVerified email at cs.haifa.ac.il
Assaf SchusterProfessor of Computer Science, TechnionVerified email at technion.ac.il
Harry BuhrmanGroup leader CWI & Distinguished Research Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at cwi.nl
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
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
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Nati LinialProfessor of Computer Science, The Hebrew University of JerusalemVerified email at cs.huji.ac.il
Arie MatsliahPrinceton UniversityVerified email at princeton.edu

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	381	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	285	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	254	2002
Cuts, Trees and ℓ₁-Embeddings of Graphs A Gupta, I Newman, Y Rabinovich, A Sinclair Combinatorica 24 (2), 233-269, 2004	204	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	187	2001
On grid intersection graphs IBA Hartman, I Newman, R Ziv Discrete Mathematics 87 (1), 41-52, 1991	151	1991
Every property of hyperfinite graphs is testable I Newman, C Sohler Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	117	2011
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	117	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	115	1996
Testing versus estimation of graph properties E Fischer, I Newman Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	110	2005
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	81	1995
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	80	2006
Optimal search in trees Y Ben-Asher, E Farchi, I Newman SIAM Journal on Computing 28 (6), 2090-2102, 1999	76	1999
Quantum property testing H Buhrman, L Fortnow, I Newman, H Röhrig SIAM Journal on Computing 37 (5), 1387-1400, 2008	72	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	70	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	66	2002
Hot-potato algorithms for permutation routing I Newman, A Schuster IEEE Transactions on Parallel and Distributed Systems 6 (11), 1168-1176, 1995	59	1995
Testing membership in languages that have small width branching programs I Newman SIAM Journal on Computing 31 (5), 1557-1570, 2002	58	2002
Robust polynomials and quantum algorithms H Buhrman, I Newman, H Rohrig, R de Wolf Theory of Computing Systems 40, 379-395, 2007	56	2007
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	55	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