| 2022 | ICDE | Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. | Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han |
| 2021 | ICDE | Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. | Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han |
| 2013 | CPM | Forty Years of Text Indexing. | Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan |
| 2011 | CPM | Real-Time Streaming String-Matching. | Dany Breslauer, Zvi Galil |
| 2010 | CPM | Old and New in Stringology. | Zvi Galil |
| 1997 | SPAA | Three-Dimensional Pattern Matching. | Zvi Galil, Jong Geun Park, Kunsoo Park |
| 1995 | ESA | Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. | Noga Alon, Zvi Galil, Moti Yung |
| 1995 | FOCS | Resolving Message Complexity of Byzantine Agreement and beyond. | Zvi Galil, Alain J. Mayer, Moti Yung |
| 1995 | ICALP | Lower Bounds on Algebraic Random Access Machines (Extended Abstract). | Amir M. Ben-Amram, Zvi Galil |
| 1995 | ICALP | Sensing Versus Nonsensing Automata. | Pavol Duris, Zvi Galil |
| 1995 | STOC | Work-time-optimal parallel algorithms for string problems. | Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski |
| 1995 | STOC | Short length versions of Menger's theorem (Extended Abstract). | Zvi Galil, Xiangdong Yu |
| 1994 | STACS | Parallel Detection of all Palindromes in a String. | Alberto Apostolico, Dany Breslauer, Zvi Galil |
| 1993 | FOCS | When can we sort in o(n log n) time? | Amir M. Ben-Amram, Zvi Galil |
| 1993 | FOCS | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter |
| 1993 | FOCS | Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems | Matthew K. Franklin, Zvi Galil, Moti Yung |
| 1993 | STOC | Separator based sparsification for dynamic planar graph algorithms. | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer |
| 1992 | FOCS | Witnesses for Boolean Matrix Multiplication and for Shortest Paths | Noga Alon, Zvi Galil, Oded Margalit, Moni Naor |
| 1992 | FOCS | Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig |
| 1992 | FOCS | Truly Alphabet-Independent Two-Dimensional Pattern Matching | Zvi Galil, Kunsoo Park |
| 1992 | ICALP | Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). | Alberto Apostolico, Dany Breslauer, Zvi Galil |
| 1992 | STOC | A Constant-Time Optimal Parallel String-Matching Algorithm | Zvi Galil |
| 1992 | STOC | Fully Dynamic Planarity Testing (Extended Abstract) | Zvi Galil, Giuseppe F. Italiano, Neil Sarnak |
| 1991 | FOCS | On the Exponent of the All Pairs Shortest Path Problem | Noga Alon, Zvi Galil, Oded Margalit |
| 1991 | FOCS | Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) | Amir M. Ben-Amram, Zvi Galil |
| 1991 | ICALP | On the Power of Multiple Reads in a Chip. | Pavol Duris, Zvi Galil |
| 1991 | ICALP | Maintaining Biconnected Components of Dynamic Planar Graphs. | Zvi Galil, Giuseppe F. Italiano |
| 1991 | ICALP | An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. | Zvi Galil, Oded Margalit |
| 1991 | STOC | A Lower Bound for Parallel String Matching | Dany Breslauer, Zvi Galil |
| 1991 | STOC | Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) | Zvi Galil, Giuseppe F. Italiano |
| 1990 | FOCS | On the Exact Complexity of String Matching (Extended Abstract) | Livio Colussi, Zvi Galil, Raffaele Giancarlo |
| 1990 | FOCS | Faster Tree Pattern Matching | Moshe Dubiner, Zvi Galil, Edith Magen |
| 1990 | SODA | Sparse Dynamic Programming. | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano |
| 1989 | EuroCrypt | A Secure Public-key Authentication Scheme. | Zvi Galil, Stuart Haber, Moti Yung |
| 1989 | ICALP | Parallel Algorithmic Techniques for Combinatorial Computation. | David Eppstein, Zvi Galil |
| 1989 | ICALP | An Improved Algorithm for Approximate String Matching. | Zvi Galil, Kunsoo Park |
| 1989 | NAACL | Speech Recognition in Parallel. | Salvatore J. Stolfo, Zvi Galil, Kathleen R. McKeown, Russell Mills |
| 1989 | STOC | Highly Parallelizable Problems (Extended Abstract) | Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin |
| 1988 | FOCS | On Pointers versus Addresses (Extended Abstract) | Amir M. Ben-Amram, Zvi Galil |
| 1988 | FOCS | Speeding up Dynamic Programming | David Eppstein, Zvi Galil, Raffaele Giancarlo |
| 1987 | CRYPTO | Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. | Zvi Galil, Stuart Haber, Moti Yung |
| 1987 | FOCS | Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) | Pavol Duris, Zvi Galil |
| 1986 | FOCS | An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm | Zvi Galil, va Tardos |
| 1986 | ICALP | Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. | Amir Averbuch, Shmuel Winograd, Zvi Galil |
| 1986 | STOC | On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines | Zvi Galil, Ravi Kannan, Endre Szemerdi |
| 1985 | CRYPTO | Symmetric Public-Key Encryption. | Zvi Galil, Stuart Haber, Moti Yung |
| 1985 | FOCS | A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract) | Zvi Galil, Stuart Haber, Moti Yung |
| 1985 | FOCS | Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC | Zvi Galil, Victor Y. Pan |
| 1985 | ICALP | Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). | Gad M. Landau, Mordechai M. Yung, Zvi Galil |
| 1984 | FOCS | Efficient Implementation of Graph Algorithms Using Contraction | Harold N. Gabow, Zvi Galil, Thomas H. Spencer |
| 1984 | STOC | Lower Bounds on Communication Complexity | Pavol Duris, Zvi Galil, Georg Schnitger |
| 1984 | STOC | Optimal Parallel Algorithms for String Matching | Zvi Galil |
| 1983 | STOC | Two Nonlinear Lower Bounds | Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rdiger Reischuk |
| 1982 | FOCS | An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs | Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber |
| 1982 | FOCS | Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs | Zvi Galil, Silvio Micali, Harold N. Gabow |
| 1982 | ICALP | On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. | Pavol Duris, Zvi Galil |
| 1982 | STOC | Two Tapes are Better than One for Nondeterministic Machines | Pavol Duris, Zvi Galil |
| 1981 | FOCS | A Time-Space Tradeoff for Language Recognition | Pavol Duris, Zvi Galil |
| 1981 | STOC | Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) | Pavol Duris, Zvi Galil |
| 1981 | STOC | An Efficient General Purpose Parallel Computer | Zvi Galil, Wolfgang J. Paul |
| 1981 | STOC | Time-Space-Optimal String Matching | Zvi Galil, Joel I. Seiferas |
| 1980 | GI | Effizienz Paralleler Rechner. | Zvi Galil, Wolfgang J. Paul |
| 1980 | ICALP | An Almost Linaer Time Algorithm for Computing a Dependency Basis in a Relational Data Base. | Zvi Galil |
| 1979 | FOCS | Explicit Constructions of Linear Size Superconcentrators | Ofer Gabber, Zvi Galil |
| 1979 | STOC | Network Flow and Generalized Path Compression | Zvi Galil, Amnon Naamad |
| 1979 | STOC | Storage Representations for Tree-Like Data Structures | Arnold L. Rosenberg, Derick Wood, Zvi Galil |
| 1978 | FOCS | A New Algorithm for the Maximal Flow Problem | Zvi Galil |
| 1978 | ICALP | On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. | Zvi Galil |
| 1977 | FOCS | Saving Space in Fast String-Matching | Zvi Galil, Joel I. Seiferas |
| 1976 | FOCS | Recognizing Certain Repetitions and Reversals Within Strings | Zvi Galil, Joel I. Seiferas |
| 1976 | ICALP | On Enumeration Procedures for Theorem Proving and for Integer Programming. | Zvi Galil |
| 1976 | STOC | Real-Time Algorithms for String-Matching and Palindrome Recognition | Zvi Galil |
| 1975 | MFCS | Monotone Switching Circuits and Boolean Matrix Product. | Kurt Mehlhorn, Zvi Galil |
| 1975 | STOC | On the Validity and Complexity of Bounded Resolution | Zvi Galil |
| 1974 | FOCS | Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation | Zvi Galil |