| Year |
Citation |
Score |
| 2005 |
Galil Z, Park JG, Park K. Three-Dimensional Periodicity and Its Application to Pattern Matching Siam Journal On Discrete Mathematics. 18: 362-381. DOI: 10.1137/S0895480101390308 |
0.303 |
|
| 2004 |
Cole R, Galil Z, Hariharan R, Muthukrishnan S, Park K. Parallel two dimensional witness computation Information & Computation. 188: 20-67. DOI: 10.1016/S0890-5401(03)00162-7 |
0.398 |
|
| 2002 |
Ben-Amram AM, Galil Z. Topological Lower Bounds on Algebraic Random Access Machines Siam Journal On Computing. 31: 722-761. DOI: 10.1137/S0097539797329397 |
0.368 |
|
| 2001 |
Ben-Amram AM, Galil Z. A Generalization of a Lower Bound Technique due to Fredman and Saks Algorithmica. 30: 34-66. DOI: 10.1007/S004530010077 |
0.338 |
|
| 1999 |
Galil Z, Italiano GF, Sarnak N. Fully dynamic planarity testing with applications Journal of the Acm. 46: 28-91. DOI: 10.1145/300515.300517 |
0.456 |
|
| 1999 |
Eppstein D, Galil Z, Italiano GF, Spencer TH. Separator-Based Sparsification II: Edge and Vertex Connectivity Siam Journal On Computing. 28: 341-381. DOI: 10.1137/S0097539794269072 |
0.437 |
|
| 1997 |
Crochemore M, Galil Z, Gasieniec L, Park K, Rytter W. Constant-Time Randomized Parallel String Matching Siam Journal On Computing. 26: 950-960. DOI: 10.1137/S009753979528007X |
0.521 |
|
| 1997 |
Galil Z, Margalit O. All pairs shortest distances for graphs with small integer length edges Information & Computation. 134: 103-139. DOI: 10.1006/Inco.1997.2620 |
0.516 |
|
| 1996 |
Galil Z, Park K. Alphabet-Independent Two-Dimensional Witness Computation Siam Journal On Computing. 25: 907-935. DOI: 10.1137/S0097539792241941 |
0.469 |
|
| 1996 |
Eppstein D, Galil Z, Italiano GF, Spencer TH. Separator based sparsification: I. Planarity testing and minimum spanning trees Journal of Computer and System Sciences. 52: 3-27. DOI: 10.1006/Jcss.1996.0002 |
0.484 |
|
| 1994 |
Dubiner M, Galil Z, Magen E. Faster tree pattern matching Journal of the Acm. 41: 205-213. DOI: 10.1145/174652.174653 |
0.444 |
|
| 1994 |
Amir A, Farach M, Galil Z, Giancarlo R, Park K. Dynamic dictionary matching Journal of Computer and System Sciences. 49: 208-222. DOI: 10.1016/S0022-0000(05)80047-9 |
0.33 |
|
| 1994 |
Galil Z, Park K. Parallel Algorithms for Dynamic Programming Recurrences with More Than O(1) Dependency Journal of Parallel and Distributed Computing. 21: 213-222. DOI: 10.1006/Jpdc.1994.1053 |
0.438 |
|
| 1993 |
Galil Z, Italiano GF. Maintaining the 3-edge-connected components of a graph on-line Siam Journal On Computing. 22: 11-28. DOI: 10.1137/0222002 |
0.375 |
|
| 1993 |
Galil Z, Margalit O. Witnesses for Boolean matrix multiplication and for transitive closure Journal of Complexity. 9: 201-221. DOI: 10.1006/Jcom.1993.1014 |
0.44 |
|
| 1993 |
Ďuriš P, Galil Z. On the power of multiple reads in a chip Information & Computation. 104: 277-287. DOI: 10.1006/Inco.1993.1034 |
0.303 |
|
| 1992 |
Galil Z, Italiano GF. Fully dynamic algorithms for 2-edge connectivity Siam Journal On Computing. 21: 1047-1069. DOI: 10.1137/0221062 |
0.475 |
|
| 1992 |
Rabani Y, Galil Z. On the space complexity of some algorithms for sequence comparison Theoretical Computer Science. 95: 231-244. DOI: 10.1016/0304-3975(92)90266-I |
0.426 |
|
| 1992 |
Breslauer D, Galil Z. Efficient comparison based string matching Journal of Complexity. 9: 339-365. DOI: 10.1006/Jcom.1993.1022 |
0.49 |
|
| 1991 |
Galil Z, Italiano GF. Reducing edge connectivity to vertex connectivity Sigact News. 22: 57-61. DOI: 10.1145/122413.122416 |
0.405 |
|
| 1991 |
Galil Z, Italiano GF. Data structures and algorithms for disjoint set union problems Acm Computing Surveys. 23: 319-344. DOI: 10.1145/116873.116878 |
0.42 |
|
| 1991 |
Galil Z, Giancarlo R. On the exact complexity of string matching: lower bounds Siam Journal On Computing. 20: 1008-1020. DOI: 10.1137/0220063 |
0.458 |
|
| 1991 |
Galil Z, Italiano GF. A note on set union with arbitrary deunions Information Processing Letters. 37: 331-335. DOI: 10.1016/0020-0190(91)90151-7 |
0.348 |
|
| 1990 |
Breslauer D, Galil Z. An optimal O (log n )time parallel string matching algorithm Siam Journal On Computing. 19: 1051-1058. DOI: 10.1137/0219072 |
0.447 |
|
| 1990 |
Galil Z, Park K. A linear-time algorithm for concave one-dimensional dynamic programming Information Processing Letters. 33: 309-311. DOI: 10.1016/0020-0190(90)90215-J |
0.387 |
|
| 1989 |
Gabow HN, Galil Z, Spencer TH. Efficient Implementation of Graph Algorithms Using Contraction Journal of the Acm (Jacm). 36: 540-572. DOI: 10.1145/65950.65954 |
0.497 |
|
| 1989 |
Galil Z, Haber S, Yung M. Minimum-knowledge interactive proofs for decision problems Siam Journal On Computing. 18: 711-739. DOI: 10.1137/0218049 |
0.495 |
|
| 1989 |
Chaimovich M, Freiman G, Galil Z. Solving dense subset-sum problems by using analytical number theory Journal of Complexity. 5: 271-282. DOI: 10.1016/0885-064X(89)90025-3 |
0.481 |
|
| 1989 |
Galil Z, Giancarlo R. Speeding up dynamic programming with application to molecular biology Theoretical Computer Science. 64: 107-118. DOI: 10.1016/0304-3975(89)90101-1 |
0.443 |
|
| 1989 |
Galil Z, Pan V. Parallel evaluation of the determinant and of the inverse of a matrix Information Processing Letters. 30: 41-45. DOI: 10.1016/0020-0190(89)90173-7 |
0.422 |
|
| 1989 |
Galil Z, Kannan R, Szemeredi E. On 3-pushdown graphs with large separators Combinatorica. 9: 9-19. DOI: 10.1007/Bf02122679 |
0.329 |
|
| 1988 |
Galil Z, Tardos É. An O (n 2 (m + N log n )log n ) min-cost flow algorithm Journal of the Acm. 35: 374-386. DOI: 10.1145/42282.214090 |
0.5 |
|
| 1988 |
Galil Z, Giancarlo R. Data structures and algorithms for approximate string matching Journal of Complexity. 4: 33-72. DOI: 10.1016/0885-064X(88)90008-8 |
0.431 |
|
| 1988 |
Averbuch A, Galil Z, Winograd S. Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, Part 1: the algebra GUue/ a Q(u)' a< Theoretical Computer Science. 58: 17-56. DOI: 10.1016/0304-3975(88)90017-5 |
0.395 |
|
| 1988 |
Galil Z, Schieber B. On finding most uniform spanning trees Discrete Applied Mathematics. 20: 173-175. DOI: 10.1016/0166-218X(88)90062-5 |
0.456 |
|
| 1988 |
Galil Z, Pan V. Improved processor bounds for combinatorial problems in RNC Combinatorica. 8: 189-200. DOI: 10.1007/Bf02122800 |
0.467 |
|
| 1987 |
Galil Z, Hoffmann CM, Luks EM, Schnorr CP, Weber A. An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs Journal of the Acm (Jacm). 34: 513-531. DOI: 10.1145/28869.28870 |
0.521 |
|
| 1987 |
Galil Z, Giancarlo R. Parallel string matching with k mismatches Theoretical Computer Science. 51: 341-348. DOI: 10.1016/0304-3975(87)90042-9 |
0.449 |
|
| 1987 |
Alon N, Galil Z, Milman VD. Better expanders and superconcentrators Journal of Algorithms. 8: 337-347. DOI: 10.1016/0196-6774(87)90014-9 |
0.302 |
|
| 1987 |
Galil Z, Yung M. Partitioned encryption and achieving simultaneity by partitioning Information Processing Letters. 26: 81-88. DOI: 10.1016/0020-0190(87)90042-1 |
0.5 |
|
| 1986 |
Galil Z, Micali S, Gabow H. An O (EV log V) algorithm for finding a maximal weighted matching in general graphs Siam Journal On Computing. 15: 120-130. DOI: 10.1137/0215009 |
0.467 |
|
| 1986 |
Galil Z. Optimal parallel algorithms for string matching Information & Computation. 67: 144-157. DOI: 10.1016/S0019-9958(85)80031-0 |
0.372 |
|
| 1986 |
Gabow HN, Galil Z, Spencer T, Tarjan RE. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs Combinatorica. 6: 109-122. DOI: 10.1007/Bf02579168 |
0.468 |
|
| 1983 |
Leven D, Galil Z. NP completeness of finding the chromatic index of regular graphs Journal of Algorithms. 4: 35-44. DOI: 10.1016/0196-6774(83)90032-9 |
0.303 |
|
| 1983 |
Galil Z, Seiferas J. Time-space-optimal string matching Journal of Computer and System Sciences. 26: 280-294. DOI: 10.1016/0022-0000(83)90002-8 |
0.474 |
|
| 1982 |
Galil Z. An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database Journal of the Acm. 29: 96-102. DOI: 10.1145/322290.322296 |
0.452 |
|
| 1982 |
Greenberg AC, Ladner RE, Paterson MS, Galil Z. Efficient parallel algorithms for linear recurrence computation Information Processing Letters. 15: 31-35. DOI: 10.1016/0020-0190(82)90081-3 |
0.433 |
|
| 1981 |
Galil Z, Seiferas J. Linear-time string-matching using only a fixed number of local storage locations Theoretical Computer Science. 13: 331-336. DOI: 10.1016/S0304-3975(81)80006-0 |
0.457 |
|
| 1981 |
Galil Z. On the theoretical efficiency of various network flow algorithms Theoretical Computer Science. 14: 103-111. DOI: 10.1016/0304-3975(81)90008-6 |
0.391 |
|
| 1980 |
Galil Z, Seiferas JI. Saving Space in Fast String-Matching Siam Journal On Computing. 9: 417-438. DOI: 10.1137/0209032 |
0.449 |
|
| 1980 |
Galil Z. Finding the Vertex Connectivity of Graphs Siam Journal On Computing. 9: 197-199. DOI: 10.1137/0209016 |
0.472 |
|
| 1980 |
Galil Z, Naamad A. An O(EVIog2V) algorithm for the maximal flow problem Journal of Computer and System Sciences. 21: 203-217. DOI: 10.1016/0022-0000(80)90035-5 |
0.465 |
|
| 1980 |
Galil Z. Applications of efficient mergeable heaps for optimization problems on trees Acta Informatica. 13: 53-58. DOI: 10.1007/Bf00288535 |
0.389 |
|
| 1980 |
Galil Z. An O(V5/3E2/3) algorithm for the maximal flow problem Acta Informatica. 14: 221-242. DOI: 10.1007/Bf00264254 |
0.429 |
|
| 1979 |
Megiddo N, Galil Z. On Fulkerson's Conjecture About Consistent Labeling Processes Mathematics of Operations Research. 4: 265-267. DOI: 10.1287/Moor.4.3.265 |
0.404 |
|
| 1979 |
Galil Z, Megiddo N. A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort Journal of the Acm. 26: 58-64. DOI: 10.1145/322108.322114 |
0.472 |
|
| 1978 |
Galil Z, Seiferas J. A Linear-Time On-Line Recognition Algorithm for “Palstar” Journal of the Acm (Jacm). 25: 102-111. DOI: 10.1145/322047.322056 |
0.42 |
|
| 1978 |
Galil Z. Killing two birds with one stone Sigact News. 10: 22-24. DOI: 10.1145/1008605.1008607 |
0.479 |
|
| 1978 |
Galil Z. Palindrome recognition in real time by a multitape turing machine Journal of Computer and System Sciences. 16: 140-157. DOI: 10.1016/0022-0000(78)90042-9 |
0.431 |
|
| 1977 |
Seiferas J, Galil Z. Real-time recognition of substring repetition and reversal Mathematical Systems Theory. 11: 111-146. DOI: 10.1007/Bf01768472 |
0.303 |
|
| Show low-probability matches. |