Ilan Newman
Ilan Newman
Professor of Computer Science, University of Haifa
Dirección de correo verificada de - Página principal
Citado por
Citado por
Private vs. common random bits in communication complexity
I Newman
Information processing letters 39 (2), 67-71, 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
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
Cuts, trees and ℓ 1-embeddings of graphs
A Gupta, I Newman, Y Rabinovich, A Sinclair
Combinatorica 24 (2), 233-269, 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
On grid intersection graphs
IBA Hartman, I Newman, R Ziv
Discrete Mathematics 87 (1), 41-52, 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
Testing versus estimation of graph properties
E Fischer, I Newman
SIAM Journal on Computing 37 (2), 482-501, 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
Every property of hyperfinite graphs is testable
I Newman, C Sohler
SIAM Journal on Computing 42 (3), 1095-1112, 2013
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
Quantum property testing
H Buhrman, L Fortnow, I Newman, H Röhrig
SIAM Journal on Computing 37 (5), 1387-1400, 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
Optimal search in trees
Y Ben-Asher, E Farchi, I Newman
SIAM Journal on Computing 28 (6), 2090-2102, 1999
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
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
Hot-potato algorithms for permutation routing
I Newman, A Schuster
IEEE Transactions on Parallel and Distributed Systems 6 (11), 1168-1176, 1995
Testing membership in languages that have small width branching programs
I Newman
SIAM Journal on Computing 31 (5), 1557-1570, 2002
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
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20