Zvi Galil

Publication Activity (10 Years)

Years Active: 1974-2022
Publications (10 Years): 5

Top Venues

Commun. ACM

ICDE

CPM

ACM Trans. Algorithms

Publications

Umakishore Ramachandran, Zvi Galil
Creating a revolutionary academic program. Commun. ACM 65 (10) (2022)
Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. ICDE (2022)
Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. ICDE (2021)
Zvi Galil
OMSCS: the revolution will be digitized. Commun. ACM 63 (8) (2020)
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
40 years of suffix trees. Commun. ACM 59 (4) (2016)
Dany Breslauer, Zvi Galil
Real-Time Streaming String-Matching. ACM Trans. Algorithms 10 (4) (2014)
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
Forty Years of Text Indexing. CPM (2013)
Dany Breslauer, Zvi Galil
Real-Time Streaming String-Matching. CPM (2011)
Zvi Galil
Old and New in Stringology. CPM (2010)
Zvi Galil, Jong Geun Park, Kunsoo Park
Three-Dimensional Periodicity and Its Application to Pattern Matching. SIAM J. Discret. Math. 18 (2) (2004)
Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
Parallel two dimensional witness computation. Inf. Comput. 188 (1) (2004)
Amir M. Ben-Amram, Zvi Galil
Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Algorithmica 32 (3) (2002)
Amir M. Ben-Amram, Zvi Galil
A Generalization of a Lower Bound Technique due to Fredman and Saks. Algorithmica 30 (1) (2001)
Amir M. Ben-Amram, Zvi Galil
Topological Lower Bounds on Algebraic Random Access Machines. SIAM J. Comput. 31 (3) (2001)
Matthew K. Franklin, Zvi Galil, Moti Yung
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J. ACM 47 (2) (2000)
Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
Fully Dynamic Planarity Testing with Applications. J. ACM 46 (1) (1999)
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. 28 (1) (1998)
Noga Alon, Zvi Galil, Oded Margalit
On the Exponent of the All Pairs Shortest Path Problem. J. Comput. Syst. Sci. 54 (2) (1997)
Zvi Galil, Jong Geun Park, Kunsoo Park
Three-Dimensional Pattern Matching. SPAA (1997)
Zvi Galil
Open Problems In Stringology, Thirteen years Later. SEQUENCES (1997)
Zvi Galil, Oded Margalit
All Pairs Shortest Paths for Graphs with Small Integer Length Edges. J. Comput. Syst. Sci. 54 (2) (1997)
Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
Constant-Time Randomized Parallel String Matching. SIAM J. Comput. 26 (4) (1997)
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44 (5) (1997)
Zvi Galil, Oded Margalit
All Pairs Shortest Distances for Graphs with Small Integer Length Edges. Inf. Comput. 134 (2) (1997)
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. 52 (1) (1996)
Zvi Galil, Kunsoo Park
Alphabet-Independent Two-Dimensional Witness Computation. SIAM J. Comput. 25 (5) (1996)
Zvi Galil, Alain J. Mayer, Moti Yung
Resolving Message Complexity of Byzantine Agreement and beyond. FOCS (1995)
Noga Alon, Zvi Galil, Moti Yung
Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ESA (1995)
Zvi Galil
A Constant-Time Optimal Parallel String-Matching Algorithm. J. ACM 42 (4) (1995)
Pavol Duris, Zvi Galil
Sensing Versus Nonsensing Automata. ICALP (1995)
Dany Breslauer, Zvi Galil
Finding All Periods and Initial Palindromes of a String in Parallel. Algorithmica 14 (4) (1995)
Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
Work-time-optimal parallel algorithms for string problems. STOC (1995)
Alberto Apostolico, Dany Breslauer, Zvi Galil
Parallel Detection of all Palindromes in a String. Theor. Comput. Sci. 141 (1&2) (1995)
Amir M. Ben-Amram, Zvi Galil
On Data Structure Tradeoffs and an Application to Union-Find Electron. Colloquium Comput. Complex. 2 (62) (1995)
Amir M. Ben-Amram, Zvi Galil
Lower Bounds on Algebraic Random Access Machines (Extended Abstract). ICALP (1995)
Amir M. Ben-Amram, Zvi Galil
On the Power of the Shift Instruction Inf. Comput. 117 (1) (1995)
Zvi Galil, Xiangdong Yu
Short length versions of Menger's theorem (Extended Abstract). STOC (1995)
Alberto Apostolico, Dany Breslauer, Zvi Galil
Parallel Detection of all Palindromes in a String. STACS (1994)
Zvi Galil, Kunsoo Park
Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency. J. Parallel Distributed Comput. 21 (2) (1994)
Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park
Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49 (2) (1994)
Moshe Dubiner, Zvi Galil, Edith Magen
Faster Tree Pattern Matching. J. ACM 41 (2) (1994)
Matthew K. Franklin, Zvi Galil, Moti Yung
Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems FOCS (1993)
Amir M. Ben-Amram, Zvi Galil
When can we sort in o(n log n) time? FOCS (1993)
Zvi Galil, Giuseppe F. Italiano
Maintaining the 3-Edge-Connected Components of a Graph On-Line. SIAM J. Comput. 22 (1) (1993)
Pavol Duris, Zvi Galil
On the Power of Multiple Reads in a Chip Inf. Comput. 104 (2) (1993)
Zvi Galil, Oded Margalit
Witnesses for Boolean Matrix Multiplication and for Transitive Closure. J. Complex. 9 (2) (1993)
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
Separator based sparsification for dynamic planar graph algorithms. STOC (1993)
Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS (1993)
Dany Breslauer, Zvi Galil
Efficient Comparison Based String Matching. J. Complex. 9 (3) (1993)
Zvi Galil
A Constant-Time Optimal Parallel String-Matching Algorithm STOC (1992)
Zvi Galil, Raffaele Giancarlo
On the Exact Complexity of String Matching: Upper Bounds. SIAM J. Comput. 21 (3) (1992)
Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
Witnesses for Boolean Matrix Multiplication and for Shortest Paths FOCS (1992)
Zvi Galil
Renato Capocelli. SIGACT News 23 (2) (1992)
Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
Fully Dynamic Planarity Testing (Extended Abstract) STOC (1992)
Amir M. Ben-Amram, Zvi Galil
On Pointers versus Addresses. J. ACM 39 (3) (1992)
David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39 (3) (1992)
Zvi Galil, Kunsoo Park
Dynamic Programming with Convexity, Concavity, and Sparsity. Theor. Comput. Sci. 92 (1) (1992)
Yuval Rabani, Zvi Galil
On the Space Complexity of Some Algorithms for Sequence Comparison. Theor. Comput. Sci. 95 (2) (1992)
Dany Breslauer, Zvi Galil
A Lower Bound for Parallel String Matching. SIAM J. Comput. 21 (5) (1992)
Zvi Galil, Giuseppe F. Italiano
Fully Dynamic Algorithms for 2-Edge Connectivity. SIAM J. Comput. 21 (6) (1992)
Zvi Galil, Kunsoo Park
Truly Alphabet-Independent Two-Dimensional Pattern Matching FOCS (1992)
Alberto Apostolico, Dany Breslauer, Zvi Galil
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). ICALP (1992)
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) FOCS (1992)
David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39 (3) (1992)
Zvi Galil, Giuseppe F. Italiano
A Note on Set Union with Arbitrary Deunions. Inf. Process. Lett. 37 (6) (1991)
Zvi Galil, Giuseppe F. Italiano
Maintaining Biconnected Components of Dynamic Planar Graphs. ICALP (1991)
Zvi Galil, Oded Margalit
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. ICALP (1991)
Noga Alon, Zvi Galil, Oded Margalit
On the Exponent of the All Pairs Shortest Path Problem FOCS (1991)
Amir M. Ben-Amram, Zvi Galil
Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) FOCS (1991)
Amir Averbuch, Zvi Galil, Shmuel Winograd
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]/. Theor. Comput. Sci. 86 (2) (1991)
Pavol Duris, Zvi Galil
Two Lower Bounds in Asynchronous Distributed Computation. J. Comput. Syst. Sci. 42 (3) (1991)
Pavol Duris, Zvi Galil
On the Power of Multiple Reads in a Chip. ICALP (1991)
Zvi Galil, Giuseppe F. Italiano
Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) STOC (1991)
Zvi Galil, Raffaele Giancarlo
On the Exact Complexity of String Matching: Lower Bounds. SIAM J. Comput. 20 (6) (1991)
Zvi Galil, Giuseppe F. Italiano
Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comput. Surv. 23 (3) (1991)
Zvi Galil, Giuseppe F. Italiano
Reducing edge connectivity to vertex connectivity. SIGACT News 22 (1) (1991)
Dany Breslauer, Zvi Galil
A Lower Bound for Parallel String Matching STOC (1991)
Zvi Galil, Oded Margalit
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. SIAM J. Comput. 20 (6) (1991)
Zvi Galil
Recent Progress in String Algorithms. SIGAL International Symposium on Algorithms (1990)
Moshe Dubiner, Zvi Galil, Edith Magen
Faster Tree Pattern Matching FOCS (1990)
Zvi Galil, Kunsoo Park
An Improved Algorithm for Approximate String Matching. SIAM J. Comput. 19 (6) (1990)
Livio Colussi, Zvi Galil, Raffaele Giancarlo
On the Exact Complexity of String Matching (Extended Abstract) FOCS (1990)
David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming. SODA (1990)
Dany Breslauer, Zvi Galil
An Optimal O(log log n) Time Parallel String Matching Algorithm. SIAM J. Comput. 19 (6) (1990)
Zvi Galil, Kunsoo Park
A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. Inf. Process. Lett. 33 (6) (1990)
Zvi Galil, Victor Y. Pan
Parallel Evaluation of the Determinant and of the Inverse of a Matrix. Inf. Process. Lett. 30 (1) (1989)
David Eppstein, Zvi Galil
Parallel Algorithmic Techniques for Combinatorial Computation. ICALP (1989)
Zvi Galil, Stuart Haber, Moti Yung
A Secure Public-key Authentication Scheme. EUROCRYPT (1989)
Zvi Galil, Ravi Kannan, Endre Szemerédi
On 3-pushdown graphs with large separators. Comb. 9 (1) (1989)
Zvi Galil, Stuart Haber, Moti Yung
Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM J. Comput. 18 (4) (1989)
Zvi Galil, Stuart Haber, Moti Yung
Security against Replay Chosen-Ciphertext Attack. Distributed Computing And Cryptography (1989)
Salvatore J. Stolfo, Zvi Galil, Kathleen R. McKeown, Russell Mills
Speech Recognition in Parallel. HLT (2) (1989)
Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
Highly Parallelizable Problems (Extended Abstract) STOC (1989)
Zvi Galil, Raffaele Giancarlo
Speeding up Dynamic Programming with Applications to Molecular Biology. Theor. Comput. Sci. 64 (1) (1989)
Harold N. Gabow, Zvi Galil, Thomas H. Spencer
Efficient implementation of graph algorithms using contraction. J. ACM 36 (3) (1989)
Zvi Galil, Kunsoo Park
An Improved Algorithm for Approximate String Matching. ICALP (1989)
Zvi Galil, Ravi Kannan, Endre Szemerédi
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. J. Comput. Syst. Sci. 38 (1) (1989)
Mark Chaimovich, Gregory Freiman, Zvi Galil
Solving dense subset-sum problems by using analytical number theory. J. Complex. 5 (3) (1989)
Amir Averbuch, Zvi Galil, Shmuel Winograd
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] / , l > 1. Theor. Comput. Sci. 58 (1988)
Zvi Galil, Victor Y. Pan
Improved processor bounds for combinatorial problems in RNC. Comb. 8 (2) (1988)

Zvi Galil.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Zvi Galil