Sotabase

Career

· Professor, Tel Aviv University2008–
· Edwin Sibley Webster Professor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology2004–
· Fellow, Radcliffe Institute for Advanced Study2004–
· Senior Researcher, NEC Laboratories1999–2003
· Associate Professor, Cornell University1998–2000
· Visiting Researcher, IBM Research Almaden1998–1999
· Assistant Professor, Cornell University1992–1998
· Visiting Research Scientist, Hebrew University of Jerusalem1991–1992
· Postdoctoral Researcher, Princeton University1990–1991
· PhD in Computer Science, University of California, Berkeley1990–
· B.S.E. in Computer Engineering, University of Michigan1985–

Publications (419)

Self-testing/correcting with applications to numerical problems
Symposium on the Theory of Computing · 1990
1,030
cited
Robust Characterizations of Polynomials with Applications to Program Testing
SIAM journal on computing (Print) · 1996
826
cited
The Bloomier filter: an efficient data structure for static support lookup tables
ACM-SIAM Symposium on Discrete Algorithms · 2004
458
cited
Testing that distributions are close
Proceedings 41st Annual Symposium on Foundations of Computer Science · 2000
335
cited
On the learnability of discrete distributions
Symposium on the Theory of Computing · 1994
322
cited
Testing random variables for independence and identity
Proceedings IEEE International Conference on Cluster Computing · 2001
252
cited
Monotonicity testing over general poset domains
Symposium on the Theory of Computing · 2002
226
cited
Self-testing/correcting for polynomials and for approximate functions
Symposium on the Theory of Computing · 1991
221
cited
Tolerant property testing and distance approximation
Journal of computer and system sciences (Print) · 2006
218
cited
Spot-checkers
Symposium on the Theory of Computing · 1998
214
cited
Sublinear Time Algorithms
SIAM Journal on Discrete Mathematics · 2011
198
cited
The complexity of approximating entropy
Symposium on the Theory of Computing · 2002
193
cited
Learning polynomials with queries: The highly noisy case
Proceedings of IEEE 36th Annual Foundations of Computer Science · 1995
184
cited
Approximating the Minimum Spanning Tree Weight in Sublinear Time
International Colloquium on Automata, Languages and Programming · 2001
177
cited
Testing Closeness of Discrete Distributions
JACM · 2010
170
cited
Fast Local Computation Algorithms
International Conference on Supercomputing · 2011
152
cited
Sublinear algorithms for testing monotone and unimodal distributions
Symposium on the Theory of Computing · 2004
147
cited
Testing k-wise and almost k-wise independence
Symposium on the Theory of Computing · 2007
141
cited
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2018
137
cited
Testing for Concise Representations
IEEE Annual Symposium on Foundations of Computer Science · 2007
129
cited
Sotabase