Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation - Zvi Galil (SWAT, 1974)

On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems. - Zvi Galil (SIGACT News, 1974)

On the Validity and Complexity of Bounded Resolution - Zvi Galil (STOC, 1975)

On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition. - Zvi Galil (SIGACT News, 1975)

The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus. - Zvi Galil (1975)

Functional Schemas with Nested Predicates - Zvi Galil (Inf. Control., 1975)

Recognizing Certain Repetitions and Reversals Within Strings - Zvi Galil; Joel I. Seiferas (FOCS, 1976)

On Enumeration Procedures for Theorem Proving and for Integer Programming. - Zvi Galil (ICALP, 1976)

Real-Time Algorithms for String-Matching and Palindrome Recognition - Zvi Galil (STOC, 1976)

Hierarchies of Complete Problems. - Zvi Galil (Acta Informatica, 1976)

Monotone switching circuits and boolean matrix product. - Kurt Mehlhorn; Zvi Galil (Computing, 1976)

Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms. - Zvi Galil (Inf. Process. Lett., 1976)

A Note on Multiple-Entry Finite Automata. - Zvi Galil; Janos Simon (J. Comput. Syst. Sci., 1976)

Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages. - Zvi Galil (Math. Syst. Theory, 1977)

Real-Time Recognition of Substring Repetition and Reversal. - Joel I. Seiferas; Zvi Galil (Math. Syst. Theory, 1977)

On Resolution with Clauses of Bounded Size. - Zvi Galil (SIAM J. Comput., 1977)

On the Complexity of Regular Resolution and the Davis-Putnam Procedure. - Zvi Galil (Theor. Comput. Sci., 1977)

Cyclic Ordering is NP-Complete. - Zvi Galil; Nimrod Megiddo (Theor. Comput. Sci., 1977)

A New Algorithm for the Maximal Flow Problem - Zvi Galil (FOCS, 1978)

On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. - Zvi Galil (ICALP, 1978)

A Linear-Time On-Line Recognition Algorithm for "Palstar". - Zvi Galil; Joel I. Seiferas (J. ACM, 1978)

Palindrome Recognition in Real Time by a Multitape Turing Machine. - Zvi Galil (J. Comput. Syst. Sci., 1978)

Killing two birds with one stone. - Zvi Galil (SIGACT News, 1978)

Explicit Constructions of Linear Size Superconcentrators - Ofer Gabber; Zvi Galil (FOCS, 1979)

Network Flow and Generalized Path Compression - Zvi Galil; Amnon Naamad (STOC, 1979)

On Improving the Worse Case Running Time of the Boyer-Moore String Matching Algorithm. - Zvi Galil (Commun. ACM, 1979)

A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. - Zvi Galil; Nimrod Megiddo (J. ACM, 1979)

On Fulkerson's Conjecture About Consistent Labeling Processes. - Nimrod Megiddo; Zvi Galil (Math. Oper. Res., 1979)

Storage Representations for Tree-Like Data Structures. - Arnold L. Rosenberg; Derick Wood; Zvi Galil (Math. Syst. Theory, 1979)

Effizienz Paralleler Rechner. - Zvi Galil; Wolfgang J. Paul (GI Jahrestagung, 1980)

An Almost Linaer Time Algorithm for Computing a Dependency Basis in a Relational Data Base. - Zvi Galil (ICALP, 1980)

Applications of Efficient Mergeable Heaps for Optimization Problems on Trees. - Zvi Galil (Acta Informatica, 1980)

An O(V5/3 E2/3) Algorithm for the Maximal Flow Problem. - Zvi Galil (Acta Informatica, 1980)

An O(EVlog²V) Algorithm for the Maximal Flow Problem. - Zvi Galil; Amnon Naamad (J. Comput. Syst. Sci., 1980)

Finding the Vertex Connectivity of Graphs. - Zvi Galil (SIAM J. Comput., 1980)

Saving Space in Fast String-Matching. - Zvi Galil; Joel I. Seiferas (SIAM J. Comput., 1980)

Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) - Pavol Duris; Zvi Galil (STOC, 1981)

String Matching in Real Time. - Zvi Galil (J. ACM, 1981)

Explicit Constructions of Linear-Sized Superconcentrators. - Ofer Gabber; Zvi Galil (J. Comput. Syst. Sci., 1981)

