Children
Sign in to add trainee| Moti Yung | grad student | 1988 | Columbia |
| Jonathan Katz | grad student | 2002 | Columbia |
| Adam L. Young | grad student | 2002 | Columbia |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Galil Z, Park JG, Park K. (2005) Three-Dimensional Periodicity and Its Application to Pattern Matching Siam Journal On Discrete Mathematics. 18: 362-381 |
| Cole R, Galil Z, Hariharan R, et al. (2004) Parallel two dimensional witness computation Information & Computation. 188: 20-67 |
| Ben-Amram AM, Galil Z. (2002) Topological Lower Bounds on Algebraic Random Access Machines Siam Journal On Computing. 31: 722-761 |
| Ben-Amram AM, Galil Z. (2001) A Generalization of a Lower Bound Technique due to Fredman and Saks Algorithmica. 30: 34-66 |
| Galil Z, Italiano GF, Sarnak N. (1999) Fully dynamic planarity testing with applications Journal of the Acm. 46: 28-91 |
| Eppstein D, Galil Z, Italiano GF, et al. (1999) Separator-Based Sparsification II: Edge and Vertex Connectivity Siam Journal On Computing. 28: 341-381 |
| Crochemore M, Galil Z, Gasieniec L, et al. (1997) Constant-Time Randomized Parallel String Matching Siam Journal On Computing. 26: 950-960 |
| Galil Z, Margalit O. (1997) All pairs shortest distances for graphs with small integer length edges Information & Computation. 134: 103-139 |
| Galil Z, Park K. (1996) Alphabet-Independent Two-Dimensional Witness Computation Siam Journal On Computing. 25: 907-935 |
| Eppstein D, Galil Z, Italiano GF, et al. (1996) Separator based sparsification: I. Planarity testing and minimum spanning trees Journal of Computer and System Sciences. 52: 3-27 |