Efficient algorithms for finding minimum spanning trees in undirected and directed graphs HN Gabow, Z Galil, T Spencer, RE Tarjan
Combinatorica 6 (2), 109-122, 1986
748 1986 Efficient algorithms for finding maximum matching in graphs Z Galil
ACM Computing Surveys (CSUR) 18 (1), 23-38, 1986
674 1986 Explicit constructions of linear-sized superconcentrators O Gabber, Z Galil
Journal of Computer and System Sciences 22 (3), 407-420, 1981
624 1981 Sparsification—a technique for speeding up dynamic graph algorithms D Eppstein, Z Galil, GF Italiano, A Nissenzweig
Journal of the ACM (JACM) 44 (5), 669-696, 1997
535 1997 Pattern matching algorithms A Apostolico, Z Galil
Oxford University Press, USA, 1997
382 1997 Data structures and algorithms for disjoint set union problems Z Galil, GF Italiano
ACM Computing Surveys (CSUR) 23 (3), 319-344, 1991
292 1991 On the exponent of the all pairs shortest path problem N Alon, Z Galil, O Margalit
Journal of Computer and System Sciences 54 (2), 255-262, 1997
290 1997 Time-space-optimal string matching Z Galil, J Seiferas
Journal of Computer and System Sciences 26 (3), 280-294, 1983
250 1983 An improved algorithm for approximate string matching Z Galil, K Park
SIAM Journal on Computing 19 (6), 989-999, 1990
237 1990 NP completeness of finding the chromatic index of regular graphs D Leven, Z Galil
Journal of Algorithms 4 (1), 35-44, 1983
237 1983 Dynamic graph algorithms D Eppstein, Z Galil, GF Italiano
Algorithms and theory of computation handbook 1, 9.1-9.28, 1999
229 1999 Faster tree pattern matching M Dubiner, Z Galil, E Magen
Journal of the ACM (JACM) 41 (2), 205-213, 1994
204 1994 Sparse dynamic programming I: linear cost functions D Eppstein, Z Galil, R Giancarlo, GF Italiano
Journal of the ACM (JACM) 39 (3), 519-545, 1992
203 1992 Data structures and algorithms for approximate string matching Z Galil, R Giancarlo
Journal of Complexity 4 (1), 33-72, 1988
196 1988 On improving the worst case running time of the Boyer-Moore string matching algorithm Z Galil
Communications of the ACM 22 (9), 505-508, 1979
189 1979 An Algorithm for Finding a Maximal Weighted Matching in General Graphs Z Galil, S Micali, H Gabow
SIAM Journal on Computing 15 (1), 120-130, 1986
180 1986 Optimal parallel algorithms for string matching Z Galil*
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
180 1984 Cryptographic computation: Secure fault-tolerant protocols and the public-key model Z Galil, S Haber, M Yung
Conference on the Theory and Application of Cryptographic Techniques, 135-155, 1987
170 1987 Parallel algorithmic techniques for combinational computation D Eppstein, Z Galil
Annual review of computer science 3 (1), 233-283, 1988
162 1988 Improved string matching with k mismatches Z Galil, R Giancarlo
ACM SIGACT News 17 (4), 52-54, 1986
162 1986