BibSLEIGH — Zvi

Travelled to:

1 × Austria
1 × Canada
1 × Denmark
1 × France
1 × Greece
1 × Hungary
1 × Spain
1 × United Kingdom
12 × USA
2 × Italy

Collaborated with:

∅ P.Duris G.F.Italiano D.Breslauer D.Eppstein W.J.Paul K.Park A.M.Ben-Amram X.Yu O.Margalit J.I.Seiferas A.Naamad A.Apostolico N.Sarnak A.Averbuch S.Winograd R.Kannan E.Szemerédi G.M.Landau M.M.Yung G.Schnitger A.L.Rosenberg D.Wood T.H.Spencer R.Reischuk A.Czumaj L.Gasieniec W.Plandowski O.Berkman B.Schieber U.Vishkin

Talks about:

algorithm (14) string (8) parallel (7) match (7) bound (7) time (7) machin (5) optim (5) two (5) problem (4)

Person: Zvi Galil

DBLP: Galil:Zvi

Facilitated 1 volumes:

Contributed to:

1995

1993

1992

1991

1989

1986

1985

1984

1983

1982

1981

1980

1979

1978

1976

1975

Wrote 34 papers:

ICALP-1995-Ben-AmramG #algebra #bound #random: Lower Bounds on Algebraic Random Access Machines (AMBA, ZG), pp. 360–371.
ICALP-1995-DurisG #automaton: Sensing Versus Nonsensing Automata (PD, ZG), pp. 455–463.
STOC-1995-CzumajGGPP #algorithm #parallel #problem #string: Work-time-optimal parallel algorithms for string problems (AC, ZG, LG, KP, WP), pp. 713–722.
STOC-1995-GalilY #theorem: Short length versions of Menger’s theorem (ZG, XY), pp. 499–508.
STOC-1993-EppsteinGIS #algorithm #graph: Separator based sparsification for dynamic planar graph algorithms (DE, ZG, GFI, THS), pp. 208–217.
ICALP-1992-ApostolicoBG #algorithm #parallel: Optimal Parallel Algorithms for Periods, Palindromes and Squares (AA, DB, ZG), pp. 296–307.
STOC-1992-Galil #algorithm #parallel #string: A Constant-Time Optimal Parallel String-Matching Algorithm (ZG), pp. 69–76.
STOC-1992-GalilIS #testing: Fully Dynamic Planarity Testing (ZG, GFI, NS), pp. 495–506.
ICALP-1991-DurisG #multi #on the #power of: On the Power of Multiple Reads in a Chip (PD, ZG), pp. 697–706.
ICALP-1991-GalilI #component #graph #maintenance: Maintaining Biconnected Components of Dynamic Planar Graphs (ZG, GFI), pp. 339–350.
ICALP-1991-GalilM #algorithm #linear #problem: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.
STOC-1991-BreslauerG #bound #parallel #string: A Lower Bound for Parallel String Matching (DB, ZG), pp. 439–443.
STOC-1991-GalilI #algorithm #problem: Fully Dynamic Algorithms for Edge-Connectivity Problems (ZG, GFI), pp. 317–327.
ICALP-1989-EppsteinG #algorithm #combinator #parallel: Parallel Algorithmic Techniques for Combinatorial Computation (DE, ZG), pp. 304–318.
ICALP-1989-GalilP #algorithm #approximate #string: An Improved Algorithm for Approximate String Matching (ZG, KP), pp. 394–404.
STOC-1989-BerkmanBGSV #problem: Highly Parallelizable Problems (OB, DB, ZG, BS, UV), pp. 309–319.
ICALP-1986-AverbuchWG #algorithm #classification #polynomial: Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (AA, SW, ZG), pp. 31–39.
STOC-1986-GalilKS #graph #nondeterminism #on the #simulation #turing machine: On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
ICALP-1985-LandauYG #algorithm #distributed #network: Distributed Algorithms in Synchronous Broadcasting Networks (GML, MMY, ZG), pp. 363–372.
STOC-1984-DurisGS #bound #communication #complexity: Lower Bounds on Communication Complexity (PD, ZG, GS), pp. 81–91.
STOC-1984-Galil #algorithm #parallel #string: Optimal Parallel Algorithms for String Matching (ZG), pp. 240–248.
STOC-1983-DurisGPR #bound: Two Nonlinear Lower Bounds (PD, ZG, WJP, RR), pp. 127–132.
ICALP-1982-DurisG #automaton #bound #on the: On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.
STOC-1982-DurisG #nondeterminism: Two Tapes are Better than One for Nondeterministic Machines (PD, ZG), pp. 1–7.
STOC-1981-DurisG #automaton: Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (PD, ZG), pp. 177–188.
STOC-1981-GalilP #parallel #performance: An Efficient General Purpose Parallel Computer (ZG, WJP), pp. 247–262.
STOC-1981-GalilS #string: Time-Space-Optimal String Matching (ZG, JIS), pp. 106–113.
ICALP-1980-Galil #algorithm #database #dependence #linear #relational: An Almost Linear Time Algorithm for Computing a Dependency Basis in a Relational Data Base (ZG), pp. 246–256.
STOC-1979-GalilN #network: Network Flow and Generalized Path Compression (ZG, AN), pp. 13–26.
STOC-1979-RosenbergWG #data type: Storage Representations for Tree-Like Data Structures (ALR, DW, ZG), pp. 99–107.
ICALP-1978-Galil #algorithm #on the #string: On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm (ZG), pp. 241–250.
ICALP-1976-Galil #integer #on the #programming #proving #theorem proving: On Enumeration Procedures for Theorem Proving and for Integer Programming (ZG), pp. 355–381.
STOC-1976-Galil #algorithm #realtime #recognition #string: Real-Time Algorithms for String-Matching and Palindrome Recognition (ZG), pp. 161–173.
STOC-1975-Galil #bound #complexity #on the: On the Validity and Complexity of Bounded Resolution (ZG), pp. 72–82.