| 2025 | SPAA | Brief Announcement: A Novel Integrated Parallel Accelerator for an Irregular Killer App. | Yuhao Song, Manoj Franklin, Uzi Vishkin |
| 2022 | PPoPP | Beyond worst-case analysis: observed low depth for a P-complete problem. | Uzi Vishkin |
| 2022 | RECOMB | ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes Using Short Read Data. | Michael K. B. 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, Sleyman Cenk Sahinalp |
| 2021 | SPAA | SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. | Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick |
| 2015 | ASIACRYPT | Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. | Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin |
| 2013 | SPAA | Brief announcement: truly parallel burrows-wheeler compression and decompression. | James Alexander Edwards, Uzi Vishkin |
| 2012 | PPoPP | Better speedups using simpler parallel programming for graph connectivity and biconnectivity. | James Alexander Edwards, Uzi Vishkin |
| 2012 | SPAA | Brief announcement: speedups for parallel graph triconnectivity. | James Alexander Edwards, Uzi Vishkin |
| 2011 | ICPADS | Power-Performance Comparison of Single-Task Driven Many-Cores. | Fuat Keceli, Tali Moreshet, Uzi Vishkin |
| 2011 | SPAA | Brief announcement: better speedups for parallel max-flow. | George Constantin Caragea, Uzi Vishkin |
| 2010 | EuroPar | Thermal Management of a Many-Core Processor under Fine-Grained Parallelism. | Fuat Keceli, Tali Moreshet, Uzi Vishkin |
| 2010 | ISPDC | Resource-Aware Compiler Prefetching for Many-Cores. | George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin |
| 2010 | PPoPP | Lazy binary-splitting: a run-time adaptive work-stealing scheduler. | Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin |
| 2010 | SIGCSE | Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience. | Shane Torbert, Uzi Vishkin, Ron Tzur, David J. Ellison |
| 2009 | EuroPar | HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? | Martti Forsell, H. Peter Hofstee, Ahmed Jerraya, Chris R. Jesshope, Uzi Vishkin, Jesper Larsson Trff |
| 2009 | ICCD | Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? | Uzi Vishkin |
| 2009 | SPAA | Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. | George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin |
| 2008 | DAC | An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. | Aydin O. Balkan, Gang Qu, Uzi Vishkin |
| 2008 | ICPP | XMT-GPU: A PRAM Architecture for Graphics Computation. | Thomas M. DuBois, Bryant C. Lee, Yi Wang, Marc Olano, Uzi Vishkin |
| 2007 | EuroPar | Toward Realizing a PRAM-on-a-Chip Vision. | Uzi Vishkin |
| 2007 | HOTI | Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing. | Aydin O. Balkan, Michael N. Horak, Gang Qu, Uzi Vishkin |
| 2007 | SPAA | PRAM-on-chip: first commitment to silicon. | Xingzhi Wen, Uzi Vishkin |
| 2004 | ISCAS | Arbitrate-and-move primitives for high throughput on-chip interconnection networks. | Aydin O. Balkan, Gang Qu, Uzi Vishkin |
| 2004 | MFCS | PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. | Uzi Vishkin |
| 2002 | SPAA | Two techniques for reconciling algorithm parallelism with memory constraints. | Uzi Vishkin |
| 2001 | CPM | What to Do with All this Hardware? (Invited Lecture). | Uzi Vishkin |
| 2001 | HIPS | Evaluating the XMT Parallel Programming Model. | Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin |
| 2001 | SPAA | Deterministic resource discovery in distributed networks. | Shay Kutten, David Peleg, Uzi Vishkin |
| 2001 | SPAA | Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. | Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin |
| 2000 | SODA | Communication complexity of document exchange. | Graham Cormode, Mike Paterson, Sleyman Cenk Sahinalp, Uzi Vishkin |
| 2000 | SPAA | A no-busy-wait balanced tree parallel algorithmic paradigm. | Uzi Vishkin |
| 2000 | SPIRE | A PRAM-on-Chip Vision (invited abstract). | Uzi Vishkin |
| 1998 | SPAA | Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract). | Uzi Vishkin, Shlomit Dascal, Efraim Berkovich, Joseph Nuzman |
| 1997 | SPAA | From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. | Uzi Vishkin |
| 1996 | FOCS | Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). | Sleyman Cenk Sahinalp, Uzi Vishkin |
| 1995 | CPM | On a Technique for Parsing a String (Abstract). | Uzi Vishkin |
| 1994 | CIAC | On a Parallel-Algorithms Method for String Matching Problems. | Sleyman Cenk Sahinalp, Uzi Vishkin |
| 1994 | SODA | Optimal Parallel Approximation for Prefix Sums and Integer Sorting. | Michael T. Goodrich, Yossi Matias, Uzi Vishkin |
| 1994 | SODA | Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. | Rajeev Raman, Uzi Vishkin |
| 1994 | STOC | Trade-offs between communication throughput and parallel time. | Yishay Mansour, Noam Nisan, Uzi Vishkin |
| 1994 | STOC | Symmetry breaking for suffix tree construction. | Sleyman Cenk Sahinalp, Uzi Vishkin |
| 1993 | CPM | Two Dimensional Pattern Matching in a Digitized Image. | Gad M. Landau, Uzi Vishkin |
| 1993 | IPCO | A primal-dual parallel approximation technique applied to weighted set and vertex cover. | Samir Khuller, Uzi Vishkin, Neal E. Young |
| 1992 | ISAAC | Randomized Range-Maxima inNearly-Constant Parallel Time. | Omer Berkman, Yossi Matias, Uzi Vishkin |
| 1992 | ISAAC | Methods in Parallel Algorithmics and Who May Need to Know Them? | Uzi Vishkin |
| 1992 | MFCS | Methods in Parallel Algorithmics (Abstract). | Uzi Vishkin |
| 1992 | SODA | Pattern Matching in a Digitized Image. | Gad M. Landau, Uzi Vishkin |
| 1992 | STOC | Biconnectivity Approximations and Graph Carvings | Samir Khuller, Uzi Vishkin |
| 1991 | FOCS | Towards a Theory of Nearly Constant Time Parallel Algorithms | Joseph Gil, Yossi Matias, Uzi Vishkin |
| 1991 | ICALP | Strutural Parallel Algorithmics. | Uzi Vishkin |
| 1991 | STOC | Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) | Yossi Matias, Uzi Vishkin |
| 1990 | FOCS | Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) | Omer Berkman, Joseph F. JJ, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin |
| 1990 | ICALP | On Parallel Hashing and Integer Sorting (Extended Summary). | Yossi Matias, Uzi Vishkin |
| 1990 | SODA | Efficient Pattern Matching with Scaling. | Amihood Amir, Gad M. Landau, Uzi Vishkin |
| 1990 | STOC | Deterministic Sampling-A New Technique for Fast Pattern Matching | Uzi Vishkin |
| 1989 | FOCS | Recursive *-Tree Parallel Data-Structure (Extended Abstract) | Omer Berkman, Uzi Vishkin |
| 1989 | STOC | Highly Parallelizable Problems (Extended Abstract) | Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin |
| 1987 | ICALP | Parallel Construction of a Suffix Tree (Extended Abstract). | Gad M. Landau, Baruch Schieber, Uzi Vishkin |
| 1986 | FOCS | Tight Complexity Bounds for Parallel Comparison Sorting | Noga Alon, Yossi Azar, Uzi Vishkin |
| 1986 | FOCS | Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems | Richard Cole, Uzi Vishkin |
| 1986 | STOC | Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms | Richard Cole, Uzi Vishkin |
| 1986 | STOC | Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm | Gad M. Landau, Uzi Vishkin |
| 1985 | FOCS | Efficient String Matching in the Presence of Errors | Gad M. Landau, Uzi Vishkin |
| 1985 | ICALP | Optimal Parallel Pattern Matching in Strings (Extended Summary). | Uzi Vishkin |
| 1984 | FOCS | Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) | Robert Endre Tarjan, Uzi Vishkin |
| 1984 | STOC | Randomized Speed-Ups in Parallel Computation | Uzi Vishkin |
| 1983 | FOCS | Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version) | Uzi Vishkin, Avi Wigderson |
| 1983 | ICALP | Parallel Dictionaries in 2-3 Trees. | Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener |
| 1983 | WG | Granularity of Memory in Parallel Computation. | Kurt Mehlhorn, Uzi Vishkin |
| 1982 | FOCS | A Complexity Theory for Unbounded Fan-In Parallelism | Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin |