Uzi Vishkin
Uzi Vishkin
Professor, The University of Maryland Institute for Advanced Computer Studies (UMIACS) and
Verified email at umd.edu - Homepage
Title
Cited by
Cited by
Year
An O (log n) parallel connectivity algorithm
Y Shiloach, U Vishkin
Computer Science Department, Technion, 1980
7671980
On finding lowest common ancestors: Simplification and parallelization
B Schieber, U Vishkin
SIAM Journal on Computing 17 (6), 1253-1262, 1988
7001988
An efficient parallel biconnectivity algorithm
RE Tarjan, U Vishkin
SIAM Journal on Computing 14 (4), 862-874, 1985
6121985
Deterministic coin tossing with applications to optimal parallel list ranking
R Cole, U Vishkin
Information and Control 70 (1), 32-53, 1986
4711986
Fast parallel and serial approximate string matching
GM Landau, U Vishkin
Journal of algorithms 10 (2), 157-169, 1989
4271989
Constant depth reducibility
AK Chandra, L Stockmeyer, U Vishkin
SIAM Journal on Computing 13 (2), 423-439, 1984
3851984
Finding the maximum, merging and sorting in a parallel computation model
Y Shiloach, U Vishkin
International Conference on Parallel Processing, 314-327, 1981
3811981
Biconnectivity approximations and graph carvings
S Khuller, U Vishkin
Journal of the ACM (JACM) 41 (2), 214-235, 1994
3071994
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
K Mehlhorn, U Vishkin
Acta Informatica 21 (4), 339-374, 1984
2971984
Faster optimal parallel prefix sums and list ranking
R Cole, U Vishkin
Information and computation 81 (3), 334-352, 1989
2911989
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
2831984
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
2601986
Simulation of parallel random access machines by circuits
L Stockmeyer, U Vishkin
SIAM Journal on Computing 13 (2), 409-422, 1984
2411984
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
2371988
Fast string matching with k differences
GM Landau, U Vishkin
Journal of Computer and System Sciences 37 (1), 63-78, 1988
2341988
Efficient string matching with k mismatches
GM Landau, U Vishkin
Theoretical Computer Science 43, 239-249, 1986
2311986
An O (n2log n) parallel max-flow algorithm
Y Shiloach, U Vishkin
Journal of Algorithms 3 (2), 128-146, 1982
2271982
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
2261986
Recursive star-tree parallel data structure
O Berkman, U Vishkin
SIAM Journal on Computing 22 (2), 221-242, 1993
2191993
Parallel construction of a suffix tree with applications
A Apostolico, C Iliopoulos, GM Landau, B Schieber, U Vishkin
Algorithmica 3 (1), 347-365, 1988
2011988
The system can't perform the operation now. Try again later.
Articles 1–20