Search filters

List of works by Zvi Galil

40 years of suffix trees

academic article

A linear-time algorithm for concave one-dimensional dynamic programming

scientific article (publication date: February 1990)

A note on set union with arbitrary deunions

An improved algorithm for approximate string matching

article published in 1989

Data structures and algorithms for disjoint set union problems

scholarly article by Zvi Galil & Giuseppe F. Italiano published 1 September 1991 in ACM Computing Surveys

Efficient algorithms for finding maximum matching in graphs

scientific article (publication date: March 1986)

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

article

Explicit constructions of linear-sized superconcentrators

scientific article (publication date: June 1981)

On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition

scientific article (publication date: November 1975)

On improving the worst case running time of the Boyer-Moore string matching algorithm

On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines

scientific article (publication date: February 1989)

Parallel detection of all palindromes in a string ⬇️

Separator Based Sparsification

article published in 1996

Separator-Based Sparsification II: Edge and Vertex Connectivity

scientific article published in 1998

Sparse dynamic programming I: linear cost functions

Sparse dynamic programming II: convex and concave cost functions

Sparsification---a technique for speeding up dynamic graph algorithms

Paulina is supported by:

About Paulina

Help