Uzi Vishkin - RankMe

184 papers A* 31A 4B 29C 5Journal 84Unranked 28

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Brief Announcement: A Novel Integrated Parallel Accelerator for an Irregular Killer App. SPAA Yuhao Song, Manoj Franklin, Uzi Vishkin
2023	—	`conf`	Empirical Challenge for NC Theory (Abstract). HOPC@SPAA Ananth Hari, Uzi Vishkin
2023	J	`jnl`	Empirical Challenge for NC Theory. CoRR Ananth Hari, Uzi Vishkin
2022	—	`conf`	Beyond worst-case analysis: observed low depth for a P-complete problem. PMAM@PPoPP Uzi Vishkin
2022	B	`conf`	ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes Using Short Read Data. RECOMB 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, Süleyman Cenk Sahinalp
2022	J	`jnl`	On the model of computation: counterpoint. Commun. ACM Uzi Vishkin
2021	A*	`conf`	Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. NeurIPS Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein
2021	J	`jnl`	Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. CoRR Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein
2021	B	`conf`	SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. SPAA Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick
2021	J	`jnl`	Study of Fine-grained Nested Parallelism in CDCL SAT Solvers. ACM Trans. Parallel Comput. James Alexander Edwards, Uzi Vishkin
2019	J	`jnl`	Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. J. Cryptol. Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin
2018	J	`jnl`	Easy PRAM-Based High-Performance Parallel Programming with ICE. IEEE Trans. Parallel Distributed Syst. Fady Ghanim, Uzi Vishkin, Rajeev Barua
2018	—	`conf`	Linking parallel algorithmic thinking to many-core memory systems and speedups for boosted decision trees. MEMSYS James Alexander Edwards, Uzi Vishkin
2016	—	`conf`	FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algorithm on a Highly-Parallel Many Core. IPDPS Workshops James Alexander Edwards, Uzi Vishkin
2016	B	`conf`	POSTER: Easy PRAM-based High-Performance Parallel Programming with ICE. PACT Fady Ghanim, Rajeev Barua, Uzi Vishkin
2015	—	`conf`	Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. ASIACRYPT (1) Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin
2015	J	`jnl`	Oblivious Network RAM. IACR Cryptol. ePrint Arch. Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin
2014	J	`jnl`	Is multicore hardware for general-purpose parallel processing broken? Commun. ACM Uzi Vishkin
2014	J	`jnl`	Lazy Scheduling: A Runtime Adaptive Scheduler for Declarative Parallelism. ACM Trans. Program. Lang. Syst. Alexandros Tzannes, George C. Caragea, Uzi Vishkin, Rajeev Barua
2014	J	`jnl`	Parallel algorithms for Burrows-Wheeler compression and decompression. Theor. Comput. Sci. James Alexander Edwards, Uzi Vishkin
2013	B	`conf`	Brief announcement: truly parallel burrows-wheeler compression and decompression. SPAA James Alexander Edwards, Uzi Vishkin
2012	—	`conf`	Better speedups using simpler parallel programming for graph connectivity and biconnectivity. PMAM James Alexander Edwards, Uzi Vishkin
2012	B	`conf`	Brief announcement: speedups for parallel graph triconnectivity. SPAA James Alexander Edwards, Uzi Vishkin
2011	J	`jnl`	A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin
2011	B	`conf`	Brief announcement: better speedups for parallel max-flow. SPAA George Constantin Caragea, Uzi Vishkin
2011	B	`conf`	Improving Run-Time Scheduling for General-Purpose Parallel Code. PACT Alexandros Tzannes, Rajeev Barua, Uzi Vishkin
2011	A	`conf`	Panel Statement. IPDPS Yves Robert, William J. Dally, Jack J. Dongarra, Satoshi Matsuoka, Robert Schreiber, Horst D. Simon, Uzi Vishkin
2011	B	`conf`	Power-Performance Comparison of Single-Task Driven Many-Cores. ICPADS Fuat Keceli, Tali Moreshet, Uzi Vishkin
2011	J	`jnl`	Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores. Int. J. Parallel Program. George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin
2011	—	`conf`	Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. IPDPS Workshops Fuat Keceli, Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin
2011	J	`jnl`	Using simple abstraction to reinvent computing for parallelism. Commun. ACM Uzi Vishkin
2010	—	`conf`	A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. NOCS Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin
2010	A	`conf`	Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience. SIGCSE Shane Torbert, Uzi Vishkin, Ron Tzur, David J. Ellison
2010	B	`conf`	Lazy binary-splitting: a run-time adaptive work-stealing scheduler. PPoPP Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin
2010	C	`conf`	Resource-Aware Compiler Prefetching for Many-Cores. ISPDC George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin
2010	—	`conf`	Thermal Management of a Many-Core Processor under Fine-Grained Parallelism. Euro-Par Workshops (1) Fuat Keceli, Tali Moreshet, Uzi Vishkin
2009	C	`conf`	Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? ICCD Uzi Vishkin
2009	B	`conf`	Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. SPAA George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin
2009	—	`conf`	HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? Euro-Par Workshops Martti Forsell, H. Peter Hofstee, Ahmed Jerraya, Chris R. Jesshope, Uzi Vishkin, Jesper Larsson Träff
2009	J	`jnl`	Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism. IEEE Trans. Very Large Scale Integr. Syst. Aydin O. Balkan, Gang Qu, Uzi Vishkin
2008	J	`jnl`	A pilot study to compare programming effort for two parallel programming models. J. Syst. Softw. Lorin Hochstein, Victor R. Basili, Uzi Vishkin, John Gilbert
2008	A*	`conf`	An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. DAC Aydin O. Balkan, Gang Qu, Uzi Vishkin
2008	—	`conf`	Fpga-based prototype of a pram-on-chip processor. Conf. Computing Frontiers Xingzhi Wen, Uzi Vishkin
2008	B	`conf`	XMT-GPU: A PRAM Architecture for Graphics Computation. ICPP Thomas M. DuBois, Bryant C. Lee, Yi Wang, Marc Olano, Uzi Vishkin
2007	—	`conf`	Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing. Hot Interconnects Aydin O. Balkan, Michael N. Horak, Gang Qu, Uzi Vishkin
2007	—	`ch.`	Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform. Handbook of Parallel Computing Bryant C. Lee, Uzi Vishkin, George C. Caragea
2007	B	`conf`	PRAM-on-chip: first commitment to silicon. SPAA Xingzhi Wen, Uzi Vishkin
2007	—	`conf`	Toward Realizing a PRAM-on-a-Chip Vision. Euro-Par Workshops Uzi Vishkin
2006	—	`conf`	A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing. ASAP Aydin O. Balkan, Gang Qu, Uzi Vishkin
2006	J	`jnl`	A bootstrapping model for directional wireless networks. IEEE Commun. Lett. Stuart D. Milner, Jaime Llorca, Archana Anibha, Uzi Vishkin
2006	J	`jnl`	Bootstrapping Free-Space Optical Networks. IEEE J. Sel. Areas Commun. Fang Liu, Uzi Vishkin, Stuart D. Milner
2006	J	`jnl`	Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor. J. Embed. Comput. Pei Gu, Uzi Vishkin
2006	B	`ed.`	SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006 SPAA Phillip B. Gibbons, Uzi Vishkin
2005	A	`conf`	Bootstrapping Free-Space Optical Networks. IPDPS Fang Liu, Uzi Vishkin, Stuart D. Milner
2004	—	`conf`	Arbitrate-and-move primitives for high throughput on-chip interconnection networks. ISCAS (2) Aydin O. Balkan, Gang Qu, Uzi Vishkin
2004	B	`conf`	PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. MFCS Uzi Vishkin
2003	J	`jnl`	Deterministic Resource Discovery in Distributed Networks. Theory Comput. Syst. Shay Kutten, David Peleg, Uzi Vishkin
2003	J	`jnl`	Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach. Theory Comput. Syst. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
2002	J	`jnl`	A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover CoRR Samir Khuller, Uzi Vishkin, Neal E. Young
2002	B	`conf`	Two techniques for reconciling algorithm parallelism with memory constraints. SPAA Uzi Vishkin
2001	B	`conf`	Deterministic resource discovery in distributed networks. SPAA Shay Kutten, David Peleg, Uzi Vishkin
2001	C	`conf`	Evaluating the XMT Parallel Programming Model. HIPS Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
2001	A	`conf`	Evaluating the XMT Parallel Programming Model. IPDPS Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
2001	B	`conf`	Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. SPAA Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
2001	B	`conf`	What to Do with All this Hardware? (Invited Lecture). CPM Uzi Vishkin
2000	C	`conf`	A PRAM-on-Chip Vision (invited abstract). SPIRE Uzi Vishkin
2000	B	`conf`	A no-busy-wait balanced tree parallel algorithmic paradigm. SPAA Uzi Vishkin
2000	A*	`conf`	Communication complexity of document exchange. SODA Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin
2000	J	`jnl`	Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. ACM J. Exp. Algorithmics Shlomit Dascal, Uzi Vishkin
1999	—	`conf`	Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. WAE Shlomit Dascal, Uzi Vishkin
1999	J	`jnl`	Trade-offs between Communication Throughput and Parallel Time. J. Complex. Yishay Mansour, Noam Nisan, Uzi Vishkin
1998	B	`conf`	Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract). SPAA Uzi Vishkin, Shlomit Dascal, Efraim Berkovich, Joseph Nuzman
1997	—	`ch.`	Approximate string searching. Pattern Matching Algorithms Gad M. Landau, Uzi Vishkin
1997	—	`conf`	Conflict-Free Access to Multiple Single-Ported Register Files. IPPS Silvia M. Müller, Uzi Vishkin
1997	B	`conf`	From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. SPAA Uzi Vishkin
1996	J	`jnl`	A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. Omer Berkman, Baruch Schieber, Uzi Vishkin
1996	J	`jnl`	Can Parallel Algorithms Enhance Seriel Implementation? Commun. ACM Uzi Vishkin
1996	A*	`conf`	Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). FOCS Süleyman Cenk Sahinalp, Uzi Vishkin
1996	J	`jnl`	Sorting Strings and Constructing Digital Search Trees in Parallel. Theor. Comput. Sci. Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin
1995	—	`conf`	A note on reducing parallel model simulations to integer sorting. IPPS Yossi Matias, Uzi Vishkin
1995	J	`jnl`	Almost Fully-parallel Parentheses Matching. Discret. Appl. Math. Omer Berkman, Uzi Vishkin
1995	B	`conf`	On a Technique for Parsing a String (Abstract). CPM Uzi Vishkin
1995	—	`conf`	Parallel algorithms for database operations and a database operation for parallel algorithms. IPPS Rajeev Raman, Uzi Vishkin
1994	J	`jnl`	A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. J. Algorithms Samir Khuller, Uzi Vishkin, Neal E. Young
1994	J	`jnl`	Biconnectivity Approximations and Graph Carvings. J. ACM Samir Khuller, Uzi Vishkin
1994	—	`conf`	Can Parallel Algorithms Enhance Serial Implementation? IPPS Uzi Vishkin
1994	J	`jnl`	Finding Level-Ancestors in Trees. J. Comput. Syst. Sci. Omer Berkman, Uzi Vishkin
1994	C	`conf`	On a Parallel-Algorithms Method for String Matching Problems. CIAC Süleyman Cenk Sahinalp, Uzi Vishkin
1994	J	`jnl`	On the Detection of Robust Curves. CVGIP Graph. Model. Image Process. Richard Cole, Uzi Vishkin
1994	J	`jnl`	On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. Samir Khuller, Uzi Vishkin
1994	A*	`conf`	Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA Michael T. Goodrich, Yossi Matias, Uzi Vishkin
1994	A*	`conf`	Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. SODA Rajeev Raman, Uzi Vishkin
1994	J	`jnl`	Pattern Matching in a Digitized Image. Algorithmica Gad M. Landau, Uzi Vishkin
1994	—	`conf`	Sorting Strings and Constructing Digital Search Trees in Parallel. IPPS Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin
1994	A*	`conf`	Symmetry breaking for suffix tree construction. STOC Süleyman Cenk Sahinalp, Uzi Vishkin
1994	J	`jnl`	Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. SIAM J. Comput. Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
1994	A*	`conf`	Trade-offs between communication throughput and parallel time. STOC Yishay Mansour, Noam Nisan, Uzi Vishkin
1993	B	`conf`	A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO Samir Khuller, Uzi Vishkin, Neal E. Young
1993	—	`conf`	Approximate Parallel Prefix Computation and its Applications. IPPS Michael T. Goodrich, Yossi Matias, Uzi Vishkin
1993	J	`jnl`	On Parallel Integer Merging Inf. Comput. Omer Berkman, Uzi Vishkin
1993	J	`jnl`	Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms Omer Berkman, Baruch Schieber, Uzi Vishkin
1993	J	`jnl`	Recursive Star-Tree Parallel Data Structure. SIAM J. Comput. Omer Berkman, Uzi Vishkin
1993	B	`conf`	Two Dimensional Pattern Matching in a Digitized Image. CPM Gad M. Landau, Uzi Vishkin
1992	—	`conf`	A Case for the PRAM As a Standard Programmer's Model. Heinz Nixdorf Symposium Uzi Vishkin
1992	J	`jnl`	A Parallel Blocking Flow Algorithm for Acyclic Networks. J. Algorithms Uzi Vishkin
1992	A*	`conf`	Biconnectivity Approximations and Graph Carvings STOC Samir Khuller, Uzi Vishkin
1992	J	`jnl`	Efficient Pattern Matching with Scaling. J. Algorithms Amihood Amir, Gad M. Landau, Uzi Vishkin
1992	B	`conf`	Methods in Parallel Algorithmics (Abstract). MFCS Uzi Vishkin
1992	B	`conf`	Methods in Parallel Algorithmics and Who May Need to Know Them? ISAAC Uzi Vishkin
1992	A*	`conf`	Pattern Matching in a Digitized Image. SODA Gad M. Landau, Uzi Vishkin
1992	J	`jnl`	Randomized Range-Maxima in Nearly-Constant Parallel Time. Comput. Complex. Omer Berkman, Yossi Matias, Uzi Vishkin
1992	B	`conf`	Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC Omer Berkman, Yossi Matias, Uzi Vishkin
1991	J	`jnl`	Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms Inf. Comput. Richard Cole, Uzi Vishkin
1991	J	`jnl`	Can parallel algorithms enhance serial implementation. SIGACT News Uzi Vishkin
1991	A*	`conf`	Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) STOC Yossi Matias, Uzi Vishkin
1991	J	`jnl`	Deterministic Sampling - A New Technique for Fast Pattern Matching. SIAM J. Comput. Uzi Vishkin
1991	J	`jnl`	On Parallel Hashing and Integer Sorting. J. Algorithms Yossi Matias, Uzi Vishkin
1991	A*	`conf`	Strutural Parallel Algorithmics. ICALP Uzi Vishkin
1991	A*	`conf`	Towards a Theory of Nearly Constant Time Parallel Algorithms FOCS Joseph Gil, Yossi Matias, Uzi Vishkin
1990	A*	`conf`	Deterministic Sampling-A New Technique for Fast Pattern Matching STOC Uzi Vishkin
1990	A*	`conf`	Efficient Pattern Matching with Scaling. SODA Amihood Amir, Gad M. Landau, Uzi Vishkin
1990	J	`jnl`	Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discret. Appl. Math. Baruch Schieber, Uzi Vishkin
1990	A*	`conf`	On Parallel Hashing and Integer Sorting (Extended Summary). ICALP Yossi Matias, Uzi Vishkin
1990	A*	`conf`	Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) FOCS Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
1989	J	`jnl`	Fast Parallel and Serial Approximate String Matching. J. Algorithms Gad M. Landau, Uzi Vishkin
1989	J	`jnl`	Faster Optimal Parallel Prefix Sums and List Ranking Inf. Comput. Richard Cole, Uzi Vishkin
1989	A*	`conf`	Highly Parallelizable Problems (Extended Abstract) STOC Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
1989	A*	`conf`	Recursive *-Tree Parallel Data-Structure (Extended Abstract) FOCS Omer Berkman, Uzi Vishkin
1988	J	`jnl`	Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. Richard Cole, Uzi Vishkin
1988	—	`conf`	Efficient Parallel Triconnectivity in Logarithmic Time. AWOC Vijaya Ramachandran, Uzi Vishkin
1988	J	`jnl`	Fast String Matching with k Differences. J. Comput. Syst. Sci. Gad M. Landau, Uzi Vishkin
1988	J	`jnl`	Locating alignments with k differences for nucleotide and amino acid sequences. Comput. Appl. Biosci. Gad M. Landau, Uzi Vishkin, Ruth Nussinov
1988	J	`jnl`	Matching Patterns in Strings Subject to Multi-Linear Transformations. Theor. Comput. Sci. Tali Eilam-Tzoreff, Uzi Vishkin
1988	—	`conf`	On Finding Lowest Common Ancestors: Simplification and Parallelization. AWOC Baruch Schieber, Uzi Vishkin
1988	J	`jnl`	On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput. Baruch Schieber, Uzi Vishkin
1988	J	`jnl`	On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. Nimrod Megiddo, Uzi Vishkin
1988	—	`conf`	Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. AWOC Richard Cole, Uzi Vishkin
1988	J	`jnl`	Parallel Construction of a Suffix Tree with Applications. Algorithmica Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
1988	J	`jnl`	The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. Algorithmica Richard Cole, Uzi Vishkin
1987	A*	`conf`	Parallel Construction of a Suffix Tree (Extended Abstract). ICALP Gad M. Landau, Baruch Schieber, Uzi Vishkin
1987	J	`jnl`	Randomized Parallel Speedups for List Ranking. J. Parallel Distributed Comput. Uzi Vishkin
1987	J	`jnl`	Tight Comparison Bounds on the Complexity of Parallel Sorting. SIAM J. Comput. Yossi Azar, Uzi Vishkin
1986	J	`jnl`	An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Nucleic Acids Res. Gad M. Landau, Uzi Vishkin, Ruth Nussinov
1986	A*	`conf`	Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems FOCS Richard Cole, Uzi Vishkin
1986	J	`jnl`	Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking Inf. Control. Richard Cole, Uzi Vishkin
1986	A*	`conf`	Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms STOC Richard Cole, Uzi Vishkin
1986	J	`jnl`	Efficient String Matching with k Mismatches. Theor. Comput. Sci. Gad M. Landau, Uzi Vishkin
1986	A*	`conf`	Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm STOC Gad M. Landau, Uzi Vishkin
1986	—	`conf`	Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). Aegean Workshop on Computing Yael Maon, Baruch Schieber, Uzi Vishkin
1986	J	`jnl`	Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. Theor. Comput. Sci. Yael Maon, Baruch Schieber, Uzi Vishkin
1986	A*	`conf`	Tight Complexity Bounds for Parallel Comparison Sorting FOCS Noga Alon, Yossi Azar, Uzi Vishkin
1985	J	`jnl`	An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput. Robert Endre Tarjan, Uzi Vishkin
1985	A*	`conf`	Efficient String Matching in the Presence of Errors FOCS Gad M. Landau, Uzi Vishkin
1985	J	`jnl`	Efficient implementation of a shifting algorithm. Discret. Appl. Math. Yehoshua Perl, Uzi Vishkin
1985	J	`jnl`	On Efficient Parallel Strong Orientation. Inf. Process. Lett. Uzi Vishkin
1985	J	`jnl`	Optimal Parallel Generation of a Computation Tree Form. ACM Trans. Program. Lang. Syst. Ilan Bar-On, Uzi Vishkin
1985	J	`jnl`	Optimal Parallel Pattern Matching in Strings Inf. Control. Uzi Vishkin
1985	A*	`conf`	Optimal Parallel Pattern Matching in Strings (Extended Summary). ICALP Uzi Vishkin
1985	J	`jnl`	Solving NP-hard problems in 'almost trees': Vertex cover. Discret. Appl. Math. Don Coppersmith, Uzi Vishkin
1985	J	`jnl`	Trade-Offs Between Depth and Width in Parallel Computation. SIAM J. Comput. Uzi Vishkin, Avi Wigderson
1984	J	`jnl`	A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. Theor. Comput. Sci. Uzi Vishkin
1984	J	`jnl`	An optimal parallel connectivity algorithm. Discret. Appl. Math. Uzi Vishkin
1984	J	`jnl`	Constant Depth Reducibility. SIAM J. Comput. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
1984	A*	`conf`	Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) FOCS Robert Endre Tarjan, Uzi Vishkin
1984	J	`jnl`	Finding Euler Tours in Parallel. J. Comput. Syst. Sci. Mikhail J. Atallah, Uzi Vishkin
1984	A*	`conf`	Randomized Speed-Ups in Parallel Computation STOC Uzi Vishkin
1984	J	`jnl`	Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica Kurt Mehlhorn, Uzi Vishkin
1984	J	`jnl`	Simulation of Parallel Random Access Machines by Circuits. SIAM J. Comput. Larry J. Stockmeyer, Uzi Vishkin
1984	J	`jnl`	Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin
1983	J	`jnl`	An efficient distributed orientation algorithm. IEEE Trans. Inf. Theory Uzi Vishkin
1983	J	`jnl`	Dynamic Parallel Memories Inf. Control. Uzi Vishkin, Avi Wigderson
1983	B	`conf`	Granularity of Memory in Parallel Computation. WG Kurt Mehlhorn, Uzi Vishkin
1983	J	`jnl`	Implementation of Simultaneous Memory Address Access in Models That Forbid It. J. Algorithms Uzi Vishkin
1983	J	`jnl`	Parallel Computation on 2-3-Trees. RAIRO Theor. Informatics Appl. Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
1983	A*	`conf`	Parallel Dictionaries in 2-3 Trees. ICALP Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
1983	A*	`conf`	Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version) FOCS Uzi Vishkin, Avi Wigderson
1982	A*	`conf`	A Complexity Theory for Unbounded Fan-In Parallelism FOCS Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
1982	J	`jnl`	An O(log n) Parallel Connectivity Algorithm. J. Algorithms Yossi Shiloach, Uzi Vishkin
1982	J	`jnl`	An O(n² log n) Parallel MAX-FLOW Algorithm. J. Algorithms Yossi Shiloach, Uzi Vishkin
1982	J	`jnl`	Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett. Reuven Bar-Yehuda, Uzi Vishkin
1982	J	`jnl`	Golden ratios in a pairs covering problem. Discret. Math. Yossi Shiloach, Uzi Vishkin, Shmuel Zaks
1981	J	`jnl`	Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. J. Algorithms Yossi Shiloach, Uzi Vishkin
1981	—	`conf`	Finding the maximum, merging and sorting in a parallel computation model. CONPAR Yossi Shiloach, Uzi Vishkin
1981	—	`—`	Synchronized parallel computation. Uzi Vishkin