Zvi Galil - RankMe

199 papers A* 66A 2B 8Journal 111Unranked 7

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Creating a revolutionary academic program. Commun. ACM Umakishore Ramachandran, Zvi Galil
2022	A*	`conf`	Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions. ICDE Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
2021	A*	`conf`	Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space. ICDE Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han
2020	J	`jnl`	OMSCS: the revolution will be digitized. Commun. ACM Zvi Galil
2016	J	`jnl`	40 years of suffix trees. Commun. ACM Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
2014	J	`jnl`	Real-Time Streaming String-Matching. ACM Trans. Algorithms Dany Breslauer, Zvi Galil
2013	B	`conf`	Forty Years of Text Indexing. CPM Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
2011	B	`conf`	Real-Time Streaming String-Matching. CPM Dany Breslauer, Zvi Galil
2010	B	`conf`	Old and New in Stringology. CPM Zvi Galil
2004	J	`jnl`	Parallel two dimensional witness computation. Inf. Comput. Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
2004	J	`jnl`	Three-Dimensional Periodicity and Its Application to Pattern Matching. SIAM J. Discret. Math. Zvi Galil, Jong Geun Park, Kunsoo Park
2002	J	`jnl`	Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Algorithmica Amir M. Ben-Amram, Zvi Galil
2001	J	`jnl`	A Generalization of a Lower Bound Technique due to Fredman and Saks. Algorithmica Amir M. Ben-Amram, Zvi Galil
2001	J	`jnl`	Topological Lower Bounds on Algebraic Random Access Machines. SIAM J. Comput. Amir M. Ben-Amram, Zvi Galil
2000	J	`jnl`	Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J. ACM Matthew K. Franklin, Zvi Galil, Moti Yung
1999	—	`ch.`	Dynamic Graph Algorithms. Algorithms and Theory of Computation Handbook David Eppstein, Zvi Galil, Giuseppe F. Italiano
1999	J	`jnl`	Fully Dynamic Planarity Testing with Applications. J. ACM Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
1998	J	`jnl`	Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1997	J	`jnl`	All Pairs Shortest Distances for Graphs with Small Integer Length Edges. Inf. Comput. Zvi Galil, Oded Margalit
1997	J	`jnl`	All Pairs Shortest Paths for Graphs with Small Integer Length Edges. J. Comput. Syst. Sci. Zvi Galil, Oded Margalit
1997	J	`jnl`	Constant-Time Randomized Parallel String Matching. SIAM J. Comput. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
1997	—	`ch.`	Off-line parallel exact string searching. Pattern Matching Algorithms Zvi Galil, I. Yudkiewicz
1997	J	`jnl`	On the Exponent of the All Pairs Shortest Path Problem. J. Comput. Syst. Sci. Noga Alon, Zvi Galil, Oded Margalit
1997	—	`conf`	Open Problems In Stringology, Thirteen years Later. SEQUENCES Zvi Galil
1997	—	`book`	Pattern Matching Algorithms Alberto Apostolico, Zvi Galil
1997	J	`jnl`	Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
1997	B	`conf`	Three-Dimensional Pattern Matching. SPAA Zvi Galil, Jong Geun Park, Kunsoo Park
1996	J	`jnl`	Alphabet-Independent Two-Dimensional Witness Computation. SIAM J. Comput. Zvi Galil, Kunsoo Park
1996	J	`jnl`	Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1995	J	`jnl`	A Constant-Time Optimal Parallel String-Matching Algorithm. J. ACM Zvi Galil
1995	B	`ed.`	Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings CPM Zvi Galil, Esko Ukkonen
1995	A	`conf`	Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ESA Noga Alon, Zvi Galil, Moti Yung
1995	J	`jnl`	Finding All Periods and Initial Palindromes of a String in Parallel. Algorithmica Dany Breslauer, Zvi Galil
1995	A*	`conf`	Lower Bounds on Algebraic Random Access Machines (Extended Abstract). ICALP Amir M. Ben-Amram, Zvi Galil
1995	J	`jnl`	On Data Structure Tradeoffs and an Application to Union-Find Electron. Colloquium Comput. Complex. Amir M. Ben-Amram, Zvi Galil
1995	J	`jnl`	On the Power of the Shift Instruction Inf. Comput. Amir M. Ben-Amram, Zvi Galil
1995	J	`jnl`	Parallel Detection of all Palindromes in a String. Theor. Comput. Sci. Alberto Apostolico, Dany Breslauer, Zvi Galil
1995	A*	`conf`	Resolving Message Complexity of Byzantine Agreement and beyond. FOCS Zvi Galil, Alain J. Mayer, Moti Yung
1995	A*	`conf`	Sensing Versus Nonsensing Automata. ICALP Pavol Duris, Zvi Galil
1995	A*	`conf`	Short length versions of Menger's theorem (Extended Abstract). STOC Zvi Galil, Xiangdong Yu
1995	A*	`conf`	Work-time-optimal parallel algorithms for string problems. STOC Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
1994	J	`jnl`	Dynamic Dictionary Matching. J. Comput. Syst. Sci. Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park
1994	J	`jnl`	Faster Tree Pattern Matching. J. ACM Moshe Dubiner, Zvi Galil, Edith Magen
1994	J	`jnl`	Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency. J. Parallel Distributed Comput. Zvi Galil, Kunsoo Park
1994	A	`conf`	Parallel Detection of all Palindromes in a String. STACS Alberto Apostolico, Dany Breslauer, Zvi Galil
1993	B	`ed.`	Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1993	A*	`conf`	Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems FOCS Matthew K. Franklin, Zvi Galil, Moti Yung
1993	J	`jnl`	Efficient Comparison Based String Matching. J. Complex. Dany Breslauer, Zvi Galil
1993	J	`jnl`	Maintaining the 3-Edge-Connected Components of a Graph On-Line. SIAM J. Comput. Zvi Galil, Giuseppe F. Italiano
1993	J	`jnl`	On the Power of Multiple Reads in a Chip Inf. Comput. Pavol Duris, Zvi Galil
1993	A*	`conf`	Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
1993	A*	`conf`	Separator based sparsification for dynamic planar graph algorithms. STOC David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1993	A*	`conf`	When can we sort in o(n log n) time? FOCS Amir M. Ben-Amram, Zvi Galil
1993	J	`jnl`	Witnesses for Boolean Matrix Multiplication and for Transitive Closure. J. Complex. Zvi Galil, Oded Margalit
1992	A*	`conf`	A Constant-Time Optimal Parallel String-Matching Algorithm STOC Zvi Galil
1992	J	`jnl`	A Lower Bound for Parallel String Matching. SIAM J. Comput. Dany Breslauer, Zvi Galil
1992	B	`ed.`	Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1992	J	`jnl`	Dynamic Programming with Convexity, Concavity, and Sparsity. Theor. Comput. Sci. Zvi Galil, Kunsoo Park
1992	J	`jnl`	Fully Dynamic Algorithms for 2-Edge Connectivity. SIAM J. Comput. Zvi Galil, Giuseppe F. Italiano
1992	A*	`conf`	Fully Dynamic Planarity Testing (Extended Abstract) STOC Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
1992	J	`jnl`	On Pointers versus Addresses. J. ACM Amir M. Ben-Amram, Zvi Galil
1992	J	`jnl`	On the Exact Complexity of String Matching: Upper Bounds. SIAM J. Comput. Zvi Galil, Raffaele Giancarlo
1992	J	`jnl`	On the Space Complexity of Some Algorithms for Sequence Comparison. Theor. Comput. Sci. Yuval Rabani, Zvi Galil
1992	A*	`conf`	Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). ICALP Alberto Apostolico, Dany Breslauer, Zvi Galil
1992	J	`jnl`	Renato Capocelli. SIGACT News Zvi Galil
1992	J	`jnl`	Sparse Dynamic Programming I: Linear Cost Functions. J. ACM David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1992	J	`jnl`	Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1992	A*	`conf`	Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) FOCS David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
1992	—	`ed.`	Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa, Israel, May 1992 ISTCS Danny Dolev, Zvi Galil, Michael Rodeh
1992	A*	`conf`	Truly Alphabet-Independent Two-Dimensional Pattern Matching FOCS Zvi Galil, Kunsoo Park
1992	A*	`conf`	Witnesses for Boolean Matrix Multiplication and for Shortest Paths FOCS Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
1991	A*	`conf`	A Lower Bound for Parallel String Matching STOC Dany Breslauer, Zvi Galil
1991	J	`jnl`	A Note on Set Union with Arbitrary Deunions. Inf. Process. Lett. Zvi Galil, Giuseppe F. Italiano
1991	A*	`conf`	An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. ICALP Zvi Galil, Oded Margalit
1991	J	`jnl`	An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. SIAM J. Comput. Zvi Galil, Oded Margalit
1991	J	`jnl`	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>. Theor. Comput. Sci. Amir Averbuch, Zvi Galil, Shmuel Winograd
1991	J	`jnl`	Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comput. Surv. Zvi Galil, Giuseppe F. Italiano
1991	A*	`conf`	Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) STOC Zvi Galil, Giuseppe F. Italiano
1991	A*	`conf`	Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) FOCS Amir M. Ben-Amram, Zvi Galil
1991	A*	`conf`	Maintaining Biconnected Components of Dynamic Planar Graphs. ICALP Zvi Galil, Giuseppe F. Italiano
1991	J	`jnl`	On the Exact Complexity of String Matching: Lower Bounds. SIAM J. Comput. Zvi Galil, Raffaele Giancarlo
1991	A*	`conf`	On the Exponent of the All Pairs Shortest Path Problem FOCS Noga Alon, Zvi Galil, Oded Margalit
1991	A*	`conf`	On the Power of Multiple Reads in a Chip. ICALP Pavol Duris, Zvi Galil
1991	J	`jnl`	Reducing edge connectivity to vertex connectivity. SIGACT News Zvi Galil, Giuseppe F. Italiano
1991	J	`jnl`	Two Lower Bounds in Asynchronous Distributed Computation. J. Comput. Syst. Sci. Pavol Duris, Zvi Galil
1990	J	`jnl`	A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. Inf. Process. Lett. Zvi Galil, Kunsoo Park
1990	J	`jnl`	An Improved Algorithm for Approximate String Matching. SIAM J. Comput. Zvi Galil, Kunsoo Park
1990	J	`jnl`	An Optimal O(log log n) Time Parallel String Matching Algorithm. SIAM J. Comput. Dany Breslauer, Zvi Galil
1990	A*	`conf`	Faster Tree Pattern Matching FOCS Moshe Dubiner, Zvi Galil, Edith Magen
1990	A*	`conf`	On the Exact Complexity of String Matching (Extended Abstract) FOCS Livio Colussi, Zvi Galil, Raffaele Giancarlo
1990	—	`conf`	Recent Progress in String Algorithms. SIGAL International Symposium on Algorithms Zvi Galil
1990	A*	`conf`	Sparse Dynamic Programming. SODA David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1989	A*	`conf`	A Secure Public-key Authentication Scheme. EUROCRYPT Zvi Galil, Stuart Haber, Moti Yung
1989	A*	`conf`	An Improved Algorithm for Approximate String Matching. ICALP Zvi Galil, Kunsoo Park
1989	J	`jnl`	Efficient implementation of graph algorithms using contraction. J. ACM Harold N. Gabow, Zvi Galil, Thomas H. Spencer
1989	A*	`conf`	Highly Parallelizable Problems (Extended Abstract) STOC Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
1989	J	`jnl`	Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM J. Comput. Zvi Galil, Stuart Haber, Moti Yung
1989	J	`jnl`	On 3-pushdown graphs with large separators. Comb. Zvi Galil, Ravi Kannan, Endre Szemerédi
1989	J	`jnl`	On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. J. Comput. Syst. Sci. Zvi Galil, Ravi Kannan, Endre Szemerédi
1989	A*	`conf`	Parallel Algorithmic Techniques for Combinatorial Computation. ICALP David Eppstein, Zvi Galil
1989	J	`jnl`	Parallel Evaluation of the Determinant and of the Inverse of a Matrix. Inf. Process. Lett. Zvi Galil, Victor Y. Pan
1989	—	`conf`	Security against Replay Chosen-Ciphertext Attack. Distributed Computing And Cryptography Zvi Galil, Stuart Haber, Moti Yung
1989	J	`jnl`	Solving dense subset-sum problems by using analytical number theory. J. Complex. Mark Chaimovich, Gregory Freiman, Zvi Galil
1989	—	`conf`	Speech Recognition in Parallel. HLT (2) Salvatore J. Stolfo, Zvi Galil, Kathleen R. McKeown, Russell Mills
1989	J	`jnl`	Speeding up Dynamic Programming with Applications to Molecular Biology. Theor. Comput. Sci. Zvi Galil, Raffaele Giancarlo
1988	J	`jnl`	An O(n²(m + n log n)log n) min-cost flow algorithm. J. ACM Zvi Galil, Éva Tardos
1988	J	`jnl`	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. Theor. Comput. Sci. Amir Averbuch, Zvi Galil, Shmuel Winograd
1988	J	`jnl`	Data structures and algorithms for approximate string matching. J. Complex. Zvi Galil, Raffaele Giancarlo
1988	J	`jnl`	Improved processor bounds for combinatorial problems in RNC. Comb. Zvi Galil, Victor Y. Pan
1988	A*	`conf`	On Pointers versus Addresses (Extended Abstract) FOCS Amir M. Ben-Amram, Zvi Galil
1988	J	`jnl`	On finding most uniform spanning trees. Discret. Appl. Math. Zvi Galil, Baruch Schieber
1988	A*	`conf`	Speeding up Dynamic Programming FOCS David Eppstein, Zvi Galil, Raffaele Giancarlo
1987	J	`jnl`	An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. J. ACM Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
1987	J	`jnl`	Better Expanders and Superconcentrators. J. Algorithms Noga Alon, Zvi Galil, V. D. Milman
1987	A*	`conf`	Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. CRYPTO Zvi Galil, Stuart Haber, Moti Yung
1987	J	`jnl`	Distributed Algorithms in Synchronous Broadcasting Networks. Theor. Comput. Sci. Zvi Galil, Gad M. Landau, Mordechai M. Yung
1987	J	`jnl`	Lower Bounds on Communication Complexity Inf. Comput. Pavol Duris, Zvi Galil, Georg Schnitger
1987	J	`jnl`	Parallel String Matching with k Mismatches. Theor. Comput. Sci. Zvi Galil, Raffaele Giancarlo
1987	J	`jnl`	Partitioned Encryption and Achieving Simultaneity by Partitioning. Inf. Process. Lett. Zvi Galil, Moti Yung
1987	A*	`conf`	Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) FOCS Pavol Duris, Zvi Galil
1986	J	`jnl`	An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. SIAM J. Comput. Zvi Galil, Silvio Micali, Harold N. Gabow
1986	A*	`conf`	An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm FOCS Zvi Galil, Éva Tardos
1986	A*	`conf`	Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. ICALP Amir Averbuch, Shmuel Winograd, Zvi Galil
1986	J	`jnl`	Efficient Algorithms for Finding Maximum Matching in Graphs. ACM Comput. Surv. Zvi Galil
1986	J	`jnl`	Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Comb. Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
1986	J	`jnl`	Improved string matching with k mismatches. SIGACT News Zvi Galil, Raffaele Giancarlo
1986	A*	`conf`	On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines STOC Zvi Galil, Ravi Kannan, Endre Szemerédi
1985	A*	`conf`	A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract) FOCS Zvi Galil, Stuart Haber, Moti Yung
1985	A*	`ed.`	Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, USA, January 1985 POPL Mary S. Van Deusen, Zvi Galil, Brian K. Reid
1985	A*	`conf`	Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). ICALP Gad M. Landau, Mordechai M. Yung, Zvi Galil
1985	A*	`conf`	Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC FOCS Zvi Galil, Victor Y. Pan
1985	J	`jnl`	Optimal Parallel Algorithms for String Matching Inf. Control. Zvi Galil
1985	A*	`conf`	Symmetric Public-Key Encryption. CRYPTO Zvi Galil, Stuart Haber, Moti Yung
1984	J	`jnl`	A Time-Space Tradeoff for Language Recognition. Math. Syst. Theory Pavol Duris, Zvi Galil
1984	A*	`conf`	Efficient Implementation of Graph Algorithms Using Contraction FOCS Harold N. Gabow, Zvi Galil, Thomas H. Spencer
1984	A*	`conf`	Lower Bounds on Communication Complexity STOC Pavol Duris, Zvi Galil, Georg Schnitger
1984	A*	`conf`	Optimal Parallel Algorithms for String Matching STOC Zvi Galil
1984	J	`jnl`	Two Nonlinear Lower Bounds for On-Line Computations Inf. Control. Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
1984	J	`jnl`	Two Tapes are Better than One for Nondeterministic Machines. SIAM J. Comput. Pavol Duris, Zvi Galil
1983	J	`jnl`	An Efficient General-Purpose Parallel Computer J. ACM Zvi Galil, Wolfgang J. Paul
1983	—	`conf`	Efficient Algorithms for Finding Maximal Matching in Graphs. CAAP Zvi Galil
1983	J	`jnl`	NP Completeness of Finding the Chromatic Index of Regular Graphs. J. Algorithms Daniel Leven, Zvi Galil
1983	J	`jnl`	Time-Space-Optimal String Matching. J. Comput. Syst. Sci. Zvi Galil, Joel I. Seiferas
1983	A*	`conf`	Two Nonlinear Lower Bounds STOC Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
1982	J	`jnl`	An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database. J. ACM Zvi Galil
1982	A*	`conf`	An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs FOCS Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
1982	J	`jnl`	Efficient Parallel Algorithms for Linear Recurrence Computation. Inf. Process. Lett. Albert G. Greenberg, Richard E. Ladner, Mike Paterson, Zvi Galil
1982	J	`jnl`	Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. Theor. Comput. Sci. Pavol Duris, Zvi Galil
1982	A*	`conf`	On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. ICALP Pavol Duris, Zvi Galil
1982	J	`jnl`	On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store Inf. Control. Pavol Duris, Zvi Galil
1982	A*	`conf`	Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs FOCS Zvi Galil, Silvio Micali, Harold N. Gabow
1982	A*	`conf`	Two Tapes are Better than One for Nondeterministic Machines STOC Pavol Duris, Zvi Galil
1981	A*	`conf`	A Time-Space Tradeoff for Language Recognition FOCS Pavol Duris, Zvi Galil
1981	A*	`conf`	An Efficient General Purpose Parallel Computer STOC Zvi Galil, Wolfgang J. Paul
1981	J	`jnl`	Explicit Constructions of Linear-Sized Superconcentrators. J. Comput. Syst. Sci. Ofer Gabber, Zvi Galil
1981	A*	`conf`	Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) STOC Pavol Duris, Zvi Galil
1981	J	`jnl`	Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. Theor. Comput. Sci. Zvi Galil, Joel I. Seiferas
1981	J	`jnl`	On the Theoretical Efficiency of Various Network Flow Algorithms. Theor. Comput. Sci. Zvi Galil
1981	J	`jnl`	String Matching in Real Time. J. ACM Zvi Galil
1981	A*	`conf`	Time-Space-Optimal String Matching STOC Zvi Galil, Joel I. Seiferas
1980	J	`jnl`	An Acta Informatica Zvi Galil
1980	A*	`conf`	An Almost Linaer Time Algorithm for Computing a Dependency Basis in a Relational Data Base. ICALP Zvi Galil
1980	J	`jnl`	An O(EVlog²V) Algorithm for the Maximal Flow Problem. J. Comput. Syst. Sci. Zvi Galil, Amnon Naamad
1980	J	`jnl`	Applications of Efficient Mergeable Heaps for Optimization Problems on Trees. Acta Informatica Zvi Galil
1980	—	`conf`	Effizienz Paralleler Rechner. GI Jahrestagung Zvi Galil, Wolfgang J. Paul
1980	J	`jnl`	Finding the Vertex Connectivity of Graphs. SIAM J. Comput. Zvi Galil
1980	J	`jnl`	Saving Space in Fast String-Matching. SIAM J. Comput. Zvi Galil, Joel I. Seiferas
1979	J	`jnl`	A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. J. ACM Zvi Galil, Nimrod Megiddo
1979	A*	`conf`	Explicit Constructions of Linear Size Superconcentrators FOCS Ofer Gabber, Zvi Galil
1979	A*	`conf`	Network Flow and Generalized Path Compression STOC Zvi Galil, Amnon Naamad
1979	J	`jnl`	On Fulkerson's Conjecture About Consistent Labeling Processes. Math. Oper. Res. Nimrod Megiddo, Zvi Galil
1979	J	`jnl`	On Improving the Worse Case Running Time of the Boyer-Moore String Matching Algorithm. Commun. ACM Zvi Galil
1979	A*	`conf`	Storage Representations for Tree-Like Data Structures STOC Arnold L. Rosenberg, Derick Wood, Zvi Galil
1979	J	`jnl`	Storage Representations for Tree-Like Data Structures. Math. Syst. Theory Arnold L. Rosenberg, Derick Wood, Zvi Galil
1978	J	`jnl`	A Linear-Time On-Line Recognition Algorithm for "Palstar". J. ACM Zvi Galil, Joel I. Seiferas
1978	A*	`conf`	A New Algorithm for the Maximal Flow Problem FOCS Zvi Galil
1978	J	`jnl`	Killing two birds with one stone. SIGACT News Zvi Galil
1978	A*	`conf`	On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. ICALP Zvi Galil
1978	J	`jnl`	Palindrome Recognition in Real Time by a Multitape Turing Machine. J. Comput. Syst. Sci. Zvi Galil
1977	J	`jnl`	Cyclic Ordering is NP-Complete. Theor. Comput. Sci. Zvi Galil, Nimrod Megiddo
1977	J	`jnl`	On Resolution with Clauses of Bounded Size. SIAM J. Comput. Zvi Galil
1977	J	`jnl`	On the Complexity of Regular Resolution and the Davis-Putnam Procedure. Theor. Comput. Sci. Zvi Galil
1977	J	`jnl`	Real-Time Recognition of Substring Repetition and Reversal. Math. Syst. Theory Joel I. Seiferas, Zvi Galil
1977	A*	`conf`	Saving Space in Fast String-Matching FOCS Zvi Galil, Joel I. Seiferas
1977	J	`jnl`	Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages. Math. Syst. Theory Zvi Galil
1976	J	`jnl`	A Note on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. Zvi Galil, Janos Simon
1976	J	`jnl`	Hierarchies of Complete Problems. Acta Informatica Zvi Galil
1976	J	`jnl`	Monotone switching circuits and boolean matrix product. Computing Kurt Mehlhorn, Zvi Galil
1976	A*	`conf`	On Enumeration Procedures for Theorem Proving and for Integer Programming. ICALP Zvi Galil
1976	A*	`conf`	Real-Time Algorithms for String-Matching and Palindrome Recognition STOC Zvi Galil
1976	A*	`conf`	Recognizing Certain Repetitions and Reversals Within Strings FOCS Zvi Galil, Joel I. Seiferas
1976	J	`jnl`	Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms. Inf. Process. Lett. Zvi Galil
1975	J	`jnl`	Functional Schemas with Nested Predicates Inf. Control. Zvi Galil
1975	B	`conf`	Monotone Switching Circuits and Boolean Matrix Product. MFCS Kurt Mehlhorn, Zvi Galil
1975	J	`jnl`	On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition. SIGACT News Zvi Galil
1975	A*	`conf`	On the Validity and Complexity of Bounded Resolution STOC Zvi Galil
1975	—	`—`	The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus. Zvi Galil
1974	J	`jnl`	On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems. SIGACT News Zvi Galil
1974	—	`conf`	Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation SWAT Zvi Galil