The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zvi Galil: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zvi Galil
    An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database. [Citation Graph (10, 0)][DBLP]
    J. ACM, 1982, v:29, n:1, pp:96-102 [Journal]
  2. Zvi Galil
    On Improving the Worse Case Running Time of the Boyer-Moore String Matching Algorithm. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:9, pp:505-508 [Journal]
  3. Zvi Galil, Nimrod Megiddo
    A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:58-64 [Journal]
  4. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
    Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1992, pp:60-69 [Conf]
  5. Zvi Galil
    Hierarchies of Complete Problems. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:77-88 [Journal]
  6. Zvi Galil
    Efficient Algorithms for Finding Maximum Matching in Graphs. [Citation Graph (1, 0)][DBLP]
    ACM Comput. Surv., 1986, v:18, n:1, pp:23-38 [Journal]
  7. Amir M. Ben-Amram, Zvi Galil
    On the Power of the Shift Instruction [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:1, pp:19-36 [Journal]
  8. Moshe Dubiner, Zvi Galil, Edith Magen
    Faster Tree Pattern Matching. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:205-213 [Journal]
  9. Zvi Galil
    String Matching in Real Time. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:134-149 [Journal]
  10. Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park
    Dynamic Dictionary Matching. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:208-222 [Journal]
  11. Zvi Galil, Joel I. Seiferas
    Time-Space-Optimal String Matching. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:3, pp:280-294 [Journal]
  12. Zvi Galil
    On the Complexity of Regular Resolution and the Davis-Putnam Procedure. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:1, pp:23-46 [Journal]
  13. Zvi Galil
    Efficient Algorithms for Finding Maximal Matching in Graphs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:90-113 [Conf]
  14. Zvi Galil, Stuart Haber, Moti Yung
    Symmetric Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:128-137 [Conf]
  15. Zvi Galil, Stuart Haber, Moti Yung
    Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:135-155 [Conf]
  16. Noga Alon, Zvi Galil, Moti Yung
    Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:523-537 [Conf]
  17. Zvi Galil, Stuart Haber, Moti Yung
    A Secure Public-key Authentication Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:3-15 [Conf]
  18. Noga Alon, Zvi Galil, Oded Margalit
    On the Exponent of the All Pairs Shortest Path Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:569-575 [Conf]
  19. Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
    Witnesses for Boolean Matrix Multiplication and for Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:417-426 [Conf]
  20. Amir M. Ben-Amram, Zvi Galil
    On Pointers versus Addresses (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:532-538 [Conf]
  21. Amir M. Ben-Amram, Zvi Galil
    Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:622-631 [Conf]
  22. Amir M. Ben-Amram, Zvi Galil
    When can we sort in o(n log n) time? [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:538-546 [Conf]
  23. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:248-258 [Conf]
  24. Livio Colussi, Zvi Galil, Raffaele Giancarlo
    On the Exact Complexity of String Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:135-144 [Conf]
  25. Moshe Dubiner, Zvi Galil, Edith Magen
    Faster Tree Pattern Matching [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:145-150 [Conf]
  26. Pavol Duris, Zvi Galil
    A Time-Space Tradeoff for Language Recognition [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:53-57 [Conf]
  27. Pavol Duris, Zvi Galil
    Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:326-330 [Conf]
  28. David Eppstein, Zvi Galil, Raffaele Giancarlo
    Speeding up Dynamic Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:488-496 [Conf]
  29. Matthew K. Franklin, Zvi Galil, Moti Yung
    Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:670-679 [Conf]
  30. Ofer Gabber, Zvi Galil
    Explicit Constructions of Linear Size Superconcentrators [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:364-370 [Conf]
  31. Harold N. Gabow, Zvi Galil, Thomas H. Spencer
    Efficient Implementation of Graph Algorithms Using Contraction [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:347-357 [Conf]
  32. Zvi Galil
    Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:170-177 [Conf]
  33. Zvi Galil
    A New Algorithm for the Maximal Flow Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:231-245 [Conf]
  34. Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
    An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:118-125 [Conf]
  35. Zvi Galil, Stuart Haber, Moti Yung
    A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:360-371 [Conf]
  36. Zvi Galil, Silvio Micali, Harold N. Gabow
    Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:255-261 [Conf]
  37. Zvi Galil, Alain J. Mayer, Moti Yung
    Resolving Message Complexity of Byzantine Agreement and beyond. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:724-733 [Conf]
  38. Zvi Galil, Victor Y. Pan
    Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:490-495 [Conf]
  39. Zvi Galil, Kunsoo Park
    Truly Alphabet-Independent Two-Dimensional Pattern Matching [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:247-256 [Conf]
  40. Zvi Galil, Joel I. Seiferas
    Recognizing Certain Repetitions and Reversals Within Strings [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:236-252 [Conf]
  41. Zvi Galil, Joel I. Seiferas
    Saving Space in Fast String-Matching [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:179-188 [Conf]
  42. Zvi Galil, Éva Tardos
    An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:1-9 [Conf]
  43. Zvi Galil, Wolfgang J. Paul
    Effizienz Paralleler Rechner. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1980, pp:54-64 [Conf]
  44. Alberto Apostolico, Dany Breslauer, Zvi Galil
    Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:296-307 [Conf]
  45. Amir Averbuch, Shmuel Winograd, Zvi Galil
    Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:31-39 [Conf]
  46. Amir M. Ben-Amram, Zvi Galil
    Lower Bounds on Algebraic Random Access Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:360-371 [Conf]
  47. Pavol Duris, Zvi Galil
    On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:166-175 [Conf]
  48. Pavol Duris, Zvi Galil
    On the Power of Multiple Reads in a Chip. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:697-706 [Conf]
  49. Pavol Duris, Zvi Galil
    Sensing Versus Nonsensing Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:455-463 [Conf]
  50. David Eppstein, Zvi Galil
    Parallel Algorithmic Techniques for Combinatorial Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:304-318 [Conf]
  51. Zvi Galil
    On Enumeration Procedures for Theorem Proving and for Integer Programming. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:355-381 [Conf]
  52. Zvi Galil
    On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:241-250 [Conf]
  53. Zvi Galil
    An Almost Linaer Time Algorithm for Computing a Dependency Basis in a Relational Data Base. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:246-256 [Conf]
  54. Zvi Galil, Giuseppe F. Italiano
    Maintaining Biconnected Components of Dynamic Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:339-350 [Conf]
  55. Zvi Galil, Oded Margalit
    An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:719-727 [Conf]
  56. Zvi Galil, Kunsoo Park
    An Improved Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:394-404 [Conf]
  57. Gad M. Landau, Mordechai M. Yung, Zvi Galil
    Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:363-372 [Conf]
  58. Kurt Mehlhorn, Zvi Galil
    Monotone Switching Circuits and Boolean Matrix Product. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:315-319 [Conf]
  59. Zvi Galil
    Recent Progress in String Algorithms. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:1- [Conf]
  60. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:513-522 [Conf]
  61. Zvi Galil, Jong Geun Park, Kunsoo Park
    Three-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:53-62 [Conf]
  62. Alberto Apostolico, Dany Breslauer, Zvi Galil
    Parallel Detection of all Palindromes in a String. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:497-506 [Conf]
  63. Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
    Highly Parallelizable Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:309-319 [Conf]
  64. Dany Breslauer, Zvi Galil
    A Lower Bound for Parallel String Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:439-443 [Conf]
  65. Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
    Work-time-optimal parallel algorithms for string problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:713-722 [Conf]
  66. Pavol Duris, Zvi Galil
    Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:177-188 [Conf]
  67. Pavol Duris, Zvi Galil
    Two Tapes are Better than One for Nondeterministic Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:1-7 [Conf]
  68. Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
    Two Nonlinear Lower Bounds [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:127-132 [Conf]
  69. Pavol Duris, Zvi Galil, Georg Schnitger
    Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:81-91 [Conf]
  70. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator based sparsification for dynamic planar graph algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:208-217 [Conf]
  71. Zvi Galil
    On the Validity and Complexity of Bounded Resolution [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:72-82 [Conf]
  72. Zvi Galil
    Real-Time Algorithms for String-Matching and Palindrome Recognition [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:161-173 [Conf]
  73. Zvi Galil
    Optimal Parallel Algorithms for String Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:240-248 [Conf]
  74. Zvi Galil
    A Constant-Time Optimal Parallel String-Matching Algorithm [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:69-76 [Conf]
  75. Zvi Galil, Giuseppe F. Italiano
    Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:317-327 [Conf]
  76. Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
    Fully Dynamic Planarity Testing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:495-506 [Conf]
  77. Zvi Galil, Ravi Kannan, Endre Szemerédi
    On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:39-49 [Conf]
  78. Zvi Galil, Amnon Naamad
    Network Flow and Generalized Path Compression [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:13-26 [Conf]
  79. Zvi Galil, Wolfgang J. Paul
    An Efficient General Purpose Parallel Computer [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:247-262 [Conf]
  80. Zvi Galil, Joel I. Seiferas
    Time-Space-Optimal String Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:106-113 [Conf]
  81. Zvi Galil, Xiangdong Yu
    Short length versions of Menger's theorem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:499-508 [Conf]
  82. Arnold L. Rosenberg, Derick Wood, Zvi Galil
    Storage Representations for Tree-Like Data Structures [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:99-107 [Conf]
  83. Zvi Galil
    Applications of Efficient Mergeable Heaps for Optimization Problems on Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:13, n:, pp:53-58 [Journal]
  84. Zvi Galil
    An O(V5/3 E2/3) Algorithm for the Maximal Flow Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:14, n:, pp:221-242 [Journal]
  85. Amir M. Ben-Amram, Zvi Galil
    A Generalization of a Lower Bound Technique due to Fredman and Saks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:1, pp:34-66 [Journal]
  86. Amir M. Ben-Amram, Zvi Galil
    Lower Bounds for Dynamic Data Structures on Algebraic RAMs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:3, pp:364-395 [Journal]
  87. Dany Breslauer, Zvi Galil
    Finding All Periods and Initial Palindromes of a String in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:4, pp:355-366 [Journal]
  88. Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
    Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:2, pp:109-122 [Journal]
  89. Zvi Galil, Ravi Kannan, Endre Szemerédi
    On 3-pushdown graphs with large separators. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:1, pp:9-19 [Journal]
  90. Zvi Galil, Victor Y. Pan
    Improved processor bounds for combinatorial problems in RNC. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:2, pp:189-200 [Journal]
  91. Zvi Galil, Giuseppe F. Italiano
    Data Structures and Algorithms for Disjoint Set Union Problems. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1991, v:23, n:3, pp:319-344 [Journal]
  92. Amir M. Ben-Amram, Zvi Galil
    On Data Structure Tradeoffs and an Application to Union-Find [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:62, pp:- [Journal]
  93. Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
    Parallel two dimensional witness computation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:20-67 [Journal]
  94. Pavol Duris, Zvi Galil
    On the Power of Multiple Reads in a Chip [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:277-287 [Journal]
  95. Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
    Two Nonlinear Lower Bounds for On-Line Computations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:1-11 [Journal]
  96. Pavol Duris, Zvi Galil, Georg Schnitger
    Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:73, n:1, pp:1-22 [Journal]
  97. Zvi Galil
    Functional Schemas with Nested Predicates [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:27, n:4, pp:349-368 [Journal]
  98. Zvi Galil
    Optimal Parallel Algorithms for String Matching [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:144-157 [Journal]
  99. Pavol Duris, Zvi Galil
    On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:54, n:3, pp:217-227 [Journal]
  100. Zvi Galil, Oded Margalit
    All Pairs Shortest Distances for Graphs with Small Integer Length Edges. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:134, n:2, pp:103-139 [Journal]
  101. Zvi Galil
    Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:4, n:4, pp:85-87 [Journal]
  102. Zvi Galil, Giuseppe F. Italiano
    A Note on Set Union with Arbitrary Deunions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:6, pp:331-335 [Journal]
  103. Zvi Galil, Victor Y. Pan
    Parallel Evaluation of the Determinant and of the Inverse of a Matrix. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:1, pp:41-45 [Journal]
  104. Zvi Galil, Kunsoo Park
    A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:309-311 [Journal]
  105. Zvi Galil, Moti Yung
    Partitioned Encryption and Achieving Simultaneity by Partitioning. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:2, pp:81-88 [Journal]
  106. Albert G. Greenberg, Richard E. Ladner, Mike Paterson, Zvi Galil
    Efficient Parallel Algorithms for Linear Recurrence Computation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:1, pp:31-35 [Journal]
  107. Amir M. Ben-Amram, Zvi Galil
    On Pointers versus Addresses. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:617-648 [Journal]
  108. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming I: Linear Cost Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:519-545 [Journal]
  109. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming II: Convex and Concave Cost Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:546-567 [Journal]
  110. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
    Sparsification - a technique for speeding up dynamic graph algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:5, pp:669-696 [Journal]
  111. Matthew K. Franklin, Zvi Galil, Moti Yung
    Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:2, pp:225-243 [Journal]
  112. Harold N. Gabow, Zvi Galil, Thomas H. Spencer
    Efficient implementation of graph algorithms using contraction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:540-572 [Journal]
  113. Zvi Galil
    A Constant-Time Optimal Parallel String-Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:4, pp:908-918 [Journal]
  114. Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
    An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:513-531 [Journal]
  115. Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
    Fully Dynamic Planarity Testing with Applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:1, pp:28-91 [Journal]
  116. Zvi Galil, Wolfgang J. Paul
    An Efficient General-Purpose Parallel Computer [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:2, pp:360-387 [Journal]
  117. Zvi Galil, Joel I. Seiferas
    A Linear-Time On-Line Recognition Algorithm for ``Palstar''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:102-111 [Journal]
  118. Zvi Galil, Éva Tardos
    An O(n²(m + n log n)log n) min-cost flow algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:2, pp:374-386 [Journal]
  119. Noga Alon, Zvi Galil, V. D. Milman
    Better Expanders and Superconcentrators. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:3, pp:337-347 [Journal]
  120. Daniel Leven, Zvi Galil
    NP Completeness of Finding the Chromatic Index of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:1, pp:35-44 [Journal]
  121. Mark Chaimovich, Gregory Freiman, Zvi Galil
    Solving dense subset-sum problems by using analytical number theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:3, pp:271-282 [Journal]
  122. Dany Breslauer, Zvi Galil
    Efficient Comparison Based String Matching. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:3, pp:339-365 [Journal]
  123. Zvi Galil, Raffaele Giancarlo
    Data structures and algorithms for approximate string matching. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1988, v:4, n:1, pp:33-72 [Journal]
  124. Zvi Galil, Oded Margalit
    Witnesses for Boolean Matrix Multiplication and for Transitive Closure. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:2, pp:201-221 [Journal]
  125. Noga Alon, Zvi Galil, Oded Margalit
    On the Exponent of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:255-262 [Journal]
  126. Pavol Duris, Zvi Galil
    Two Lower Bounds in Asynchronous Distributed Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:3, pp:254-266 [Journal]
  127. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:3-27 [Journal]
  128. Ofer Gabber, Zvi Galil
    Explicit Constructions of Linear-Sized Superconcentrators. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:407-420 [Journal]
  129. Zvi Galil
    Palindrome Recognition in Real Time by a Multitape Turing Machine. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:2, pp:140-157 [Journal]
  130. Zvi Galil, Ravi Kannan, Endre Szemerédi
    On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:134-149 [Journal]
  131. Zvi Galil, Oded Margalit
    All Pairs Shortest Paths for Graphs with Small Integer Length Edges. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:243-254 [Journal]
  132. Zvi Galil, Amnon Naamad
    An O(EVlog²V) Algorithm for the Maximal Flow Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:203-217 [Journal]
  133. Zvi Galil, Janos Simon
    A Note on Multiple-Entry Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:3, pp:350-351 [Journal]
  134. Zvi Galil, Kunsoo Park
    Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:21, n:2, pp:213-222 [Journal]
  135. Pavol Duris, Zvi Galil
    A Time-Space Tradeoff for Language Recognition. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1984, v:17, n:1, pp:3-12 [Journal]
  136. Zvi Galil
    Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:10, n:, pp:211-228 [Journal]
  137. Arnold L. Rosenberg, Derick Wood, Zvi Galil
    Storage Representations for Tree-Like Data Structures. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:13, n:, pp:105-130 [Journal]
  138. Joel I. Seiferas, Zvi Galil
    Real-Time Recognition of Substring Repetition and Reversal. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:11, n:, pp:111-146 [Journal]
  139. Amir M. Ben-Amram, Zvi Galil
    Topological Lower Bounds on Algebraic Random Access Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:722-761 [Journal]
  140. Dany Breslauer, Zvi Galil
    An Optimal O(log log n) Time Parallel String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1051-1058 [Journal]
  141. Dany Breslauer, Zvi Galil
    A Lower Bound for Parallel String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:856-862 [Journal]
  142. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
    Constant-Time Randomized Parallel String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:950-960 [Journal]
  143. Pavol Duris, Zvi Galil
    Two Tapes are Better than One for Nondeterministic Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:219-227 [Journal]
  144. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator-Based Sparsification II: Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:341-381 [Journal]
  145. Zvi Galil
    On Resolution with Clauses of Bounded Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:444-459 [Journal]
  146. Zvi Galil
    Finding the Vertex Connectivity of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:197-199 [Journal]
  147. Zvi Galil, Raffaele Giancarlo
    On the Exact Complexity of String Matching: Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1008-1020 [Journal]
  148. Zvi Galil, Raffaele Giancarlo
    On the Exact Complexity of String Matching: Upper Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:407-437 [Journal]
  149. Zvi Galil, Stuart Haber, Moti Yung
    Minimum-Knowledge Interactive Proofs for Decision Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:711-739 [Journal]
  150. Zvi Galil, Giuseppe F. Italiano
    Fully Dynamic Algorithms for 2-Edge Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1047-1069 [Journal]
  151. Zvi Galil, Giuseppe F. Italiano
    Maintaining the 3-Edge-Connected Components of a Graph On-Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:11-28 [Journal]
  152. Zvi Galil, Oded Margalit
    An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1157-1189 [Journal]
  153. Zvi Galil, Silvio Micali, Harold N. Gabow
    An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:120-130 [Journal]
  154. Zvi Galil, Kunsoo Park
    An Improved Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:989-999 [Journal]
  155. Zvi Galil, Kunsoo Park
    Alphabet-Independent Two-Dimensional Witness Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:5, pp:907-935 [Journal]
  156. Zvi Galil, Joel I. Seiferas
    Saving Space in Fast String-Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:417-438 [Journal]
  157. Zvi Galil, Jong Geun Park, Kunsoo Park
    Three-Dimensional Periodicity and Its Application to Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:2, pp:362-381 [Journal]
  158. Alberto Apostolico, Dany Breslauer, Zvi Galil
    Parallel Detection of all Palindromes in a String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:163-173 [Journal]
  159. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:17-56 [Journal]
  160. 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]/<u^n>. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:143-203 [Journal]
  161. Pavol Duris, Zvi Galil
    Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:39-53 [Journal]
  162. Zvi Galil
    On the Theoretical Efficiency of Various Network Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:103-111 [Journal]
  163. Zvi Galil, Raffaele Giancarlo
    Parallel String Matching with k Mismatches. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:341-348 [Journal]
  164. Zvi Galil, Raffaele Giancarlo
    Speeding up Dynamic Programming with Applications to Molecular Biology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:1, pp:107-118 [Journal]
  165. Zvi Galil, Gad M. Landau, Mordechai M. Yung
    Distributed Algorithms in Synchronous Broadcasting Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:49, n:, pp:171-184 [Journal]
  166. Zvi Galil, Nimrod Megiddo
    Cyclic Ordering is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:5, n:2, pp:179-182 [Journal]
  167. Zvi Galil, Kunsoo Park
    Dynamic Programming with Convexity, Concavity, and Sparsity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:49-76 [Journal]
  168. Zvi Galil, Joel I. Seiferas
    Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:331-336 [Journal]
  169. Yuval Rabani, Zvi Galil
    On the Space Complexity of Some Algorithms for Sequence Comparison. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:95, n:2, pp:231-244 [Journal]

  170. Old and New in Stringology. [Citation Graph (, )][DBLP]


  171. Monotone switching circuits and boolean matrix product. [Citation Graph (, )][DBLP]


  172. On finding most uniform spanning trees. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002