AAAAAA
Results:
1-11
|
Results: 11
Authors:
JAJA JF
RYU KW
VISHKIN U
Citation: Jf. Jaja et al., SORTING STRINGS AND CONSTRUCTING DIGITAL SEARCH-TREES IN PARALLEL, Theoretical computer science, 154(2), 1996, pp. 225-245
Authors:
VISHKIN U
Citation: U. Vishkin, CAN PARALLEL ALGORITHMS ENHANCE SERIAL IMPLEMENTATION, Communications of the ACM, 39(9), 1996, pp. 88-91
Authors:
BERKMAN O
VISHKIN U
Citation: O. Berkman et U. Vishkin, ALMOST FULLY-PARALLEL PARENTHESES MATCHING, Discrete applied mathematics, 57(1), 1995, pp. 11-28
Authors:
COLE R
VISHKIN U
Citation: R. Cole et U. Vishkin, ON THE DETECTION OF ROBUST CURVES, CVGIP. Graphical models and image processing, 56(3), 1994, pp. 189-204
Authors:
KHULLER S
VISHKIN U
YOUNG N
Citation: S. Khuller et al., A PRIMAL-DUAL PARALLEL APPROXIMATION TECHNIQUE APPLIED TO WEIGHTED SET AND VERTEX COVERS, Journal of algorithms, 17(2), 1994, pp. 280-289
Authors:
LANDAU GM
VISHKIN U
Citation: Gm. Landau et U. Vishkin, PATTERN-MATCHING IN A DIGITIZED IMAGE, Algorithmica, 12(4-5), 1994, pp. 375-408
Authors:
BERKMAN O
JAJA J
KRISHNAMURTHY S
THURIMELLA R
VISHKIN U
Citation: O. Berkman et al., TOP-BOTTOM ROUTING AROUND A RECTANGLE IS AS EASY AS COMPUTING PREFIX MINIMA, SIAM journal on computing, 23(3), 1994, pp. 449-465
Authors:
BERKMAN O
VISHKIN U
Citation: O. Berkman et U. Vishkin, FINDING LEVEL-ANCESTORS IN TREES, Journal of computer and system sciences, 48(2), 1994, pp. 214-230
Authors:
KHULLER K
VISHKIN U
Citation: K. Khuller et U. Vishkin, ON THE PARALLEL COMPLEXITY OF DIGRAPH REACHABILITY, Information processing letters, 52(5), 1994, pp. 239-241
Authors:
KHULLER S
VISHKIN U
Citation: S. Khuller et U. Vishkin, BICONNECTIVITY APPROXIMATIONS AND GRAPH CARVINGS, Journal of the Association for Computing Machinery, 41(2), 1994, pp. 214-235
Authors:
BERKMAN O
VISHKIN U
Citation: O. Berkman et U. Vishkin, ON PARALLEL INTEGER MERGING, Information and computation, 106(2), 1993, pp. 266-285
Risultati:
1-11
|