Search results for "Zvi Galil"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Dany Breslauer, Zvi Galil	Real-Time Streaming String-Matching.	CPM	2011	DBLP DOI BibTeX RDF
1	Zvi Galil	Old and New in Stringology.	CPM	2010	DBLP DOI BibTeX RDF
1	Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park	Parallel two dimensional witness computation.	Inf. Comput.	2004	DBLP DOI BibTeX RDF
1	Zvi Galil, Jong Geun Park, Kunsoo Park	Three-Dimensional Periodicity and Its Application to Pattern Matching.	SIAM J. Discrete Math.	2004	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram, Zvi Galil	Lower Bounds for Dynamic Data Structures on Algebraic RAMs.	Algorithmica	2002	DBLP DOI BibTeX RDF	Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
1	Amir M. Ben-Amram, Zvi Galil	A Generalization of a Lower Bound Technique due to Fredman and Saks.	Algorithmica	2001	DBLP DOI BibTeX RDF	Algorithms, Parallel computing, Implementation, List ranking
1	Amir M. Ben-Amram, Zvi Galil	Topological Lower Bounds on Algebraic Random Access Machines.	SIAM J. Comput.	2001	DBLP DOI BibTeX RDF
1	Matthew K. Franklin, Zvi Galil, Moti Yung	Eavesdropping games: a graph-theoretic approach to privacy in distributed systems.	J. ACM	2000	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano, Neil Sarnak	Fully Dynamic Planarity Testing with Applications.	J. ACM	1999	DBLP DOI BibTeX RDF	planarity testing, planar graphs, dynamic graph algorithms
1	David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer	Separator-Based Sparsification II: Edge and Vertex Connectivity.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Zvi Galil, Oded Margalit	All Pairs Shortest Distances for Graphs with Small Integer Length Edges.	Inf. Comput.	1997	DBLP DOI BibTeX RDF
1	David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig	Sparsification - a technique for speeding up dynamic graph algorithms.	J. ACM	1997	DBLP DOI BibTeX RDF	edge and vertex connectivity, minimum spanning trees, dynamic graph algorithms
1	Noga Alon, Zvi Galil, Oded Margalit	On the Exponent of the All Pairs Shortest Path Problem.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Zvi Galil, Oded Margalit	All Pairs Shortest Paths for Graphs with Small Integer Length Edges.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter	Constant-Time Randomized Parallel String Matching.	SIAM J. Comput.	1997	DBLP DOI BibTeX RDF
1	Zvi Galil, Jong Geun Park, Kunsoo Park	Three-Dimensional Pattern Matching.	SPAA	1997	DBLP DOI BibTeX RDF
1	David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer	Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.	J. Comput. Syst. Sci.	1996	DBLP DOI BibTeX RDF
1	Zvi Galil, Kunsoo Park	Alphabet-Independent Two-Dimensional Witness Computation.	SIAM J. Comput.	1996	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram, Zvi Galil	On Data Structure Tradeoffs and an Application to Union-Find	Electronic Colloquium on Computational Complexity (ECCC)	1995	DBLP BibTeX RDF
1	Alberto Apostolico, Dany Breslauer, Zvi Galil	Parallel Detection of all Palindromes in a String.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
1	Dany Breslauer, Zvi Galil	Finding All Periods and Initial Palindromes of a String in Parallel.	Algorithmica	1995	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram, Zvi Galil	On the Power of the Shift Instruction	Inf. Comput.	1995	DBLP DOI BibTeX RDF
1	Zvi Galil	A Constant-Time Optimal Parallel String-Matching Algorithm.	J. ACM	1995	DBLP DOI BibTeX RDF	lion hunting, string matching, period, CRCW-PRAM, optimal parallel algorithm, constant time
1	Noga Alon, Zvi Galil, Moti Yung	Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary.	ESA	1995	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram, Zvi Galil	Lower Bounds on Algebraic Random Access Machines (Extended Abstract).	ICALP	1995	DBLP DOI BibTeX RDF
1	Pavol Duris, Zvi Galil	Sensing Versus Nonsensing Automata.	ICALP	1995	DBLP DOI BibTeX RDF
1	Zvi Galil, Esko Ukkonen (eds.)	Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings	CPM	1995	DBLP BibTeX RDF
1	Zvi Galil, Alain J. Mayer, Moti Yung	Resolving Message Complexity of Byzantine Agreement and beyond.	FOCS	1995	DBLP DOI BibTeX RDF	Malicious, early stopping agreement protocols, distributed work performance, reliability, distributed algorithms, distributed computing, fault tolerant computing, message passing, message passing, optimisation, fault models, communication complexity, Byzantine Agreement, agreement, message complexity, linear time, workstation network, Crash, Omission, adaptive parallelism
1	Zvi Galil, Xiangdong Yu	Short length versions of Menger's theorem (Extended Abstract).	STOC	1995	DBLP DOI BibTeX RDF
1	Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski	Work-time-optimal parallel algorithms for string problems.	STOC	1995	DBLP DOI BibTeX RDF
1	Zvi Galil, Kunsoo Park	Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency.	J. Parallel Distrib. Comput.	1994	DBLP DOI BibTeX RDF
1	Moshe Dubiner, Zvi Galil, Edith Magen	Faster Tree Pattern Matching.	J. ACM	1994	DBLP DOI BibTeX RDF	pattern matching, tree, string matching, convolution, period, don't-care
1	Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park	Dynamic Dictionary Matching.	J. Comput. Syst. Sci.	1994	DBLP DOI BibTeX RDF
1	Alberto Apostolico, Dany Breslauer, Zvi Galil	Parallel Detection of all Palindromes in a String.	STACS	1994	DBLP DOI BibTeX RDF
1	Dany Breslauer, Zvi Galil	Efficient Comparison Based String Matching.	J. Complexity	1993	DBLP DOI BibTeX RDF
1	Zvi Galil, Oded Margalit	Witnesses for Boolean Matrix Multiplication and for Transitive Closure.	J. Complexity	1993	DBLP DOI BibTeX RDF
1	Pavol Duris, Zvi Galil	On the Power of Multiple Reads in a Chip	Inf. Comput.	1993	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano	Maintaining the 3-Edge-Connected Components of a Graph On-Line.	SIAM J. Comput.	1993	DBLP DOI BibTeX RDF
1	Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber (eds.)	Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings	CPM	1993	DBLP BibTeX RDF
1	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	DBLP DOI BibTeX RDF	optimally fast parallel algorithms, parallel CRCW PRAM algorithms, constant-time text search algorithm, probabilistic string-matching algorithm, pattern matching, preprocessing, time bound, Las-Vegas algorithm
1	Matthew K. Franklin, Zvi Galil, Moti Yung	Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems	FOCS	1993	DBLP DOI BibTeX RDF	eavesdropping games, mobile eavesdroppers, secure message transmission, distributed database maintenance, privacy maintenance problems, privacy, distributed systems, computational complexity, protocols, bugs, graph-theoretic approach
1	Amir M. Ben-Amram, Zvi Galil	When can we sort in o(n log n) time?	FOCS	1993	DBLP DOI BibTeX RDF	Boolean instructions, arithmetic instructions, nonuniform programs, double-precision multiplication, lower bounds, upper bounds, random access machine
1	David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer	Separator based sparsification for dynamic planar graph algorithms.	STOC	1993	DBLP DOI BibTeX RDF
1	Zvi Galil, Kunsoo Park	Dynamic Programming with Convexity, Concavity, and Sparsity.	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
1	Yuval Rabani, Zvi Galil	On the Space Complexity of Some Algorithms for Sequence Comparison.	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram, Zvi Galil	On Pointers versus Addresses.	J. ACM	1992	DBLP DOI BibTeX RDF	pointer structures, random access memory, incompressibility
1	David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano	Sparse Dynamic Programming II: Convex and Concave Cost Functions.	J. ACM	1992	DBLP DOI BibTeX RDF	dynamic programming, time complexity, sequence alignment, sparsity, recurrence
1	David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano	Sparse Dynamic Programming I: Linear Cost Functions.	J. ACM	1992	DBLP DOI BibTeX RDF	dynamic programming, time complexity, sequence alignment, sparsity, recurrence
1	Zvi Galil, Giuseppe F. Italiano	Fully Dynamic Algorithms for 2-Edge Connectivity.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
1	Dany Breslauer, Zvi Galil	A Lower Bound for Parallel String Matching.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
1	Zvi Galil, Raffaele Giancarlo	On the Exact Complexity of String Matching: Upper Bounds.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
1	Alberto Apostolico, Dany Breslauer, Zvi Galil	Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract).	ICALP	1992	DBLP DOI BibTeX RDF
1	Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber (eds.)	Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings	CPM	1992	DBLP BibTeX RDF
1	Danny Dolev, Zvi Galil, Michael Rodeh (eds.)	Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa, Israel, May 1992	ISTCS	1992	DBLP BibTeX RDF
1	Noga Alon, Zvi Galil, Oded Margalit, Moni Naor	Witnesses for Boolean Matrix Multiplication and for Shortest Paths	FOCS	1992	DBLP DOI BibTeX RDF	subcubic methods, shortest paths, deterministic algorithm, transitive closure, witnesses, Boolean matrix multiplication
1	Zvi Galil, Kunsoo Park	Truly Alphabet-Independent Two-Dimensional Pattern Matching	FOCS	1992	DBLP DOI BibTeX RDF	truly alphabet-independent 2D pattern matching, Knuth-Morris-Pratt algorithm, string matching, text processing
1	David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig	Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)	FOCS	1992	DBLP DOI BibTeX RDF	minimum spanning forests, best swap, graph 2-edge-connectivity, data structures, graph connectivity, dynamic graph algorithms, sparsification
1	Zvi Galil	A Constant-Time Optimal Parallel String-Matching Algorithm	STOC	1992	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano, Neil Sarnak	Fully Dynamic Planarity Testing (Extended Abstract)	STOC	1992	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano	A Note on Set Union with Arbitrary Deunions.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF
1	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.	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano	Data Structures and Algorithms for Disjoint Set Union Problems.	ACM Comput. Surv.	1991	DBLP DOI BibTeX RDF
1	Pavol Duris, Zvi Galil	Two Lower Bounds in Asynchronous Distributed Computation.	J. Comput. Syst. Sci.	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Oded Margalit	An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.	SIAM J. Comput.	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Raffaele Giancarlo	On the Exact Complexity of String Matching: Lower Bounds.	SIAM J. Comput.	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Oded Margalit	An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.	ICALP	1991	DBLP DOI BibTeX RDF
1	Pavol Duris, Zvi Galil	On the Power of Multiple Reads in a Chip.	ICALP	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano	Maintaining Biconnected Components of Dynamic Planar Graphs.	ICALP	1991	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram, Zvi Galil	Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time
1	Noga Alon, Zvi Galil, Oded Margalit	On the Exponent of the All Pairs Shortest Path Problem	FOCS	1991	DBLP BibTeX RDF
1	Dany Breslauer, Zvi Galil	A Lower Bound for Parallel String Matching	STOC	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Giuseppe F. Italiano	Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract)	STOC	1991	DBLP DOI BibTeX RDF
1	Zvi Galil, Kunsoo Park	A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming.	Inf. Process. Lett.	1990	DBLP DOI BibTeX RDF
1	Zvi Galil, Kunsoo Park	An Improved Algorithm for Approximate String Matching.	SIAM J. Comput.	1990	DBLP DOI BibTeX RDF
1	Dany Breslauer, Zvi Galil	An Optimal O(log log n) Time Parallel String Matching Algorithm.	SIAM J. Comput.	1990	DBLP DOI BibTeX RDF
1	David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano	Sparse Dynamic Programming.	SODA	1990	DBLP DOI BibTeX RDF
1	Zvi Galil	Recent Progress in String Algorithms.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
1	Moshe Dubiner, Zvi Galil, Edith Magen	Faster Tree Pattern Matching	FOCS	1990	DBLP DOI BibTeX RDF	ordered labelled trees, tail period pairs, algorithm, time complexity, tree pattern matching
1	Livio Colussi, Zvi Galil, Raffaele Giancarlo	On the Exact Complexity of String Matching (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	exact complexity, character comparisons, linear-time string matching algorithm, pattern string, online algorithms, text string, alphabet
1	Zvi Galil, Victor Y. Pan	Parallel Evaluation of the Determinant and of the Inverse of a Matrix.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
1	Zvi Galil, Raffaele Giancarlo	Speeding up Dynamic Programming with Applications to Molecular Biology.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF
1	Mark Chaimovich, Gregory Freiman, Zvi Galil	Solving dense subset-sum problems by using analytical number theory.	J. Complexity	1989	DBLP DOI BibTeX RDF
1	Harold N. Gabow, Zvi Galil, Thomas H. Spencer	Efficient implementation of graph algorithms using contraction.	J. ACM	1989	DBLP DOI BibTeX RDF
1	Zvi Galil, Ravi Kannan, Endre Szemerédi	On 3-pushdown graphs with large separators.	Combinatorica	1989	DBLP DOI BibTeX RDF
1	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.	1989	DBLP DOI BibTeX RDF
1	Zvi Galil, Stuart Haber, Moti Yung	Minimum-Knowledge Interactive Proofs for Decision Problems.	SIAM J. Comput.	1989	DBLP DOI BibTeX RDF
1	David Eppstein, Zvi Galil	Parallel Algorithmic Techniques for Combinatorial Computation.	ICALP	1989	DBLP DOI BibTeX RDF
1	Zvi Galil, Kunsoo Park	An Improved Algorithm for Approximate String Matching.	ICALP	1989	DBLP DOI BibTeX RDF
1	Zvi Galil, Stuart Haber, Moti Yung	A Secure Public-key Authentication Scheme.	EUROCRYPT	1989	DBLP DOI BibTeX RDF
1	Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin	Highly Parallelizable Problems (Extended Abstract)	STOC	1989	DBLP DOI BibTeX RDF
1	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] / < Q(u)^l >, l > 1.	Theor. Comput. Sci.	1988	DBLP DOI BibTeX RDF
1	Zvi Galil, Raffaele Giancarlo	Data structures and algorithms for approximate string matching.	J. Complexity	1988	DBLP DOI BibTeX RDF
1	Zvi Galil, Éva Tardos	An O(n²(m + n log n)log n) min-cost flow algorithm.	J. ACM	1988	DBLP DOI BibTeX RDF
1	Zvi Galil, Victor Y. Pan	Improved processor bounds for combinatorial problems in RNC.	Combinatorica	1988	DBLP DOI BibTeX RDF
1	Zvi Galil, Baruch Schieber	On finding most uniform spanning trees.	Discrete Applied Mathematics	1988	DBLP DOI BibTeX RDF
1	David Eppstein, Zvi Galil, Raffaele Giancarlo	Speeding up Dynamic Programming	FOCS	1988	DBLP DOI BibTeX RDF	geology, algorithms, data structures, dynamic programming, speech recognition, molecular biology, computational problems
1	Amir M. Ben-Amram, Zvi Galil	On Pointers versus Addresses (Extended Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	countable closed set, random addressing, pointer machine, RAM program, set of primitives, continuously differentiable, lower bound, time, tree, functions, space, Kolmogorov complexity, strings, data type, pointers, addresses, random-access memory, real numbers, incompressibility
1	Zvi Galil, Moti Yung	Partitioned Encryption and Achieving Simultaneity by Partitioning.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
1	Zvi Galil, Gad M. Landau, Mordechai M. Yung	Distributed Algorithms in Synchronous Broadcasting Networks.	Theor. Comput. Sci.	1987	DBLP DOI BibTeX RDF
1	Zvi Galil, Raffaele Giancarlo	Parallel String Matching with k Mismatches.	Theor. Comput. Sci.	1987	DBLP DOI BibTeX RDF

Publications of "Zvi Galil" ( http://dblp.L3S.de/Authors/Zvi_Galil )