The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Uzi Vishkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yossi Shiloach, Uzi Vishkin
    An O(log n) Parallel Connectivity Algorithm. [Citation Graph (3, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:1, pp:57-67 [Journal]
  2. Robert Endre Tarjan, Uzi Vishkin
    Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) [Citation Graph (1, 0)][DBLP]
    FOCS, 1984, pp:12-20 [Conf]
  3. Richard Cole, Uzi Vishkin
    Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms [Citation Graph (1, 0)][DBLP]
    STOC, 1986, pp:206-219 [Conf]
  4. Gad M. Landau, Uzi Vishkin
    Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm [Citation Graph (1, 0)][DBLP]
    STOC, 1986, pp:220-230 [Conf]
  5. Uzi Vishkin
    Randomized Speed-Ups in Parallel Computation [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:230-239 [Conf]
  6. Gad M. Landau, Uzi Vishkin
    Fast Parallel and Serial Approximate String Matching. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:157-169 [Journal]
  7. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    Constant Depth Reducibility. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:423-439 [Journal]
  8. Baruch Schieber, Uzi Vishkin
    On Finding Lowest Common Ancestors: Simplification and Parallelization. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1253-1262 [Journal]
  9. Larry J. Stockmeyer, Uzi Vishkin
    Simulation of Parallel Random Access Machines by Circuits. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:409-422 [Journal]
  10. Aydin O. Balkan, Gang Qu, Uzi Vishkin
    A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing. [Citation Graph (0, 0)][DBLP]
    ASAP, 2006, pp:73-80 [Conf]
  11. Richard Cole, Uzi Vishkin
    Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:91-100 [Conf]
  12. Yael Maon, Baruch Schieber, Uzi Vishkin
    Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:34-45 [Conf]
  13. Vijaya Ramachandran, Uzi Vishkin
    Efficient Parallel Triconnectivity in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:33-42 [Conf]
  14. Baruch Schieber, Uzi Vishkin
    On Finding Lowest Common Ancestors: Simplification and Parallelization. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:111-123 [Conf]
  15. Süleyman Cenk Sahinalp, Uzi Vishkin
    On a Parallel-Algorithms Method for String Matching Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:22-32 [Conf]
  16. Yossi Shiloach, Uzi Vishkin
    Finding the maximum, merging and sorting in a parallel computation model. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1981, pp:314-327 [Conf]
  17. Gad M. Landau, Uzi Vishkin
    Two Dimensional Pattern Matching in a Digitized Image. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:134-151 [Conf]
  18. Uzi Vishkin
    What to Do with All this Hardware? (Invited Lecture). [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:50- [Conf]
  19. Uzi Vishkin
    On a Technique for Parsing a String (Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:386- [Conf]
  20. Noga Alon, Yossi Azar, Uzi Vishkin
    Tight Complexity Bounds for Parallel Comparison Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:502-510 [Conf]
  21. Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
    Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:871-881 [Conf]
  22. Omer Berkman, Uzi Vishkin
    Recursive *-Tree Parallel Data-Structure (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:196-202 [Conf]
  23. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    A Complexity Theory for Unbounded Fan-In Parallelism [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:1-13 [Conf]
  24. Richard Cole, Uzi Vishkin
    Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:478-491 [Conf]
  25. Joseph Gil, Yossi Matias, Uzi Vishkin
    Towards a Theory of Nearly Constant Time Parallel Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:698-710 [Conf]
  26. Gad M. Landau, Uzi Vishkin
    Efficient String Matching in the Presence of Errors [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:126-136 [Conf]
  27. Süleyman Cenk Sahinalp, Uzi Vishkin
    Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:320-328 [Conf]
  28. Uzi Vishkin, Avi Wigderson
    Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:146-153 [Conf]
  29. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
    Evaluating the XMT Parallel Programming Model. [Citation Graph (0, 0)][DBLP]
    HIPS, 2001, pp:95-108 [Conf]
  30. Gad M. Landau, Baruch Schieber, Uzi Vishkin
    Parallel Construction of a Suffix Tree (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:314-325 [Conf]
  31. Yossi Matias, Uzi Vishkin
    On Parallel Hashing and Integer Sorting (Extended Summary). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:729-743 [Conf]
  32. Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
    Parallel Dictionaries in 2-3 Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:597-609 [Conf]
  33. Uzi Vishkin
    Optimal Parallel Pattern Matching in Strings (Extended Summary). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:497-508 [Conf]
  34. Uzi Vishkin
    Strutural Parallel Algorithmics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:363-380 [Conf]
  35. Samir Khuller, Uzi Vishkin, Neal E. Young
    A primal-dual parallel approximation technique applied to weighted set and vertex cover. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:333-341 [Conf]
  36. Michael T. Goodrich, Yossi Matias, Uzi Vishkin
    Approximate Parallel Prefix Computation and its Applications. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:318-325 [Conf]
  37. Joseph JáJá, Kwan Woo Ryu, Uzi Vishkin
    Sorting Strings and Constructing Digital Search Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:349-356 [Conf]
  38. Fang Liu, Uzi Vishkin, Stuart Milner
    Bootstrapping Free-Space Optical Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  39. Yossi Matias, Uzi Vishkin
    A note on reducing parallel model simulations to integer sorting. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:208-212 [Conf]
  40. Silvia M. Müller, Uzi Vishkin
    Conflict-Free Access to Multiple Single-Ported Register Files. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:672-678 [Conf]
  41. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
    Evaluating the XMT Parallel Programming Model. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:105- [Conf]
  42. Rajeev Raman, Uzi Vishkin
    Parallel algorithms for database operations and a database operation for parallel algorithms. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:173-0 [Conf]
  43. Uzi Vishkin
    Can Parallel Algorithms Enhance Serial Implementation? [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:376-385 [Conf]
  44. Omer Berkman, Yossi Matias, Uzi Vishkin
    Randomized Range-Maxima inNearly-Constant Parallel Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:135-144 [Conf]
  45. Uzi Vishkin
    Methods in Parallel Algorithmics and Who May Need to Know Them? [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:1-5 [Conf]
  46. Aydin O. Balkan, Gang Qu, Uzi Vishkin
    Arbitrate-and-move primitives for high throughput on-chip interconnection networks. [Citation Graph (0, 0)][DBLP]
    ISCAS (2), 2004, pp:441-444 [Conf]
  47. Uzi Vishkin
    PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:104-105 [Conf]
  48. Uzi Vishkin
    Methods in Parallel Algorithmics (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:81- [Conf]
  49. Uzi Vishkin
    A Case for the PRAM As a Standard Programmer's Model. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:11-19 [Conf]
  50. Amihood Amir, Gad M. Landau, Uzi Vishkin
    Efficient Pattern Matching with Scaling. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:344-357 [Conf]
  51. Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin
    Communication complexity of document exchange. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:197-206 [Conf]
  52. Michael T. Goodrich, Yossi Matias, Uzi Vishkin
    Optimal Parallel Approximation for Prefix Sums and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:241-250 [Conf]
  53. Gad M. Landau, Uzi Vishkin
    Pattern Matching in a Digitized Image. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:453-462 [Conf]
  54. Rajeev Raman, Uzi Vishkin
    Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:613-621 [Conf]
  55. Shay Kutten, David Peleg, Uzi Vishkin
    Deterministic resource discovery in distributed networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:77-83 [Conf]
  56. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
    Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:93-102 [Conf]
  57. Uzi Vishkin
    A no-busy-wait balanced tree parallel algorithmic paradigm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:147-155 [Conf]
  58. Uzi Vishkin
    Two techniques for reconciling algorithm parallelism with memory constraints. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:95-98 [Conf]
  59. Uzi Vishkin
    From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:260-271 [Conf]
  60. Uzi Vishkin, Shlomit Dascal, Efraim Berkovich, Joseph Nuzman
    Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:140-151 [Conf]
  61. Uzi Vishkin
    A PRAM-on-Chip Vision (invited abstract). [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:260- [Conf]
  62. Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
    Highly Parallelizable Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:309-319 [Conf]
  63. Samir Khuller, Uzi Vishkin
    Biconnectivity Approximations and Graph Carvings [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:759-770 [Conf]
  64. Yishay Mansour, Noam Nisan, Uzi Vishkin
    Trade-offs between communication throughput and parallel time. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:372-381 [Conf]
  65. Yossi Matias, Uzi Vishkin
    Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:307-316 [Conf]
  66. Süleyman Cenk Sahinalp, Uzi Vishkin
    Symmetry breaking for suffix tree construction. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:300-309 [Conf]
  67. Uzi Vishkin
    Deterministic Sampling-A New Technique for Fast Pattern Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:170-180 [Conf]
  68. Shlomit Dascal, Uzi Vishkin
    Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:43-59 [Conf]
  69. Kurt Mehlhorn, Uzi Vishkin
    Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:339-374 [Journal]
  70. Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
    Parallel Construction of a Suffix Tree with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:347-365 [Journal]
  71. Richard Cole, Uzi Vishkin
    The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:329-346 [Journal]
  72. Gad M. Landau, Uzi Vishkin
    Pattern Matching in a Digitized Image. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:375-408 [Journal]
  73. Gad M. Landau, Uzi Vishkin, Ruth Nussinov
    Locating alignments with k differences for nucleotide and amino acid sequences. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1988, v:4, n:1, pp:19-24 [Journal]
  74. Uzi Vishkin
    Can Parallel Algorithms Enhance Seriel Implementation? [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1996, v:39, n:9, pp:88-91 [Journal]
  75. Omer Berkman, Yossi Matias, Uzi Vishkin
    Randomized Range-Maxima in Nearly-Constant Parallel Time. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:350-373 [Journal]
  76. Samir Khuller, Uzi Vishkin, Neal E. Young
    A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  77. Richard Cole, Uzi Vishkin
    On the Detection of Robust Curves. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1994, v:56, n:3, pp:189-204 [Journal]
  78. Omer Berkman, Uzi Vishkin
    Almost Fully-parallel Parentheses Matching. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:1, pp:11-28 [Journal]
  79. Omer Berkman, Uzi Vishkin
    On Parallel Integer Merging [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:106, n:2, pp:266-285 [Journal]
  80. Richard Cole, Uzi Vishkin
    Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:70, n:1, pp:32-53 [Journal]
  81. Richard Cole, Uzi Vishkin
    Faster Optimal Parallel Prefix Sums and List Ranking [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:334-352 [Journal]
  82. Richard Cole, Uzi Vishkin
    Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:1, pp:1-47 [Journal]
  83. Uzi Vishkin
    Optimal Parallel Pattern Matching in Strings [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:91-113 [Journal]
  84. Uzi Vishkin, Avi Wigderson
    Dynamic Parallel Memories [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:56, n:3, pp:174-182 [Journal]
  85. Omer Berkman, Baruch Schieber, Uzi Vishkin
    A fast parallel algorithm for finding the convex hull of a sorted point set. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:231-242 [Journal]
  86. Reuven Bar-Yehuda, Uzi Vishkin
    Complexity of Finding k-Path-Free Dominating Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:5, pp:228-232 [Journal]
  87. Samir Khuller, Uzi Vishkin
    On the Parallel Complexity of Digraph Reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:5, pp:239-241 [Journal]
  88. Uzi Vishkin
    On Efficient Parallel Strong Orientation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:5, pp:235-240 [Journal]
  89. Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
    Parallel Computation on 2-3-Trees. [Citation Graph (0, 0)][DBLP]
    ITA, 1983, v:17, n:4, pp:397-404 [Journal]
  90. Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin
    Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:459-473 [Journal]
  91. Samir Khuller, Uzi Vishkin
    Biconnectivity Approximations and Graph Carvings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:214-235 [Journal]
  92. Amihood Amir, Gad M. Landau, Uzi Vishkin
    Efficient Pattern Matching with Scaling. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:2-32 [Journal]
  93. Omer Berkman, Baruch Schieber, Uzi Vishkin
    Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:344-370 [Journal]
  94. Samir Khuller, Uzi Vishkin, Neal E. Young
    A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:280-289 [Journal]
  95. Yossi Matias, Uzi Vishkin
    On Parallel Hashing and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:573-606 [Journal]
  96. Yossi Shiloach, Uzi Vishkin
    Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:1, pp:88-102 [Journal]
  97. Yossi Shiloach, Uzi Vishkin
    An O(n² log n) Parallel MAX-FLOW Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:2, pp:128-146 [Journal]
  98. Uzi Vishkin
    Implementation of Simultaneous Memory Address Access in Models That Forbid It. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:1, pp:45-50 [Journal]
  99. Uzi Vishkin
    A Parallel Blocking Flow Algorithm for Acyclic Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:489-501 [Journal]
  100. Yishay Mansour, Noam Nisan, Uzi Vishkin
    Trade-offs between Communication Throughput and Parallel Time. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:1, pp:148-166 [Journal]
  101. Mikhail J. Atallah, Uzi Vishkin
    Finding Euler Tours in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:3, pp:330-337 [Journal]
  102. Omer Berkman, Uzi Vishkin
    Finding Level-Ancestors in Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:2, pp:214-230 [Journal]
  103. Gad M. Landau, Uzi Vishkin
    Fast String Matching with k Differences. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:63-78 [Journal]
  104. Shlomit Dascal, Uzi Vishkin
    Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:10- [Journal]
  105. Uzi Vishkin
    Randomized Parallel Speedups for List Ranking. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1987, v:4, n:3, pp:319-333 [Journal]
  106. Shay Kutten, David Peleg, Uzi Vishkin
    Deterministic Resource Discovery in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:479-495 [Journal]
  107. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
    Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:521-552 [Journal]
  108. Gad M. Landau, Uzi Vishkin, Ruth Nussinov
    An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 1986, v:14, n:1, pp:31-46 [Journal]
  109. Yossi Azar, Uzi Vishkin
    Tight Comparison Bounds on the Complexity of Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:458-464 [Journal]
  110. Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
    Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:449-465 [Journal]
  111. Omer Berkman, Uzi Vishkin
    Recursive Star-Tree Parallel Data Structure. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:221-242 [Journal]
  112. Richard Cole, Uzi Vishkin
    Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:128-142 [Journal]
  113. Robert Endre Tarjan, Uzi Vishkin
    An Efficient Parallel Biconnectivity Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:862-874 [Journal]
  114. Uzi Vishkin
    Deterministic Sampling - A New Technique for Fast Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:22-40 [Journal]
  115. Uzi Vishkin, Avi Wigderson
    Trade-Offs Between Depth and Width in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:303-314 [Journal]
  116. Tali Eilam-Tzoreff, Uzi Vishkin
    Matching Patterns in Strings Subject to Multi-Linear Transformations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:60, n:, pp:231-254 [Journal]
  117. Joseph JáJá, Kwan Woo Ryu, Uzi Vishkin
    Sorting Strings and Constructing Digital Search Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:225-245 [Journal]
  118. Gad M. Landau, Uzi Vishkin
    Efficient String Matching with k Mismatches. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:239-249 [Journal]
  119. Yael Maon, Baruch Schieber, Uzi Vishkin
    Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:277-298 [Journal]
  120. Nimrod Megiddo, Uzi Vishkin
    On Finding a Minimum Dominating Set in a Tournament. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:307-316 [Journal]
  121. Uzi Vishkin
    A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:157-172 [Journal]
  122. Uzi Vishkin
    An efficient distributed orientation algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:624-0 [Journal]
  123. Ilan Bar-On, Uzi Vishkin
    Optimal Parallel Generation of a Computation Tree Form. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1985, v:7, n:2, pp:348-357 [Journal]
  124. Xingzhi Wen, Uzi Vishkin
    PRAM-on-chip: first commitment to silicon. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:301-302 [Conf]
  125. Yossi Shiloach, Uzi Vishkin, Shmuel Zaks
    Golden ratios in a pairs covering problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:57-65 [Journal]

  126. Fpga-based prototype of a pram-on-chip processor. [Citation Graph (, )][DBLP]


  127. An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. [Citation Graph (, )][DBLP]


  128. Toward Realizing a PRAM-on-a-Chip Vision. [Citation Graph (, )][DBLP]


  129. HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? [Citation Graph (, )][DBLP]


  130. XMT-GPU: A PRAM Architecture for Graphics Computation. [Citation Graph (, )][DBLP]


  131. Resource-Aware Compiler Prefetching for Many-Cores. [Citation Graph (, )][DBLP]


  132. Lazy binary-splitting: a run-time adaptive work-stealing scheduler. [Citation Graph (, )][DBLP]


  133. Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience. [Citation Graph (, )][DBLP]


  134. Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. [Citation Graph (, )][DBLP]


  135. A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. [Citation Graph (, )][DBLP]


  136. Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002