- Zvi Galil and Joel Seiferas. A linear-time on-line recognition
algorithm for ``palstar''. Journal of the ACM,
25(1):102-111, January 1978.
- Zvi Galil and Nimrod Megiddo. A fast selection algorithm and the
problem of optimum distribution of effort. Journal of the
ACM, 26(1):58-64, January 1979.
- Zvi Galil. String matching
in real time. Journal of the ACM, 28(1):134-149,
January 1981.
Citations.
- Zvi Galil. An almost
linear-time algorithm for computing a dependency basis in a relational
database. Journal of the ACM, 29(1):96-102, January
1982.
Citations.
- Zvi Galil and Wolfgang J. Paul. An efficient general-purpose
parallel computer. Journal of the ACM, 30(2):360-387,
April 1983.
Citations.
- Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus P. Schnorr, and
Andreas Weber. An
O(n^3 log n) deterministic and an
O(n^3) Las Vegas isomorphism test for trivalent
graphs. Journal of the ACM, 34(3):513-531, July 1987.
- Zvi Galil and Éva Tardos. An O(n^2
(m + n log n)log n) min-cost
flow algorithm. Journal of the ACM, 35(2):374-386,
April 1988.
Citations.
- Harold N. Gabow, Zvi Galil, and Thomas H. Spencer. Efficient implementation of graph
algorithms using contraction. Journal of the ACM,
36(3):540-572, July 1989.
Citations.
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano.
Sparse dynamic
programming I: Linear cost functions. Journal of the
ACM, 39(3):519-545, July 1992.
References
and Citations.
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano.
Sparse dynamic
programming II: Convex and concave cost functions. Journal of
the ACM, 39(3):546-567, July 1992.
References
and Citations.
- Amir M. Ben-Amram and Zvi Galil. On pointers versus
addresses. Journal of the ACM, 39(3):617-648, July
1992.
References
and Citations.
- Moshe Dubiner, Zvi Galil, and Edith Magen. Faster tree pattern matching.
Journal of the ACM, 41(2):205-213, March 1994.
References
and Citations.
- Zvi Galil. A constant-time
optimal parallel string-matching algorithm. Journal of the
ACM, 42(4):908-918, July 1995.
Abstract,
References,
Citations,
etc.
- David Eppstein, Zvi Galil, and Amnon Nissenzweig. Sparsification -- a technique
for speeding up dynamic graph algorithms. Journal of the
ACM, 44(5):669-696, September 1997.
References,
etc.
Shortcuts: