MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Zvi Galil – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

28 documents found, showing 1 through 10. Next 10 →

ATOM

SUMMARY OF RESULTS
by Zvi Galil
… When can we sort in o(n log n) time? Amir M. Ben-Amram* Tel-Aviv University and Zvi Galil…
Add To MetaCart

(EXTENDED ABSTRACT)
by Zvi Galil, Xiangdong Yu
… Short Length Versions of Menger's Theorem Zvi Galil, Xiangdong Yu (EXTENDED ABSTRACT) SUMMARY…
Add To MetaCart

An optimal O(log log n) time parallel string matching algorithm
by Dany Breslauer, Zvi Galil — 1990 — SIAM J. COMPUT
… University Zvi Galil Columbia University and Tel-Aviv University March 1989 Work supported by NSF Grants…
Cited by 24 (10 self) – Add To MetaCart

Parallel Algorithmic Techniques for Combinatorial Computation
by David Eppstein, Zvi Galil — 1988 — Ann. Rev. Comput. Sci
…Parallel Algorithmic Techniques for Combinatorial Computation David Eppstein 1 Zvi Galil 1,2 1…
Cited by 30 (3 self) – Add To MetaCart

Finding All Periods and Initial Palindromes of a String in Parallel
by Dany Breslauer, Zvi Galil — 1991 —
… University Zvi Galil Columbia University and Tel-Aviv University CUCS-017-92 Abstract An optimal O(log log n…
Cited by 11 (9 self) – Add To MetaCart

Dynamic-Resharing Verifiable Secret Sharing against Mobile Adversary
by Noga Alon, Zvi Galil, Moti Yung — 1995 — 3-d European Symp. on Algorithms (ESA)'95. Lecture Notes in Computer Science
…Efficient Dynamic-Resharing “Verifiable Secret Sharing” Against Mobile Adversary Noga Alon ∗ Zvi…
Cited by 3 (2 self) – Add To MetaCart

Efficient Comparison Based String Matching
by Dany Breslauer, Zvi Galil, Dedicated Joseph, F. Traub — 1995
…Efficient Comparison Based String Matching Dany Breslauer CWI Zvi Galil y Columbia University…
Cited by 11 (3 self) – Add To MetaCart

Resolving Message Complexity of Byzantine Agreement and Beyond
by Zvi Galil, Alain Mayer, Moti Yung — 1995 — in Proc. 36th IEEE Symposium on Foundations of Computer Science
…Resolving Message Complexity of Byzantine Agreement and Beyond Zvi Galil Alain Mayer y Moti…
Cited by 29 (2 self) – Add To MetaCart

Maintaining Biconnected Components of Dynamic Planar Graphs
by Zvi Galil, Giuseppe F. Italiano — 1991 — Proc. 18th Int. Colloquium on Automata, Languages, and Programming
… Maintaining Biconnected Components of Dynamic Planar Graphs 3 Zvi Galil Columbia University…
Cited by 18 (1 self) – Add To MetaCart

An Overview of Secure Distributed Computing
by Matthew Franklin, Zvi Galil, Moti Yung — 1992 — In Proceedings of Sequences II, Methods in Communications, Security and Computer Science
… An Overview of Secure Distributed Computing Matthew Franklin 3 Columbia University Zvi Galil…
Cited by 17 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB