Zvi
Galil

General Information

Email:
galil@cc.gatech.edu
Phone:
4047752884
Location - Building:
KACB
Location - Room:
2146
Roles:
Professor (any rank)
Primary Unit:
School of Computer Science

Details

Degrees with subject and Postdoc Experience:
Degree Type
Ph.D.
Subject
Compouer Science
Year
1975
Institution
Cornell University
Location
Ithaca, NY
Statement of Research Interests:

General area of research is theoretical computer science. 

Subareas: 1. Design and Analysis of Algorithms. 2. Algorithms on Strings.  3. Graph algorithms. 4. Complexity theory.

I also do research in the design of exxperiments.

Statement of Teaching Interests:

I teach courses in Theoretical Computer Science: 1. in the design and analysis of algorithms. In complexity. 3. In automata, 4. In formal languages.

Selection of recent research, scholarly, and creative activities:

Z. Galil, Real time algorithms for string matching and Palindrome recognition. Proc. 8th ACM Symposium on Theory of Computing, pp. 161-173, May 1976 @ foot (Paper invited to the special issue.)

D. Breslauer, Z. Galil, Real-time streaming string-matching, Proc.Combinatorial Patter Matching, July 2011, pp. 162-172.

D. Eppstein, Z. Galil, G.F. Italiano and A. Nissenzweig, Sparsification – A technique for speeding up dynamic graph algorithms. Proc. 33rd IEEE Symposium on Foundations of Computer Science, October 1992, pp. 60-69.

A.M. Ben-Amram and Z. Galil, Lower Bounds for Data Structure Problems on RAMs. Proc. 32th IEEE Symposium on Foundations of Computer Science, October 1991, pp. 622-631.

Z. Galil & J. Kiefer, D-Optimum weighing designs, Annals of Statistics 8, pp. 1293-1306, 1980.