On the Theoretical Efficiency of Various Network Flow Algorithms. - Zvi Galil (Theor. Comput. Sci., 1981)

Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. - Zvi Galil; Joel I. Seiferas (Theor. Comput. Sci., 1981)

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 006 (FOCS, 1982)

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 (FOCS, 1982)

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. - Pavol Duris; Zvi Galil (ICALP, 1982)

Efficient Parallel Algorithms for Linear Recurrence Computation. - Albert G. Greenberg; Richard E. Ladner; Mike Paterson; Zvi Galil (Inf. Process. Lett., 1982)

An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database. - Zvi Galil (J. ACM, 1982)

Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. - Pavol Duris; Zvi Galil (Theor. Comput. Sci., 1982)

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store - Pavol Duris; Zvi Galil (Inf. Control., 1982)

Efficient Algorithms for Finding Maximal Matching in Graphs. - Zvi Galil (CAAP, 1983)

Two Nonlinear Lower Bounds - Pavol Duris; Zvi Galil; Wolfgang J. Paul; Rüdiger Reischuk (STOC, 1983)

NP Completeness of Finding the Chromatic Index of Regular Graphs. - Daniel Leven; Zvi Galil (J. Algorithms, 1983)

Time-Space-Optimal String Matching. - Zvi Galil; Joel I. Seiferas (J. Comput. Syst. Sci., 1983)

An Efficient General-Purpose Parallel Computer - Zvi Galil; Wolfgang J. Paul (J. ACM, 1983)

Two Nonlinear Lower Bounds for On-Line Computations - Pavol Duris; Zvi Galil; Wolfgang J. Paul; Rüdiger Reischuk (Inf. Control., 1984)

A Time-Space Tradeoff for Language Recognition. - Pavol Duris; Zvi Galil (Math. Syst. Theory, 1984)

Two Tapes are Better than One for Nondeterministic Machines. - Pavol Duris; Zvi Galil (SIAM J. Comput., 1984)

Symmetric Public-Key Encryption. - Zvi Galil; Stuart Haber; Moti Yung (CRYPTO, 1985)

A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract) - Zvi Galil; Stuart Haber; Moti Yung (FOCS, 1985)

Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC - Zvi Galil; Victor Y. Pan (FOCS, 1985)

Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). - Gad M. Landau; Mordechai M. Yung; Zvi Galil (ICALP, 1985)

Optimal Parallel Algorithms for String Matching - Zvi Galil (Inf. Control., 1985)

An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm - Zvi Galil; Éva Tardos (FOCS, 1986)

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 (ICALP, 1986)

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. - Harold N. Gabow; Zvi Galil; Thomas H. Spencer; Robert Endre Tarjan (Comb., 1986)

Efficient Algorithms for Finding Maximum Matching in Graphs. - Zvi Galil (ACM Comput. Surv., 1986)

An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. - Zvi Galil; Silvio Micali; Harold N. Gabow (SIAM J. Comput., 1986)

Improved string matching with k mismatches. - Zvi Galil; Raffaele Giancarlo (SIGACT News, 1986)

Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. - Zvi Galil; Stuart Haber; Moti Yung (CRYPTO, 1987)

Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) - Pavol Duris; Zvi Galil (FOCS, 1987)

Partitioned Encryption and Achieving Simultaneity by Partitioning. - Zvi Galil; Moti Yung (Inf. Process. Lett., 1987)

An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. - Zvi Galil; Christoph M. Hoffmann; Eugene M. Luks; Claus-Peter Schnorr; Andreas Weber 006 (J. ACM, 1987)

Better Expanders and Superconcentrators. - Noga Alon; Zvi Galil; V. D. Milman (J. Algorithms, 1987)

Parallel String Matching with k Mismatches. - Zvi Galil; Raffaele Giancarlo (Theor. Comput. Sci., 1987)

Distributed Algorithms in Synchronous Broadcasting Networks. - Zvi Galil; Gad M. Landau; Mordechai M. Yung (Theor. Comput. Sci., 1987)

Lower Bounds on Communication Complexity - Pavol Duris; Zvi Galil; Georg Schnitger (Inf. Comput., 1987)

On Pointers versus Addresses (Extended Abstract) - Amir M. Ben-Amram; Zvi Galil (FOCS, 1988)

Speeding up Dynamic Programming - David Eppstein; Zvi Galil; Raffaele Giancarlo (FOCS, 1988)

Improved processor bounds for combinatorial problems in RNC. - Zvi Galil; Victor Y. Pan (Comb., 1988)

