Zvi Galil - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 193

2022

Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label DistributionsGeonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han. icde 2022: 872-884 [doi]

Creating a revolutionary academic programUmakishore Ramachandran, Zvi Galil. CACM, 65(10):46-56, 2022. [doi]

2021

Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate SpaceGeonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe F. Italiano, Wook-Shin Han. icde 2021: 1368-1379 [doi]

2020

OMSCS: the revolution will be digitizedZvi Galil. CACM, 63(8):27-29, 2020. [doi]

2016

40 years of suffix treesAlberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan. CACM, 59(4):66-73, 2016. [doi]

2014

Real-Time Streaming String-MatchingDany Breslauer, Zvi Galil. TALG, 10(4):22, 2014. [doi]

2013

Forty Years of Text IndexingAlberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan. cpm 2013: 1-10 [doi]

2011

Real-Time Streaming String-MatchingDany Breslauer, Zvi Galil. cpm 2011: 162-172 [doi]

2010

Old and New in StringologyZvi Galil. cpm 2010: 26 [doi]

2004

Parallel two dimensional witness computationRichard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park. iandc, 188(1):20-67, 2004. [doi]

Three-Dimensional Periodicity and Its Application to Pattern MatchingZvi Galil, Jong Geun Park, Kunsoo Park. siamdm, 18(2):362-381, 2004. [doi]

2002

Lower Bounds for Dynamic Data Structures on Algebraic RAMsAmir M. Ben-Amram, Zvi Galil. algorithmica, 32(3):364-395, 2002. [doi]

2001

A Generalization of a Lower Bound Technique due to Fredman and SaksAmir M. Ben-Amram, Zvi Galil. algorithmica, 30(1):34-66, 2001. [doi]

Topological Lower Bounds on Algebraic Random Access MachinesAmir M. Ben-Amram, Zvi Galil. SICOMP, 31(3):722-761, 2001. [doi]

2000

Eavesdropping games: a graph-theoretic approach to privacy in distributed systemsMatthew K. Franklin, Zvi Galil, Moti Yung. JACM, 47(2):225-243, 2000. [doi]

1999

Dynamic Graph AlgorithmsDavid Eppstein, Zvi Galil, Giuseppe F. Italiano. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

Fully Dynamic Planarity Testing with ApplicationsZvi Galil, Giuseppe F. Italiano, Neil Sarnak. JACM, 46(1):28-91, 1999. [doi]

1998

Separator-Based Sparsification II: Edge and Vertex ConnectivityDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer. SICOMP, 28(1):341-381, 1998.

1997

On the Exponent of the All Pairs Shortest Path ProblemNoga Alon, Zvi Galil, Oded Margalit. jcss, 54(2):255-262, 1997.

Constant-Time Randomized Parallel String MatchingMaxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter. SICOMP, 26(4):950-960, 1997.

Sparsification - a technique for speeding up dynamic graph algorithmsDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig. JACM, 44(5):669-696, 1997. [doi]

Off-line parallel exact string searchingZvi Galil, I. Yudkiewicz. In Alberto Apostolico, Zvi Galil, editors, Pattern Matching Algorithms. pages 55-88, Oxford University Press, 1997.

Open Problems In Stringology, Thirteen years LaterZvi Galil. sequences 1997: 347 [doi]

All Pairs Shortest Distances for Graphs with Small Integer Length EdgesZvi Galil, Oded Margalit. iandc, 134(2):103-139, 1997.

All Pairs Shortest Paths for Graphs with Small Integer Length EdgesZvi Galil, Oded Margalit. jcss, 54(2):243-254, 1997.

Three-Dimensional Pattern MatchingZvi Galil, Jong Geun Park, Kunsoo Park. spaa 1997: 53-62 [doi]

1996

Separator Based Sparsification. I. Planary Testing and Minimum Spanning TreesDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer. jcss, 52(1):3-27, 1996.

Alphabet-Independent Two-Dimensional Witness ComputationZvi Galil, Kunsoo Park. SICOMP, 25(5):907-935, 1996.

1995

Efficient Dynamic-Resharing Verifiable Secret Sharing Against Mobile AdversaryNoga Alon, Zvi Galil, Moti Yung. esa 1995: 523-537

Parallel Detection of all Palindromes in a StringAlberto Apostolico, Dany Breslauer, Zvi Galil. TCS, 141(1&2):163-173, 1995. [doi]

