361 results on '"Zvi Galil"'
Search Results
2. Creating a revolutionary academic program.
3. Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space.
4. OMSCS: the revolution will be digitized.
5. 40 years of suffix trees.
6. Forty Years of Text Indexing.
7. Real-Time Streaming String-Matching.
8. Real-Time Streaming String-Matching.
9. Three-Dimensional Pattern Matching.
10. Lower Bounds on Algebraic Random Access Machines (Extended Abstract).
11. Sensing Versus Nonsensing Automata.
12. Resolving Message Complexity of Byzantine Agreement and beyond.
13. Work-time-optimal parallel algorithms for string problems.
14. Short length versions of Menger's theorem (Extended Abstract).
15. Efficient Dynamic-Resharing 'Verifiable Secret Sharing' Against Mobile Adversary.
16. Parallel Detection of all Palindromes in a String.
17. Parallel two dimensional witness computation.
18. Three-Dimensional Periodicity and Its Application to Pattern Matching.
19. When can we sort in o(n log n) time?
20. Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems
21. Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
22. Separator based sparsification for dynamic planar graph algorithms.
23. Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract).
24. Witnesses for Boolean Matrix Multiplication and for Shortest Paths
25. Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)
26. Truly Alphabet-Independent Two-Dimensional Pattern Matching
27. A Constant-Time Optimal Parallel String-Matching Algorithm
28. Fully Dynamic Planarity Testing (Extended Abstract)
29. Lower Bounds for Dynamic Data Structures on Algebraic RAMs.
30. On the Power of Multiple Reads in a Chip.
31. An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.
32. Maintaining Biconnected Components of Dynamic Planar Graphs.
33. On the Exponent of the All Pairs Shortest Path Problem
34. Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)
35. A Lower Bound for Parallel String Matching
36. Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract)
37. A Generalization of a Lower Bound Technique due to Fredman and Saks.
38. Topological Lower Bounds on Algebraic Random Access Machines.
39. On the Exact Complexity of String Matching (Extended Abstract)
40. Faster Tree Pattern Matching
41. Sparse Dynamic Programming.
42. Eavesdropping games: a graph-theoretic approach to privacy in distributed systems.
43. Fully Dynamic Planarity Testing with Applications.
44. Separator-Based Sparsification II: Edge and Vertex Connectivity.
45. On the Exponent of the All Pairs Shortest Path Problem.
46. All Pairs Shortest Paths for Graphs with Small Integer Length Edges.
47. Sparsification - a technique for speeding up dynamic graph algorithms.
48. All Pairs Shortest Distances for Graphs with Small Integer Length Edges.
49. Constant-Time Randomized Parallel String Matching.
50. Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.