On finding most uniform spanning trees. - Zvi Galil; Baruch Schieber (Discret. Appl. Math., 1988)

An O(n²(m + n log n)log n) min-cost flow algorithm. - Zvi Galil; Éva Tardos (J. ACM, 1988)

Data structures and algorithms for approximate string matching. - Zvi Galil; Raffaele Giancarlo (J. Complex., 1988)

Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / < Q(u)^l >, l > 1. - Amir Averbuch; Zvi Galil; Shmuel Winograd (Theor. Comput. Sci., 1988)

Security against Replay Chosen-Ciphertext Attack. - Zvi Galil; Stuart Haber; Moti Yung (Distributed Computing And Cryptography, 1989)

A Secure Public-key Authentication Scheme. - Zvi Galil; Stuart Haber; Moti Yung (EUROCRYPT, 1989)

Parallel Algorithmic Techniques for Combinatorial Computation. - David Eppstein; Zvi Galil (ICALP, 1989)

Speech Recognition in Parallel. - Salvatore J. Stolfo; Zvi Galil; Kathleen R. McKeown; Russell Mills (HLT (2), 1989)

Highly Parallelizable Problems (Extended Abstract) - Omer Berkman; Dany Breslauer; Zvi Galil; Baruch Schieber; Uzi Vishkin (STOC, 1989)

On 3-pushdown graphs with large separators. - Zvi Galil; Ravi Kannan; Endre Szemerédi (Comb., 1989)

Parallel Evaluation of the Determinant and of the Inverse of a Matrix. - Zvi Galil; Victor Y. Pan (Inf. Process. Lett., 1989)

Efficient implementation of graph algorithms using contraction. - Harold N. Gabow; Zvi Galil; Thomas H. Spencer (J. ACM, 1989)

Solving dense subset-sum problems by using analytical number theory. - Mark Chaimovich; Gregory Freiman; Zvi Galil (J. Complex., 1989)

On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. - Zvi Galil; Ravi Kannan; Endre Szemerédi (J. Comput. Syst. Sci., 1989)

Minimum-Knowledge Interactive Proofs for Decision Problems. - Zvi Galil; Stuart Haber; Moti Yung (SIAM J. Comput., 1989)

Speeding up Dynamic Programming with Applications to Molecular Biology. - Zvi Galil; Raffaele Giancarlo (Theor. Comput. Sci., 1989)

On the Exact Complexity of String Matching (Extended Abstract) - Livio Colussi; Zvi Galil; Raffaele Giancarlo (FOCS, 1990)

Recent Progress in String Algorithms. - Zvi Galil (SIGAL International Symposium on Algorithms, 1990)

Sparse Dynamic Programming. - David Eppstein; Zvi Galil; Raffaele Giancarlo; Giuseppe F. Italiano (SODA, 1990)

A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. - Zvi Galil; Kunsoo Park (Inf. Process. Lett., 1990)

An Optimal O(log log n) Time Parallel String Matching Algorithm. - Dany Breslauer; Zvi Galil (SIAM J. Comput., 1990)

An Improved Algorithm for Approximate String Matching. - Zvi Galil; Kunsoo Park (SIAM J. Comput., 1990)

Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) - Amir M. Ben-Amram; Zvi Galil (FOCS, 1991)

Maintaining Biconnected Components of Dynamic Planar Graphs. - Zvi Galil; Giuseppe F. Italiano (ICALP, 1991)

Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) - Zvi Galil; Giuseppe F. Italiano (STOC, 1991)

Data Structures and Algorithms for Disjoint Set Union Problems. - Zvi Galil; Giuseppe F. Italiano (ACM Comput. Surv., 1991)

A Note on Set Union with Arbitrary Deunions. - Zvi Galil; Giuseppe F. Italiano (Inf. Process. Lett., 1991)

Two Lower Bounds in Asynchronous Distributed Computation. - Pavol Duris; Zvi Galil (J. Comput. Syst. Sci., 1991)

On the Exact Complexity of String Matching: Lower Bounds. - Zvi Galil; Raffaele Giancarlo (SIAM J. Comput., 1991)

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. - Zvi Galil; Oded Margalit (SIAM J. Comput., 1991)

Reducing edge connectivity to vertex connectivity. - Zvi Galil; Giuseppe F. Italiano (SIGACT News, 1991)

Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>. - Amir Averbuch; Zvi Galil; Shmuel Winograd (Theor. Comput. Sci., 1991)

