Sotabase

Career

· President, Tel Aviv University2007–2009
· Dean of The Fu Foundation School of Engineering & Applied Science, Columbia University1995–2007
· Chair of the Computer Science Department, Columbia University1989–1994
· Julian Clarence Levi Professor of Mathematical Methods and Computer Science, Columbia University1987–
· Professor, Department of Computer Science, Columbia University1982–
· Chair of the Computer Science Department, Tel Aviv University1979–1982
· Faculty Member, Computer Science Department, Tel Aviv University1976–1995
· Postdoctoral Researcher, IBM1975–1976
· PhD in Computer Science, Cornell University1972–1975
· M.Sc. in Applied Mathematics, Tel Aviv University1970–1971
· B.Sc. in Applied Mathematics, Tel Aviv University1967–1970

Publications (231)

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Comb. · 1986
568
cited
Efficient algorithms for finding maximum matching in graphs
CSUR · 1986
546
cited
Explicit constructions of linear size superconcentrators
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · 1979
442
cited
Sparsification—a technique for speeding up dynamic graph algorithms
JACM · 1997
338
cited
On the Exponent of the All Pairs Shortest Path Problem
Journal of computer and system sciences (Print) · 1991
226
cited
Dynamic Graph Algorithms
Algorithms and Theory of Computation Handbook · 1999
222
cited
Pattern matching algorithms
1997
219
cited
Lower bounds on communication complexity
Symposium on the Theory of Computing · 1984
211
cited
NP Completeness of Finding the Chromatic Index of Regular Graphs
J. Algorithms · 1983
209
cited
Data structures and algorithms for disjoint set union problems
CSUR · 1991
206
cited
An Improved Algorithm for Approximate String Matching
SIAM journal on computing (Print) · 1989
205
cited
Time-Space-Optimal String Matching
Journal of computer and system sciences (Print) · 1983
185
cited
An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
SIAM journal on computing (Print) · 1986
179
cited
Sparsification-a technique for speeding up dynamic graph algorithms
Proceedings., 33rd Annual Symposium on Foundations of Computer Science · 1992
167
cited
Sparse dynamic programming I: linear cost functions
JACM · 1992
164
cited
Data structures and algorithms for approximate string matching
Journal of Complexity · 1988
157
cited
Proceedings of the 30th IEEE symposium on Foundations of computer science
IEEE Annual Symposium on Foundations of Computer Science · 1994
156
cited
Optimal parallel algorithms for string matching
Symposium on the Theory of Computing · 1984
149
cited
Combinatorial Algorithms on Words
1985
146
cited
On improving the worst case running time of the Boyer-Moore string matching algorithm
International Colloquium on Automata, Languages and Programming · 1978
138
cited
Sotabase
Zvi Galil | Researcher Profile | Sotabase | Sotabase