Lower Bounds on Algebraic Random Access Machines (Extended Abstract)Amir M. Ben-Amram, Zvi Galil. icalp 1995: 360-371

On Data Structure Tradeoffs and an Application to Union-FindAmir M. Ben-Amram, Zvi Galil. eccc, 2(62), 1995. [doi]

On the Power of the Shift InstructionAmir M. Ben-Amram, Zvi Galil. iandc, 117(1):19-36, February 1995.

Finding All Periods and Initial Palindromes of a String in ParallelDany Breslauer, Zvi Galil. algorithmica, 14(4):355-366, 1995.

Work-time-optimal parallel algorithms for string problemsArtur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski. stoc 1995: 713-722 [doi]

Sensing Versus Nonsensing AutomataPavol Duris, Zvi Galil. icalp 1995: 455-463

A Constant-Time Optimal Parallel String-Matching AlgorithmZvi Galil. JACM, 42(4):908-918, 1995. [doi]

Short length versions of Menger s theorem (Extended Abstract)Zvi Galil, Xiangdong Yu. stoc 1995: 499-508 [doi]

Resolving Message Complexity of Byzantine Agreement and beyondZvi Galil, Alain J. Mayer, Moti Yung. focs 1995: 724-733

1994

Dynamic Dictionary MatchingAmihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park. jcss, 49(2):208-222, 1994.

Parallel Detection of all Palindromes in a StringAlberto Apostolico, Dany Breslauer, Zvi Galil. STACS 1994: 497-506

Faster Tree Pattern MatchingMoshe Dubiner, Zvi Galil, Edith Magen. JACM, 41(2):205-213, 1994. [doi]

Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) DependencyZvi Galil, Kunsoo Park. jpdc, 21(2):213-222, 1994.

1993

When can we sort in o(n log n) time?Amir M. Ben-Amram, Zvi Galil. focs 1993: 538-546

Efficient Comparison Based String MatchingDany Breslauer, Zvi Galil. jc, 9(3):339-365, 1993. [doi]

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensionsRichard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter. focs 1993: 248-258

On the Power of Multiple Reads in a ChipPavol Duris, Zvi Galil. iandc, 104(2):277-287, June 1993.

Separator based sparsification for dynamic planar graph algorithmsDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer. stoc 1993: 208-217 [doi]

Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed SystemsMatthew K. Franklin, Zvi Galil, Moti Yung. focs 1993: 670-679

Witnesses for Boolean Matrix Multiplication and for Transitive ClosureZvi Galil, Oded Margalit. jc, 9(2):201-221, 1993. [doi]

Maintaining the 3-Edge-Connected Components of a Graph On-LineZvi Galil, Giuseppe F. Italiano. SICOMP, 22(1):11-28, 1993.

1992

Witnesses for Boolean Matrix Multiplication and for Shortest PathsNoga Alon, Zvi Galil, Oded Margalit, Moni Naor. focs 1992: 417-426

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)Alberto Apostolico, Dany Breslauer, Zvi Galil. icalp 1992: 296-307

On Pointers versus AddressesAmir M. Ben-Amram, Zvi Galil. JACM, 39(3):617-648, 1992. [doi]

A Lower Bound for Parallel String MatchingDany Breslauer, Zvi Galil. SICOMP, 21(5):856-862, 1992.

Sparse Dynamic Programming II: Convex and Concave Cost FunctionsDavid Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano. JACM, 39(3):546-567, 1992. [doi]

Sparse Dynamic Programming I: Linear Cost FunctionsDavid Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano. JACM, 39(3):519-545, 1992. [doi]

Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig. focs 1992: 60-69

A Constant-Time Optimal Parallel String-Matching AlgorithmZvi Galil. stoc 1992: 69-76

Renato CapocelliZvi Galil. sigact, 23(2):104, 1992. [doi]

Fully Dynamic Planarity Testing (Extended Abstract)Zvi Galil, Giuseppe F. Italiano, Neil Sarnak. stoc 1992: 495-506

Fully Dynamic Algorithms for 2-Edge ConnectivityZvi Galil, Giuseppe F. Italiano. SICOMP, 21(6):1047-1069, 1992.

On the Exact Complexity of String Matching: Upper BoundsZvi Galil, Raffaele Giancarlo. SICOMP, 21(3):407-437, 1992.

Dynamic Programming with Convexity, Concavity, and SparsityZvi Galil, Kunsoo Park. TCS, 92(1):49-76, 1992.