Witnesses for Boolean Matrix Multiplication and for Shortest Paths - Noga Alon; Zvi Galil; Oded Margalit; Moni Naor (FOCS, 1992)

Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) - David Eppstein; Zvi Galil; Giuseppe F. Italiano; Amnon Nissenzweig (FOCS, 1992)

Truly Alphabet-Independent Two-Dimensional Pattern Matching - Zvi Galil; Kunsoo Park (FOCS, 1992)

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). - Alberto Apostolico; Dany Breslauer; Zvi Galil (ICALP, 1992)

Fully Dynamic Planarity Testing (Extended Abstract) - Zvi Galil; Giuseppe F. Italiano; Neil Sarnak (STOC, 1992)

On Pointers versus Addresses. - Amir M. Ben-Amram; Zvi Galil (J. ACM, 1992)

Sparse Dynamic Programming I: Linear Cost Functions. - David Eppstein; Zvi Galil; Raffaele Giancarlo; Giuseppe F. Italiano (J. ACM, 1992)

Sparse Dynamic Programming II: Convex and Concave Cost Functions. - David Eppstein; Zvi Galil; Raffaele Giancarlo; Giuseppe F. Italiano (J. ACM, 1992)

A Lower Bound for Parallel String Matching. - Dany Breslauer; Zvi Galil (SIAM J. Comput., 1992)

On the Exact Complexity of String Matching: Upper Bounds. - Zvi Galil; Raffaele Giancarlo (SIAM J. Comput., 1992)

Fully Dynamic Algorithms for 2-Edge Connectivity. - Zvi Galil; Giuseppe F. Italiano (SIAM J. Comput., 1992)

Renato Capocelli. - Zvi Galil (SIGACT News, 1992)

Dynamic Programming with Convexity, Concavity, and Sparsity. - Zvi Galil; Kunsoo Park (Theor. Comput. Sci., 1992)

On the Space Complexity of Some Algorithms for Sequence Comparison. - Yuval Rabani; Zvi Galil (Theor. Comput. Sci., 1992)

When can we sort in o(n log n) time? - Amir M. Ben-Amram; Zvi Galil (FOCS, 1993)

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions - Richard Cole 001; Maxime Crochemore; Zvi Galil; Leszek Gasieniec; Ramesh Hariharan; S. Muthukrishnan 001; Kunsoo Park; Wojciech Rytter (FOCS, 1993)

Separator based sparsification for dynamic planar graph algorithms. - David Eppstein; Zvi Galil; Giuseppe F. Italiano; Thomas H. Spencer (STOC, 1993)

Efficient Comparison Based String Matching. - Dany Breslauer; Zvi Galil (J. Complex., 1993)

Witnesses for Boolean Matrix Multiplication and for Transitive Closure. - Zvi Galil; Oded Margalit (J. Complex., 1993)

Maintaining the 3-Edge-Connected Components of a Graph On-Line. - Zvi Galil; Giuseppe F. Italiano (SIAM J. Comput., 1993)

On the Power of Multiple Reads in a Chip - Pavol Duris; Zvi Galil (Inf. Comput., 1993)

Faster Tree Pattern Matching. - Moshe Dubiner; Zvi Galil; Edith Magen (J. ACM, 1994)

Dynamic Dictionary Matching. - Amihood Amir; Martin Farach; Zvi Galil; Raffaele Giancarlo; Kunsoo Park (J. Comput. Syst. Sci., 1994)

Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency. - Zvi Galil; Kunsoo Park (J. Parallel Distributed Comput., 1994)

Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. - Noga Alon; Zvi Galil; Moti Yung (ESA, 1995)

Resolving Message Complexity of Byzantine Agreement and beyond. - Zvi Galil; Alain J. Mayer; Moti Yung (FOCS, 1995)

Lower Bounds on Algebraic Random Access Machines (Extended Abstract). - Amir M. Ben-Amram; Zvi Galil (ICALP, 1995)

Sensing Versus Nonsensing Automata. - Pavol Duris; Zvi Galil (ICALP, 1995)

Work-time-optimal parallel algorithms for string problems. - Artur Czumaj; Zvi Galil; Leszek Gasieniec; Kunsoo Park; Wojciech Plandowski (STOC, 1995)

Short length versions of Menger's theorem (Extended Abstract). - Zvi Galil; Xiangdong Yu (STOC, 1995)

Finding All Periods and Initial Palindromes of a String in Parallel. - Dany Breslauer; Zvi Galil (Algorithmica, 1995)

