Searching for authors named Zvi Galil – sorted by Relevance.
-
SUMMARY OF RESULTS
- 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)
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- An Overview of Secure Distributed Computing Matthew Franklin 3 Columbia University Zvi Galil
- Cited by 17 (1 self) – Add To MetaCart

