default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUzi Vishkin
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c95]Ananth Hari
, Uzi Vishkin:
Empirical Challenge for NC Theory (Abstract). HOPC@SPAA 2023: 19-20- [i4]Ananth Hari, Uzi Vishkin:
Empirical Challenge for NC Theory. CoRR abs/2305.13539 (2023) - 2022
- [j80]Uzi Vishkin:
On the model of computation: counterpoint. Commun. ACM 65(9): 32-34 (2022) - [c94]Uzi Vishkin:
Beyond worst-case analysis: observed low depth for a P-complete problem. PMAM@PPoPP 2022: 30-34 - [c93]Michael Ford, Ananth Hari, Oscar Rodriguez, Junyan Xu, Justin Lack, Cihan Oguz, Yu Zhang, Sarah Weber, Mary Magliocco, Jason Barnett, Sandhya Xirasagar, Smilee Samuel, Luisa Imberti, Paolo Bonfanti, Andrea Biondi, Clifton L. Dalgard, Stephen J. Chanock, Lindsey Rosen, Steven Holland, Helen Su, Luigi Notarangelo, Uzi Vishkin, Corey Watson, Süleyman Cenk Sahinalp:
ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes Using Short Read Data. RECOMB 2022: 382-384 - 2021
- [j79]James Alexander Edwards, Uzi Vishkin:
Study of Fine-grained Nested Parallelism in CDCL SAT Solvers. ACM Trans. Parallel Comput. 8(3): 17:1-17:18 (2021) - [c92]Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein:
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. NeurIPS 2021: 6695-6706 - [c91]Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick:
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. SPAA 2021: 1-7 - [i3]Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein:
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. CoRR abs/2106.04537 (2021)
2010 – 2019
- 2019
- [j78]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. J. Cryptol. 32(3): 941-972 (2019) - 2018
- [j77]Fady Ghanim, Uzi Vishkin, Rajeev Barua:
Easy PRAM-Based High-Performance Parallel Programming with ICE. IEEE Trans. Parallel Distributed Syst. 29(2): 377-390 (2018) - [c90]James Alexander Edwards, Uzi Vishkin:
Linking parallel algorithmic thinking to many-core memory systems and speedups for boosted decision trees. MEMSYS 2018: 161-168 - 2016
- [c89]Fady Ghanim, Rajeev Barua, Uzi Vishkin:
POSTER: Easy PRAM-based High-Performance Parallel Programming with ICE. PACT 2016: 419-420 - [c88]James Alexander Edwards, Uzi Vishkin:
FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algorithm on a Highly-Parallel Many Core. IPDPS Workshops 2016: 561-569 - 2015
- [c87]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. ASIACRYPT (1) 2015: 337-359 - [i2]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM. IACR Cryptol. ePrint Arch. 2015: 73 (2015) - 2014
- [j76]Uzi Vishkin:
Is multicore hardware for general-purpose parallel processing broken? Commun. ACM 57(4): 35-39 (2014) - [j75]James Alexander Edwards, Uzi Vishkin:
Parallel algorithms for Burrows-Wheeler compression and decompression. Theor. Comput. Sci. 525: 10-22 (2014) - [j74]Alexandros Tzannes, George C. Caragea, Uzi Vishkin, Rajeev Barua:
Lazy Scheduling: A Runtime Adaptive Scheduler for Declarative Parallelism. ACM Trans. Program. Lang. Syst. 36(3): 10:1-10:51 (2014) - 2013
- [c86]James Alexander Edwards, Uzi Vishkin:
Brief announcement: truly parallel burrows-wheeler compression and decompression. SPAA 2013: 93-96 - 2012
- [c85]James Alexander Edwards, Uzi Vishkin:
Better speedups using simpler parallel programming for graph connectivity and biconnectivity. PMAM 2012: 103-114 - [c84]James Alexander Edwards, Uzi Vishkin:
Brief announcement: speedups for parallel graph triconnectivity. SPAA 2012: 190-192 - 2011
- [j73]Uzi Vishkin:
Using simple abstraction to reinvent computing for parallelism. Commun. ACM 54(1): 75-85 (2011) - [j72]George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin:
Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores. Int. J. Parallel Program. 39(5): 615-638 (2011) - [j71]Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin:
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(4): 494-507 (2011) - [c83]Alexandros Tzannes, Rajeev Barua, Uzi Vishkin:
Improving Run-Time Scheduling for General-Purpose Parallel Code. PACT 2011: 216 - [c82]Fuat Keceli, Tali Moreshet, Uzi Vishkin:
Power-Performance Comparison of Single-Task Driven Many-Cores. ICPADS 2011: 348-355 - [c81]Yves Robert, William J. Dally, Jack J. Dongarra, Satoshi Matsuoka, Robert Schreiber, Horst D. Simon, Uzi Vishkin:
Panel Statement. IPDPS 2011: 505 - [c80]Fuat Keceli, Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin:
Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. IPDPS Workshops 2011: 1282-1291 - [c79]George Constantin Caragea, Uzi Vishkin:
Brief announcement: better speedups for parallel max-flow. SPAA 2011: 131-134 - 2010
- [c78]Fuat Keceli, Tali Moreshet, Uzi Vishkin:
Thermal Management of a Many-Core Processor under Fine-Grained Parallelism. Euro-Par Workshops (1) 2010: 249-259 - [c77]George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin:
Resource-Aware Compiler Prefetching for Many-Cores. ISPDC 2010: 133-140 - [c76]Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin:
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. NOCS 2010: 43-50 - [c75]Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin:
Lazy binary-splitting: a run-time adaptive work-stealing scheduler. PPoPP 2010: 179-190 - [c74]Shane Torbert, Uzi Vishkin, Ron Tzur, David J. Ellison:
Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience. SIGCSE 2010: 290-294
2000 – 2009
- 2009
- [j70]Aydin O. Balkan, Gang Qu, Uzi Vishkin:
Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism. IEEE Trans. Very Large Scale Integr. Syst. 17(10): 1419-1432 (2009) - [c73]Martti Forsell, H. Peter Hofstee, Ahmed Jerraya, Chris R. Jesshope, Uzi Vishkin, Jesper Larsson Träff:
HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? Euro-Par Workshops 2009: 9-15 - [c72]Uzi Vishkin:
Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? ICCD 2009: 60-63 - [c71]George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin:
Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. SPAA 2009: 163-165 - 2008
- [j69]Lorin Hochstein, Victor R. Basili, Uzi Vishkin, John Gilbert:
A pilot study to compare programming effort for two parallel programming models. J. Syst. Softw. 81(11): 1920-1930 (2008) - [c70]Xingzhi Wen, Uzi Vishkin:
Fpga-based prototype of a pram-on-chip processor. Conf. Computing Frontiers 2008: 55-66 - [c69]Aydin O. Balkan, Gang Qu, Uzi Vishkin:
An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. DAC 2008: 435-440 - [c68]Thomas M. DuBois, Bryant C. Lee, Yi Wang, Marc Olano, Uzi Vishkin:
XMT-GPU: A PRAM Architecture for Graphics Computation. ICPP 2008: 364-372 - 2007
- [c67]Uzi Vishkin:
Toward Realizing a PRAM-on-a-Chip Vision. Euro-Par Workshops 2007: 5-6 - [c66]Aydin O. Balkan, Michael N. Horak, Gang Qu, Uzi Vishkin:
Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing. Hot Interconnects 2007: 21-28 - [c65]Xingzhi Wen, Uzi Vishkin:
PRAM-on-chip: first commitment to silicon. SPAA 2007: 301-302 - [r1]Bryant C. Lee, Uzi Vishkin, George C. Caragea:
Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform. Handbook of Parallel Computing 2007 - 2006
- [j68]Stuart D. Milner, Jaime Llorca, Archana Anibha, Uzi Vishkin:
A bootstrapping model for directional wireless networks. IEEE Commun. Lett. 10(12): 840-842 (2006) - [j67]Pei Gu, Uzi Vishkin:
Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor. J. Embed. Comput. 2(2): 181-190 (2006) - [j66]Fang Liu, Uzi Vishkin, Stuart D. Milner:
Bootstrapping Free-Space Optical Networks. IEEE J. Sel. Areas Commun. 24(S-12): 13-22 (2006) - [c64]Aydin O. Balkan, Gang Qu, Uzi Vishkin:
A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing. ASAP 2006: 73-80 - [e1]Phillip B. Gibbons, Uzi Vishkin:
SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006. ACM 2006, ISBN 1-59593-452-9 [contents] - 2005
- [c63]Fang Liu, Uzi Vishkin, Stuart D. Milner:
Bootstrapping Free-Space Optical Networks. IPDPS 2005 - 2004
- [c62]Aydin O. Balkan, Gang Qu, Uzi Vishkin:
Arbitrate-and-move primitives for high throughput on-chip interconnection networks. ISCAS (2) 2004: 441-444 - [c61]Uzi Vishkin:
PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. MFCS 2004: 104-105 - 2003
- [j65]Shay Kutten, David Peleg, Uzi Vishkin:
Deterministic Resource Discovery in Distributed Networks. Theory Comput. Syst. 36(5): 479-495 (2003) - [j64]Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin:
Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach. Theory Comput. Syst. 36(5): 521-552 (2003) - 2002
- [c60]Uzi Vishkin:
Two techniques for reconciling algorithm parallelism with memory constraints. SPAA 2002: 95-98 - [i1]Samir Khuller, Uzi Vishkin, Neal E. Young:
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover. CoRR cs.DS/0205037 (2002) - 2001
- [c59]Uzi Vishkin:
What to Do with All this Hardware? (Invited Lecture). CPM 2001: 50 - [c58]Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin:
Evaluating the XMT Parallel Programming Model. HIPS 2001: 95-108 - [c57]Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin:
Evaluating the XMT Parallel Programming Model. IPDPS 2001: 105 - [c56]Shay Kutten, David Peleg, Uzi Vishkin:
Deterministic resource discovery in distributed networks. SPAA 2001: 77-83 - [c55]Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin:
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. SPAA 2001: 93-102 - 2000
- [j63]Shlomit Dascal, Uzi Vishkin:
Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. ACM J. Exp. Algorithmics 5: 10 (2000) - [c54]Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin:
Communication complexity of document exchange. SODA 2000: 197-206 - [c53]Uzi Vishkin:
A no-busy-wait balanced tree parallel algorithmic paradigm. SPAA 2000: 147-155 - [c52]Uzi Vishkin:
A PRAM-on-Chip Vision (invited abstract). SPIRE 2000: 260
1990 – 1999
- 1999
- [j62]Yishay Mansour, Noam Nisan, Uzi Vishkin:
Trade-offs between Communication Throughput and Parallel Time. J. Complex. 15(1): 148-166 (1999) - [c51]Shlomit Dascal, Uzi Vishkin:
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. WAE 1999: 43-59 - 1998
- [c50]Uzi Vishkin, Shlomit Dascal, Efraim Berkovich, Joseph Nuzman:
Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract). SPAA 1998: 140-151 - 1997
- [c49]Silvia M. Müller, Uzi Vishkin:
Conflict-Free Access to Multiple Single-Ported Register Files. IPPS 1997: 672-678 - [c48]Uzi Vishkin:
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. SPAA 1997: 260-271 - [p1]Gad M. Landau, Uzi Vishkin:
Approximate string searching. Pattern Matching Algorithms 1997: 185-199 - 1996
- [j61]Uzi Vishkin:
Can Parallel Algorithms Enhance Seriel Implementation? Commun. ACM 39(9): 88-91 (1996) - [j60]Omer Berkman, Baruch Schieber, Uzi Vishkin:
A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. 6(2): 231-242 (1996) - [j59]Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel. Theor. Comput. Sci. 154(2): 225-245 (1996) - [c47]Süleyman Cenk Sahinalp, Uzi Vishkin:
Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). FOCS 1996: 320-328 - 1995
- [j58]Omer Berkman, Uzi Vishkin:
Almost Fully-parallel Parentheses Matching. Discret. Appl. Math. 57(1): 11-28 (1995) - [c46]Uzi Vishkin:
On a Technique for Parsing a String (Abstract). CPM 1995: 386 - [c45]Rajeev Raman, Uzi Vishkin:
Parallel algorithms for database operations and a database operation for parallel algorithms. IPPS 1995: 173-179 - [c44]Yossi Matias, Uzi Vishkin:
A note on reducing parallel model simulations to integer sorting. IPPS 1995: 208-212 - 1994
- [j57]Gad M. Landau, Uzi Vishkin:
Pattern Matching in a Digitized Image. Algorithmica 12(4/5): 375-408 (1994) - [j56]Richard Cole, Uzi Vishkin:
On the Detection of Robust Curves. CVGIP Graph. Model. Image Process. 56(3): 189-204 (1994) - [j55]Samir Khuller, Uzi Vishkin:
On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52(5): 239-241 (1994) - [j54]Samir Khuller, Uzi Vishkin:
Biconnectivity Approximations and Graph Carvings. J. ACM 41(2): 214-235 (1994) - [j53]Samir Khuller, Uzi Vishkin, Neal E. Young:
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. J. Algorithms 17(2): 280-289 (1994) - [j52]Omer Berkman, Uzi Vishkin:
Finding Level-Ancestors in Trees. J. Comput. Syst. Sci. 48(2): 214-230 (1994) - [j51]Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin:
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. SIAM J. Comput. 23(3): 449-465 (1994) - [c43]Süleyman Cenk Sahinalp, Uzi Vishkin:
On a Parallel-Algorithms Method for String Matching Problems. CIAC 1994: 22-32 - [c42]Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel. IPPS 1994: 349-356 - [c41]Uzi Vishkin:
Can Parallel Algorithms Enhance Serial Implementation? IPPS 1994: 376-385 - [c40]Michael T. Goodrich, Yossi Matias, Uzi Vishkin:
Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA 1994: 241-250 - [c39]Rajeev Raman, Uzi Vishkin:
Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. SODA 1994: 613-621 - [c38]Süleyman Cenk Sahinalp, Uzi Vishkin:
Symmetry breaking for suffix tree construction. STOC 1994: 300-309 - [c37]Yishay Mansour, Noam Nisan, Uzi Vishkin:
Trade-offs between communication throughput and parallel time. STOC 1994: 372-381 - 1993
- [j50]Omer Berkman, Uzi Vishkin:
On Parallel Integer Merging. Inf. Comput. 106(2): 266-285 (1993) - [j49]Omer Berkman, Baruch Schieber, Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms 14(3): 344-370 (1993) - [j48]Omer Berkman, Uzi Vishkin:
Recursive Star-Tree Parallel Data Structure. SIAM J. Comput. 22(2): 221-242 (1993) - [c36]Gad M. Landau, Uzi Vishkin:
Two Dimensional Pattern Matching in a Digitized Image. CPM 1993: 134-151 - [c35]Samir Khuller, Uzi Vishkin, Neal E. Young:
A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993: 333-341 - [c34]Michael T. Goodrich, Yossi Matias, Uzi Vishkin:
Approximate Parallel Prefix Computation and its Applications. IPPS 1993: 318-325 - 1992
- [j47]Omer Berkman, Yossi Matias, Uzi Vishkin:
Randomized Range-Maxima in Nearly-Constant Parallel Time. Comput. Complex. 2: 350-373 (1992) - [j46]Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. J. Algorithms 13(1): 2-32 (1992) - [j45]Uzi Vishkin:
A Parallel Blocking Flow Algorithm for Acyclic Networks. J. Algorithms 13(3): 489-501 (1992) - [c33]Uzi Vishkin:
Methods in Parallel Algorithmics and Who May Need to Know Them? ISAAC 1992: 1-5 - [c32]Omer Berkman, Yossi Matias, Uzi Vishkin:
Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC 1992: 135-144 - [c31]Uzi Vishkin:
Methods in Parallel Algorithmics (Abstract). MFCS 1992: 81 - [c30]Uzi Vishkin:
A Case for the PRAM As a Standard Programmer's Model. Heinz Nixdorf Symposium 1992: 11-19 - [c29]Gad M. Landau, Uzi Vishkin:
Pattern Matching in a Digitized Image. SODA 1992: 453-462 - [c28]Samir Khuller, Uzi Vishkin:
Biconnectivity Approximations and Graph Carvings. STOC 1992: 759-770 - 1991
- [j44]Richard Cole, Uzi Vishkin:
Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms. Inf. Comput. 92(1): 1-47 (1991) - [j43]Yossi Matias, Uzi Vishkin:
On Parallel Hashing and Integer Sorting. J. Algorithms 12(4): 573-606 (1991) - [j42]Uzi Vishkin:
Deterministic Sampling - A New Technique for Fast Pattern Matching. SIAM J. Comput. 20(1): 22-40 (1991) - [j41]Uzi Vishkin:
Can parallel algorithms enhance serial implementation. SIGACT News 22(4): 63 (1991) - [c27]Joseph Gil, Yossi Matias, Uzi Vishkin:
Towards a Theory of Nearly Constant Time Parallel Algorithms. FOCS 1991: 698-710 - [c26]Uzi Vishkin:
Strutural Parallel Algorithmics. ICALP 1991: 363-380 - [c25]Yossi Matias, Uzi Vishkin:
Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract). STOC 1991: 307-316 - 1990
- [j40]Baruch Schieber, Uzi Vishkin:
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discret. Appl. Math. 29(1): 97-111 (1990) - [c24]Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract). FOCS 1990: 871-881 - [c23]Yossi Matias, Uzi Vishkin:
On Parallel Hashing and Integer Sorting (Extended Summary). ICALP 1990: 729-743 - [c22]Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. SODA 1990: 344-357 - [c21]Uzi Vishkin:
Deterministic Sampling-A New Technique for Fast Pattern Matching. STOC 1990: 170-180
1980 – 1989
- 1989
- [j39]Richard Cole, Uzi Vishkin:
Faster Optimal Parallel Prefix Sums and List Ranking. Inf. Comput. 81(3): 334-352 (1989) - [j38]Gad M. Landau, Uzi Vishkin:
Fast Parallel and Serial Approximate String Matching. J. Algorithms 10(2): 157-169 (1989) - [c20]Omer Berkman, Uzi Vishkin:
Recursive *-Tree Parallel Data-Structure (Extended Abstract). FOCS 1989: 196-202 - [c19]Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin:
Highly Parallelizable Problems (Extended Abstract). STOC 1989: 309-319 - 1988
- [j37]Richard Cole, Uzi Vishkin:
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. Algorithmica 3: 329-346 (1988) - [j36]Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree with Applications. Algorithmica 3: 347-365 (1988) - [j35]Gad M. Landau, Uzi Vishkin, Ruth Nussinov:
Locating alignments with k differences for nucleotide and amino acid sequences. Comput. Appl. Biosci. 4(1): 19-24 (1988) - [j34]Gad M. Landau, Uzi Vishkin:
Fast String Matching with k Differences. J. Comput. Syst. Sci. 37(1): 63-78 (1988) - [j33]Richard Cole, Uzi Vishkin:
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. 17(1): 128-142 (1988) - [j32]Baruch Schieber, Uzi Vishkin:
On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput. 17(6): 1253-1262 (1988) - [j31]Tali Eilam-Tzoreff, Uzi Vishkin:
Matching Patterns in Strings Subject to Multi-Linear Transformations. Theor. Comput. Sci. 60: 231-254 (1988) - [j30]Nimrod Megiddo, Uzi Vishkin:
On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. 61: 307-316 (1988) - [c18]Vijaya Ramachandran, Uzi Vishkin:
Efficient Parallel Triconnectivity in Logarithmic Time. AWOC 1988: 33-42 - [c17]Richard Cole, Uzi Vishkin:
Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. AWOC 1988: 91-100 - [c16]Baruch Schieber, Uzi Vishkin:
On Finding Lowest Common Ancestors: Simplification and Parallelization. AWOC 1988: 111-123 - 1987
- [j29]Uzi Vishkin:
Randomized Parallel Speedups for List Ranking. J. Parallel Distributed Comput. 4(3): 319-333 (1987) - [j28]Yossi Azar, Uzi Vishkin:
Tight Comparison Bounds on the Complexity of Parallel Sorting. SIAM J. Comput. 16(3): 458-464 (1987) - [c15]Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree (Extended Abstract). ICALP 1987: 314-325 - 1986
- [j27]Richard Cole, Uzi Vishkin:
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control. 70(1): 32-53 (1986) - [j26]Gad M. Landau, Uzi Vishkin, Ruth Nussinov:
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Nucleic Acids Res. 14(1): 31-46 (1986) - [j25]Gad M. Landau, Uzi Vishkin:
Efficient String Matching with k Mismatches. Theor. Comput. Sci. 43: 239-249 (1986) - [j24]Yael Maon, Baruch Schieber, Uzi Vishkin:
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. Theor. Comput. Sci. 47(3): 277-298 (1986) - [c14]Yael Maon, Baruch Schieber, Uzi Vishkin:
Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). Aegean Workshop on Computing 1986: 34-45 - [c13]Richard Cole, Uzi Vishkin:
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems. FOCS 1986: 478-491 - [c12]Noga Alon, Yossi Azar, Uzi Vishkin:
Tight Complexity Bounds for Parallel Comparison Sorting. FOCS 1986: 502-510 - [c11]Richard Cole, Uzi Vishkin:
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. STOC 1986: 206-219 - [c10]Gad M. Landau, Uzi Vishkin:
Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm. STOC 1986: 220-230 - 1985
- [j23]Don Coppersmith, Uzi Vishkin:
Solving NP-hard problems in 'almost trees': Vertex cover. Discret. Appl. Math. 10(1): 27-45 (1985) - [j22]Yehoshua Perl, Uzi Vishkin:
Efficient implementation of a shifting algorithm. Discret. Appl. Math. 12(1): 71-80 (1985) - [j21]Uzi Vishkin:
Optimal Parallel Pattern Matching in Strings. Inf. Control. 67(1-3): 91-113 (1985) - [j20]Uzi Vishkin:
On Efficient Parallel Strong Orientation. Inf. Process. Lett. 20(5): 235-240 (1985) - [j19]Uzi Vishkin, Avi Wigderson:
Trade-Offs Between Depth and Width in Parallel Computation. SIAM J. Comput. 14(2): 303-314 (1985) - [j18]Robert Endre Tarjan, Uzi Vishkin:
An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput. 14(4): 862-874 (1985) - [j17]Ilan Bar-On, Uzi Vishkin:
Optimal Parallel Generation of a Computation Tree Form. ACM Trans. Program. Lang. Syst. 7(2): 348-357 (1985) - [c9]Gad M. Landau, Uzi Vishkin:
Efficient String Matching in the Presence of Errors. FOCS 1985: 126-136 - [c8]Uzi Vishkin:
Optimal Parallel Pattern Matching in Strings (Extended Summary). ICALP 1985: 497-508 - 1984
- [j16]Kurt Mehlhorn, Uzi Vishkin:
Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica 21: 339-374 (1984) - [j15]Uzi Vishkin:
An optimal parallel connectivity algorithm. Discret. Appl. Math. 9(2): 197-207 (1984) - [j14]Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin:
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM 31(3): 459-473 (1984) - [j13]Mikhail J. Atallah, Uzi Vishkin:
Finding Euler Tours in Parallel. J. Comput. Syst. Sci. 29(3): 330-337 (1984) - [j12]Larry J. Stockmeyer, Uzi Vishkin:
Simulation of Parallel Random Access Machines by Circuits. SIAM J. Comput. 13(2): 409-422 (1984) - [j11]Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
Constant Depth Reducibility. SIAM J. Comput. 13(2): 423-439 (1984) - [j10]Uzi Vishkin:
A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. Theor. Comput. Sci. 32: 157-172 (1984) - [c7]Robert Endre Tarjan, Uzi Vishkin:
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary). FOCS 1984: 12-20 - [c6]Uzi Vishkin:
Randomized Speed-Ups in Parallel Computation. STOC 1984: 230-239 - 1983
- [j9]Uzi Vishkin, Avi Wigderson:
Dynamic Parallel Memories. Inf. Control. 56(3): 174-182 (1983) - [j8]Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener:
Parallel Computation on 2-3-Trees. RAIRO Theor. Informatics Appl. 17(4): 397-404 (1983) - [j7]Uzi Vishkin:
Implementation of Simultaneous Memory Address Access in Models That Forbid It. J. Algorithms 4(1): 45-50 (1983) - [j6]Uzi Vishkin:
An efficient distributed orientation algorithm. IEEE Trans. Inf. Theory 29(4): 624-629 (1983) - [c5]Uzi Vishkin, Avi Wigderson:
Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version). FOCS 1983: 146-153 - [c4]Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener:
Parallel Dictionaries in 2-3 Trees. ICALP 1983: 597-609 - [c3]Kurt Mehlhorn, Uzi Vishkin:
Granularity of Memory in Parallel Computation. WG 1983: 231-240 - 1982
- [j5]Yossi Shiloach, Uzi Vishkin, Shmuel Zaks:
Golden ratios in a pairs covering problem. Discret. Math. 41(1): 57-65 (1982) - [j4]Reuven Bar-Yehuda, Uzi Vishkin:
Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett. 14(5): 228-232 (1982) - [j3]Yossi Shiloach, Uzi Vishkin:
An O(log n) Parallel Connectivity Algorithm. J. Algorithms 3(1): 57-67 (1982) - [j2]Yossi Shiloach, Uzi Vishkin:
An O(n² log n) Parallel MAX-FLOW Algorithm. J. Algorithms 3(2): 128-146 (1982) - [c2]Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
A Complexity Theory for Unbounded Fan-In Parallelism. FOCS 1982: 1-13 - 1981
- [b1]Uzi Vishkin:
Synchronized parallel computation. Technion - Israel Institute of Technology, Israel, 1981 - [j1]Yossi Shiloach, Uzi Vishkin:
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. J. Algorithms 2(1): 88-102 (1981) - [c1]Yossi Shiloach, Uzi Vishkin:
Finding the maximum, merging and sorting in a parallel computation model. CONPAR 1981: 314-327
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