Truly Alphabet-Independent Two-Dimensional Pattern MatchingZvi Galil, Kunsoo Park. focs 1992: 247-256

On the Space Complexity of Some Algorithms for Sequence ComparisonYuval Rabani, Zvi Galil. TCS, 95(2):231-244, 1992.

1991

On the Exponent of the All Pairs Shortest Path ProblemNoga Alon, Zvi Galil, Oded Margalit. focs 1991: 569-575

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>Amir Averbuch, Zvi Galil, Shmuel Winograd. TCS, 86(2):143-203, 1991.

Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)Amir M. Ben-Amram, Zvi Galil. focs 1991: 622-631

A Lower Bound for Parallel String MatchingDany Breslauer, Zvi Galil. stoc 1991: 439-443

Two Lower Bounds in Asynchronous Distributed ComputationPavol Duris, Zvi Galil. jcss, 42(3):254-266, 1991.

On the Power of Multiple Reads in a ChipPavol Duris, Zvi Galil. icalp 1991: 697-706

An Almost Linear-Time Algorithm for the Dense Subset-Sum ProblemZvi Galil, Oded Margalit. icalp 1991: 719-727

An Almost Linear-Time Algorithm for the Dense Subset-Sum ProblemZvi Galil, Oded Margalit. SICOMP, 20(6):1157-1189, 1991.

Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract)Zvi Galil, Giuseppe F. Italiano. stoc 1991: 317-327

Maintaining Biconnected Components of Dynamic Planar GraphsZvi Galil, Giuseppe F. Italiano. icalp 1991: 339-350

Reducing edge connectivity to vertex connectivityZvi Galil, Giuseppe F. Italiano. sigact, 22(1):57-61, 1991. [doi]

A Note on Set Union with Arbitrary DeunionsZvi Galil, Giuseppe F. Italiano. ipl, 37(6):331-335, 1991.

Data Structures and Algorithms for Disjoint Set Union ProblemsZvi Galil, Giuseppe F. Italiano. ACM Comput. Surv., 23(3):319-344, 1991.

On the Exact Complexity of String Matching: Lower BoundsZvi Galil, Raffaele Giancarlo. SICOMP, 20(6):1008-1020, 1991.

1990

1989

Highly Parallelizable Problems (Extended Abstract)Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin. stoc 1989: 309-319

Solving dense subset-sum problems by using analytical number theoryMark Chaimovich, Gregory Freiman, Zvi Galil. jc, 5(3):271-282, 1989. [doi]

Parallel Algorithmic Techniques for Combinatorial ComputationDavid Eppstein, Zvi Galil. icalp 1989: 304-318

Efficient implementation of graph algorithms using contractionHarold N. Gabow, Zvi Galil, Thomas H. Spencer. JACM, 36(3):540-572, 1989. [doi]

On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing MachinesZvi Galil, Ravi Kannan, Endre Szemerédi. jcss, 38(1):134-149, 1989.

On 3-pushdown graphs with large separatorsZvi Galil, Ravi Kannan, Endre Szemerédi. combinatorica, 9(1):9-19, 1989.

Minimum-Knowledge Interactive Proofs for Decision ProblemsZvi Galil, Stuart Haber, Moti Yung. SICOMP, 18(4):711-739, 1989.

Security against Replay Chosen-Ciphertext AttackZvi Galil, Stuart Haber, Moti Yung. dimacs 1991: 183-190

A Secure Public-key Authentication SchemeZvi Galil, Stuart Haber, Moti Yung. eurocrypt 1989: 3-15 [doi]

Speeding up Dynamic Programming with Applications to Molecular BiologyZvi Galil, Raffaele Giancarlo. TCS, 64(1):107-118, 1989.

Parallel Evaluation of the Determinant and of the Inverse of a MatrixZvi Galil, Victor Y. Pan. ipl, 30(1):41-45, 1989.

An Improved Algorithm for Approximate String MatchingZvi Galil, Kunsoo Park. icalp 1989: 394-404

Speech Recognition in ParallelSalvatore J. Stolfo, Zvi Galil, Kathleen McKeown, Russell Mills. naacl 1989: [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Zvi Galil'

Viewing Publication 1 - 100 from 193

2022

2021

2020

2016

2014

2013

2011

2010

2004

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Zvi Galil'

Viewing Publication 1 - 100 from 193

2022

2021

2020

2016

2014

2013

2011

2010

2004

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1