On Data Structure Tradeoffs and an Application to Union-Find - Amir M. Ben-Amram; Zvi Galil (Electron. Colloquium Comput. Complex., 1995)

A Constant-Time Optimal Parallel String-Matching Algorithm. - Zvi Galil (J. ACM, 1995)

Parallel Detection of all Palindromes in a String. - Alberto Apostolico; Dany Breslauer; Zvi Galil (Theor. Comput. Sci., 1995)

On the Power of the Shift Instruction - Amir M. Ben-Amram; Zvi Galil (Inf. Comput., 1995)

Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. - David Eppstein; Zvi Galil; Giuseppe F. Italiano; Thomas H. Spencer (J. Comput. Syst. Sci., 1996)

Alphabet-Independent Two-Dimensional Witness Computation. - Zvi Galil; Kunsoo Park (SIAM J. Comput., 1996)

Off-line parallel exact string searching. - Zvi Galil; I. Yudkiewicz (Pattern Matching Algorithms, 1997)

Open Problems In Stringology, Thirteen years Later. - Zvi Galil (SEQUENCES, 1997)

Three-Dimensional Pattern Matching. - Zvi Galil; Jong Geun Park; Kunsoo Park (SPAA, 1997)

All Pairs Shortest Distances for Graphs with Small Integer Length Edges. - Zvi Galil; Oded Margalit (Inf. Comput., 1997)

Sparsification - a technique for speeding up dynamic graph algorithms. - David Eppstein; Zvi Galil; Giuseppe F. Italiano; Amnon Nissenzweig (J. ACM, 1997)

On the Exponent of the All Pairs Shortest Path Problem. - Noga Alon; Zvi Galil; Oded Margalit (J. Comput. Syst. Sci., 1997)

All Pairs Shortest Paths for Graphs with Small Integer Length Edges. - Zvi Galil; Oded Margalit (J. Comput. Syst. Sci., 1997)

Constant-Time Randomized Parallel String Matching. - Maxime Crochemore; Zvi Galil; Leszek Gasieniec; Kunsoo Park; Wojciech Rytter (SIAM J. Comput., 1997)

Separator-Based Sparsification II: Edge and Vertex Connectivity. - David Eppstein; Zvi Galil; Giuseppe F. Italiano; Thomas H. Spencer (SIAM J. Comput., 1998)

Dynamic Graph Algorithms. - David Eppstein; Zvi Galil; Giuseppe F. Italiano (Algorithms and Theory of Computation Handbook, 1999)

Fully Dynamic Planarity Testing with Applications. - Zvi Galil; Giuseppe F. Italiano; Neil Sarnak (J. ACM, 1999)

Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. - Matthew K. Franklin; Zvi Galil; Moti Yung (J. ACM, 2000)

A Generalization of a Lower Bound Technique due to Fredman and Saks. - Amir M. Ben-Amram; Zvi Galil (Algorithmica, 2001)

Topological Lower Bounds on Algebraic Random Access Machines. - Amir M. Ben-Amram; Zvi Galil (SIAM J. Comput., 2001)

Lower Bounds for Dynamic Data Structures on Algebraic RAMs. - Amir M. Ben-Amram; Zvi Galil (Algorithmica, 2002)

Parallel two dimensional witness computation. - Richard Cole 001; Zvi Galil; Ramesh Hariharan; S. Muthukrishnan 001; Kunsoo Park (Inf. Comput., 2004)

Three-Dimensional Periodicity and Its Application to Pattern Matching. - Zvi Galil; Jong Geun Park; Kunsoo Park (SIAM J. Discret. Math., 2004)

Old and New in Stringology. - Zvi Galil (CPM, 2010)

Forty Years of Text Indexing. - Alberto Apostolico; Maxime Crochemore; Martin Farach-Colton; Zvi Galil; S. Muthukrishnan 001 (CPM, 2013)

Real-Time Streaming String-Matching. - Dany Breslauer; Zvi Galil (ACM Trans. Algorithms, 2014)

40 years of suffix trees. - Alberto Apostolico; Maxime Crochemore; Martin Farach-Colton; Zvi Galil; S. Muthukrishnan 001 (Commun. ACM, 2016)

OMSCS: the revolution will be digitized. - Zvi Galil (Commun. ACM, 2020)

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 (ICDE, 2021)

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 (ICDE, 2022)

Creating a revolutionary academic program. - Umakishore Ramachandran; Zvi Galil (Commun. ACM, 2022)