Zvi Galil
Georgia Institute of Technology · 278 works · 10,405 citations · h-index 54
Top works
- Proceedings of the 30th IEEE symposium on Foundations of computer science
- A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
- Explicit constructions of linear size superconcentrators
- Explicit constructions of linear-sized superconcentrators
- Time-space-optimal string matching
- Data structures and algorithms for approximate string matching
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Combinatorial Algorithms on Words
- An Improved Algorithm For Approximate String Matching
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
- On the complexity of regular resolution and the Davis-Putnam procedure
- Efficient algorithms for finding maximum matching in graphs
- Symmetric Public-Key Encryption
- On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition
- Sparse dynamic programming I
- Saving Space in Fast String-Matching
- String Matching in Real Time
- Open Problems in Stringology
- Two way deterministic pushdown automaton languages and some open problems in the theory of computation