Galil, Zvi.
Galil, Zvi, 1947-....
צבי גליל מתמטיקאי ישראלי
Galil, Z.
גליל, צבי
Galil, Z. (Zvi)
VIAF ID: 163621762 (Personal)
Permalink: http://viaf.org/viaf/163621762
Preferred Forms
-
-
-
-
- 100 1 0 ‡a Galil, Zvi
-
-
- 100 1 _ ‡a Galil, Zvi
- 100 1 _ ‡a Galil, Zvi
- 100 1 _ ‡a Galil, Zvi, ‡d 1947-....
-
-
- 100 0 _ ‡a צבי גליל ‡c מתמטיקאי ישראלי
4xx's: Alternate Name Forms (13)
Works
Title | Sources |
---|---|
40 years of suffix trees | |
Combinatorial algorithms on words | |
Combinatorial pattern matching : 6th annual symposium, CPM 95, Espoo, Finland, July 5-7, 1995 : proceedings | |
Combinatorial pattern matching / Zvi Galil, Esko Ukkonen (eds.). - Berlin, 1995. | |
The complexity of resolution procedures for theorem proving in the propositional calculus | |
CPM 95 | |
Data structures and algorithms for disjoint set union problems | |
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs | |
Efficient comparison based string matching | |
Explicit constructions of linear-sized superconcentrators | |
Finding all periods and initial palindromes of a string in parallel | |
Foundations of computer science : proceedings | |
A linear-time algorithm for concave one-dimensional dynamic programming | |
A note on set union with arbitrary deunions | |
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 | |
Pattern matching algorithms | |
Separator-Based Sparsification II: Edge and Vertex Connectivity | |
Sparse dynamic programming II: convex and concave cost functions | |
Sparsification---a technique for speeding up dynamic graph algorithms | |
Theory of computing and systems / D. Dolev, Z. Galil, M. Rodeh (eds.). - Berlin, 1992. | |
Theory of computing and systems : ISTCS '92, Israel Symposium, Haifa, Israel, may 27-28, 1992 : proceedings |