An o (log n) parallel connectivityalgorithm YSU Vishkin, Y Shiloach J. algorithms 3, 57-67, 1982 | 857 | 1982 |
On finding lowest common ancestors: Simplification and parallelization B Schieber, U Vishkin SIAM Journal on Computing 17 (6), 1253-1262, 1988 | 746 | 1988 |
An efficient parallel biconnectivity algorithm RE Tarjan, U Vishkin SIAM Journal on Computing 14 (4), 862-874, 1985 | 658 | 1985 |
Deterministic coin tossing with applications to optimal parallel list ranking R Cole, U Vishkin Information and Control 70 (1), 32-53, 1986 | 535 | 1986 |
Fast parallel and serial approximate string matching GM Landau, U Vishkin Journal of algorithms 10 (2), 157-169, 1989 | 458 | 1989 |
Constant depth reducibility AK Chandra, L Stockmeyer, U Vishkin SIAM Journal on Computing 13 (2), 423-439, 1984 | 423 | 1984 |
Finding the maximum, merging and sorting in a parallel computation model Y Shiloach, U Vishkin Conpar 81: Conference on Analysing Problem Classes and Programming for …, 1981 | 398 | 1981 |
Biconnectivity approximations and graph carvings S Khuller, U Vishkin Journal of the ACM (JACM) 41 (2), 214-235, 1994 | 336 | 1994 |
Finding biconnected componemts and computing tree functions in logarithmic parallel time RE Tarjan, U Vishkin 25th Annual Symposium onFoundations of Computer Science, 1984., 12-20, 1984 | 321 | 1984 |
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories K Mehlhorn, U Vishkin Acta Informatica 21, 339-374, 1984 | 319 | 1984 |
Faster optimal parallel prefix sums and list ranking R Cole, U Vishkin Information and computation 81 (3), 334-352, 1989 | 300 | 1989 |
Fast string matching with k differences GM Landau, U Vishkin Journal of Computer and System Sciences 37 (1), 63-78, 1988 | 287 | 1988 |
Approximate and exact parallel scheduling with applications to list, tree and graph problems R Cole, U Vishkin 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 478-491, 1986 | 280 | 1986 |
Simulation of parallel random access machines by circuits L Stockmeyer, U Vishkin SIAM Journal on Computing 13 (2), 409-422, 1984 | 275 | 1984 |
Efficient string matching with k mismatches GM Landau, U Vishkin Theoretical Computer Science 43, 239-249, 1986 | 253 | 1986 |
An O (n2log n) parallel max-flow algorithm Y Shiloach, U Vishkin Journal of Algorithms 3 (2), 128-146, 1982 | 252 | 1982 |
Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time R Cole, U Vishkin SIAM Journal on Computing 17 (1), 128-142, 1988 | 244 | 1988 |
Recursive star-tree parallel data structure O Berkman, U Vishkin SIAM Journal on Computing 22 (2), 221-242, 1993 | 239 | 1993 |
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms R Cole, U Vishkin Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 239 | 1986 |
Parallel construction of a suffix tree with applications A Apostolico, C Iliopoulos, GM Landau, B Schieber, U Vishkin Algorithmica 3, 347-365, 1988 | 213 | 1988 |