Uzi Vishkin | Academic Influence

Uzi Vishkin's AcademicInfluence.com Rankings

Uzi Vishkin

Computer Science

#1086

World Rank

#1125

Historical Rank

#574

USA Rank

Parallel Computing

#16

World Rank

#16

Historical Rank

#13

USA Rank

Database

#3103

World Rank

#3234

Historical Rank

#595

USA Rank

computer-science Degrees

Download Badge

Computer Science

Uzi Vishkin's Degrees

PhD Computer Science Technion – Israel Institute of Technology
Masters Computer Science Technion – Israel Institute of Technology
Bachelors Computer Science Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Why Is Uzi Vishkin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Uzi Vishkin is a computer scientist at the University of Maryland, College Park, where he is Professor of Electrical and Computer Engineering at the University of Maryland Institute for Advanced Computer Studies . Uzi Vishkin is known for his work in the field of parallel computing. In 1996, he was inducted as a Fellow of the Association for Computing Machinery, with the following citation: "One of the pioneers of parallel algorithms research, Dr. Vishkin's seminal contributions played a leading role in forming and shaping what thinking in parallel has come to mean in the fundamental theory of Computer Science."

(See a Problem?)

Uzi Vishkin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An O(log n) Parallel Connectivity Algorithm (1982) (614)
On Finding Lowest Common Ancestors: Simplification and Parallelization (1988) (548)
An Efficient Parallel Biconnectivity Algorithm (2011) (465)
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking (2018) (433)
Fast Parallel and Serial Approximate String Matching (1989) (346)
Constant Depth Reducibility (1984) (308)
An O(n² log n) Parallel MAX-FLOW Algorithm (1982) (230)
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (1986) (211)
Fast String Matching with k Differences (1988) (210)
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model (1981) (205)
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) (1984) (205)
Faster Optimal Parallel Prefix Sums and List Ranking (2011) (203)
Simulation of Parallel Random Access Machines by Circuits (1984) (201)
Recursive Star-Tree Parallel Data Structure (1993) (196)
Approximate and exact parallel scheduling with applications to list, tree and graph problems (1986) (193)
Biconnectivity approximations and graph carvings (1992) (193)
Efficient String Matching with k Mismatches (2018) (191)
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (1988) (188)
Finding the maximum, merging and sorting in a parallel computation model (1981) (156)
Communication complexity of document exchange (1999) (152)
Efficient approximate and dynamic matching of patterns using a labeling paradigm (1996) (137)
Introducing efficient parallelism into approximate string matching and a new serial algorithm (1986) (137)
Optimal Parallel Pattern Matching in Strings (2017) (136)
Towards a theory of nearly constant time parallel algorithms (1991) (132)
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs (1986) (132)
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values (1993) (122)
Converting high probability into nearly-constant time—with applications to parallel hashing (1991) (120)
Finding Level-Ancestors in Trees (1994) (114)
Highly parallelizable problems (1989) (112)
Parallel Dictionaries in 2-3 Trees (1983) (103)
Implementation of Simultaneous Memory Address Access in Models That Forbid It (1983) (99)
Efficient pattern matching with scaling (1990) (91)
Efficient string matching in the presence of errors (1985) (76)
Biconnectivity approximations and graph carvings (1994) (75)
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (1984) (75)
Optimal parallel generation of a computation tree form (2018) (73)
Randomized speed-ups in parallel computation (2015) (71)
Symmetry breaking for suffix tree construction (1994) (71)
Deterministic sampling—a new technique for fast pattern matching (1990) (70)
On Parallel Hashing and Integer Sorting (1991) (70)
Fpga-based prototype of a pram-on-chip processor (2008) (69)
Deterministic Sampling - A New Technique for Fast Pattern Matching (1991) (68)
A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing (2006) (67)
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers (1994) (67)
Recursive *-tree parallel data-structure (1989) (67)
Explicit multi-threading (XMT) bridging models for instruction parallelism (extended abstract) (1998) (63)
Lazy binary-splitting: a run-time adaptive work-stealing scheduler (2010) (62)
A pilot study to compare programming effort for two parallel programming models (2007) (62)
On Efficient Parallel Strong Orientation (1985) (60)
Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms (1991) (59)
Trade-offs between depth and width in parallel computation (1985) (59)
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (1984) (56)
Using simple abstraction to reinvent computing for parallelism (2011) (53)
Parallel construction of a suffix tree with applications (1988) (53)
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (2011) (49)
On Finding a Minimum Dominating Set in a Tournament (1988) (49)
Reconfigurable optical wireless sensor networks (2004) (46)
Finding Euler Tours in Parallel (2011) (45)
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors (2010) (45)
A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer (2011) (44)
An optimal parallel connectivity algorithm (1984) (43)
Tight Comparison Bounds on the Complexity of Parallel Sorting (2018) (43)
Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking (1988) (42)
Pattern matching in a digitized image (1992) (42)
Bootstrapping free-space optical networks (2005) (41)
A complexity theory for unbounded fan-in parallelism (1982) (40)
Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform (2006) (39)
Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach (2003) (39)
Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism (2009) (39)
Deterministic Resource Discovery in Distributed Networks (2001) (38)
Efficient Parallel Triconnectivity in Logarithmic Time (1988) (37)
PRAM-on-chip: first commitment to silicon (2007) (37)
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors (2011) (35)
Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing (2007) (34)
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences (2018) (33)
Trade-offs between communication throughput and parallel time (1993) (33)
Matching Patterns in Strings Subject to Multi-Linear Transformations (2015) (32)
Optimal Parallel Pattern Matching in Strings (Extended Summary) (1985) (29)
Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience (2010) (29)
Thinking in Parallel: Some Basic Data-Parallel Algorithms and Techniques (2008) (29)
An efficient distributed orientation algorithm (1983) (27)
Can parallel algorithms enhance serial implementation? (1994) (26)
General-Purpose vs . GPU : Comparison of Many-Cores on Irregular Workloads (2010) (26)
Better speedups using simpler parallel programming for graph connectivity and biconnectivity (2012) (25)
Lazy Scheduling: A Runtime Adaptive Scheduler for Declarative Parallelism (2014) (24)
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks (2021) (24)
Efficient implementation of a shifting algorithm (2018) (23)
An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing (2008) (23)
Parallel Construction of a Suffix Tree (Extended Abstract) (1987) (23)
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (1990) (22)
Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture (2011) (22)
Parallel algorithms for Burrows-Wheeler compression and decompression (2014) (20)
Tight complexity bounds for parallel comparison sorting (1986) (20)
On Parallel Hashing and Integer Sorting (Extended Summary) (1990) (20)
On Parallel Integer Merging (1993) (19)
Parallel Computation on 2-3-Trees (2018) (19)
Electron beam and optical proximity effect reduction for nanolithography: New results (2007) (19)
Optimal parallel approximation for prefix sums and integer sorting (1994) (18)
Brief announcement: better speedups for parallel max-flow (2011) (18)
Is multicore hardware for general-purpose parallel processing broken? (2014) (17)
A Case for the PRAM As a Standard Programmer's Model (1992) (16)
Some triply-logarithmic parallel algorithms (1990) (16)
Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor (2006) (16)
Solving NP-hard problems in 'almost trees': Vertex cover (1985) (16)
Resource-Aware Compiler Prefetching for Many-Cores (2010) (16)
Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor (2009) (15)
A fast parallel algorithm for finding the convex hull of a sorted point set (1996) (14)
A Parallel Blocking Flow Algorithm for Acyclic Networks (1992) (14)
Sorting strings and constructing digital search trees in parallel (1994) (14)
Dynamic Parallel Memories (2018) (13)
From algorithm parallelism to instruction-level parallelism: an encode-decode chain using prefix-sum (1997) (13)
Almost Fully-parallel Parentheses Matching (1995) (12)
A no-busy-wait balanced tree parallel algorithmic paradigm (2000) (12)
Bootstrapping free-space optical networks (2006) (12)
Highly Parallelizable Problems (Extended Abstract) (1989) (12)
Locating alignments with k differences for nucleotide and amino acid sequences (1988) (12)
Strutural Parallel Algorithmics (1991) (12)
Structural parallel algorithmics (1993) (12)
Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism (1999) (12)
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (2015) (11)
Using Simple Abstraction to Guide the Reinvention of Computing for Parallelism (2009) (11)
On a Parallel-Algorithms Method for String Matching Problems (1994) (10)
Power-Performance Comparison of Single-Task Driven Many-Cores (2011) (10)
Empirical Speedup Study of Truly Parallel Data Compression (2013) (9)
POSTER: Easy PRAM-based High-Performance Parallel Programming with ICE (2018) (9)
Brief announcement: speedups for parallel graph triconnectivity (2012) (9)
Evaluating the XMT parallel programming model (2001) (9)
Optimal parallel approximation algorithms for prefix sums and integer sorting (1994) (9)
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach (2001) (9)
Easy PRAM-Based High-Performance Parallel Programming with ICE (2016) (9)
Programmer's Manual for XMTC Language, XMTC Compiler and XMT Simulator (2006) (9)
Approximate parallel prefix computation and its applications (1993) (8)
Truly parallel burrows-wheeler compression and decompression (2013) (8)
A note on reducing parallel model simulations to integer sorting (1995) (8)
Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix (1994) (7)
Complexity of Finding k-Path-Free Dominating Sets in Graphs (1982) (7)
Can parallel algorithms enhance serial implementation (1991) (7)
Evaluating Multi-threading in the Prototype XMT Environment (2000) (7)
Parallel algorithms for database operations and a database operation for parallel algorithms (1995) (7)
Toward Realizing a PRAM-on-a-Chip Vision (2007) (7)
Randomized Parallel Speedups for List Ranking (1987) (6)
XMT-M: A Scalable Decentralized Processor (1999) (6)
Fast alignment of DNA and protein sequences. (1990) (6)
Panel Statement (2011) (6)
Developing a computer science agenda for high-performance computing (1994) (6)
A PRAM-on-Chip Vision (invited abstract) (2000) (6)
XMTSim: A Simulator of the XMT Many-core Architecture (2011) (5)
Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract) (1986) (5)
An efficient string matching algorithm with K substitutions for nucleotide and amino acid sequences. (1987) (5)
Two Dimensional Pattern Matching in a Digitized Image (1993) (4)
PRAM Algorithms: Teach and Preach (1989) (4)
XMT-GPU: A PRAM Architecture for Graphics Computation (2008) (4)
Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? (2009) (4)
Arbitrate-and-move primitives for high throughput on-chip interconnection networks (2004) (4)
Recursive *-Tree Parallel Data-Structure (Extended Abstract) (1989) (4)
The compiler for the XMTC parallel language: Lessons for compiler developers and in-depth description (2011) (3)
Oblivious Network RAM (2015) (3)
Mesh-of-Trees and Alternative Interconnection Networks for Single Chip Parallel Processing (Extended Abstract) (2006) (3)
HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? (2009) (2)
Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores (2011) (2)
Optical interconnect structure in a computer system (2004) (2)
10 Lazy Scheduling: A Runtime Adaptive Scheduler (2014) (2)
On the Parallel Complexity of Digraph Reachability (1994) (2)
Improving Run-Time Scheduling for General-Purpose Parallel Code (2011) (2)
Conflict-free access to multiple single-ported register files (1997) (2)
Thermal Management of a Many-Core Processor under Fine-Grained Parallelism (2011) (2)
A PRAM-on-chip vision (2000) (2)
Two computer systems paradoxes: serialize-to-parallelize, and queuing concurrent-writes (1995) (2)
ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes using Short Read Data (2022) (2)
Efficient Parallel and Serial Approximate String Matching (2011) (2)
A bootstrapping model for directional wireless networks (2006) (2)
Plasmonics and the parallel programming problem (2007) (1)
Can Parallel Algorithms Enhance Serial Implementation? (Extended Abstract) (1994) (1)
Bending Light for Multi-Chip Virtual PRAMs ? (2004) (1)
What to Do with All this Hardware? (Invited Lecture) (2001) (1)
Study of Fine-grained Nested Parallelism in CDCL SAT Solvers (2021) (1)
Recursive star-tree parallel data structure. Technical report (1990) (1)
Synchronized parallel computation (1981) (1)
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima (1994) (1)
Granularity of Memory in Parallel Computation (1983) (1)
Can Cooling Technology Save Many-Core Parallel Programming from Its Programming Woes? (2015) (1)
Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallel Processing ∗ UMIACS-TR 2006-32 (Extended Abstract) † (2006) (1)
Parallel hashing and integer sorting. Technical report (1990) (1)
Synchronous Parallel Computation: A Survey (2018) (1)
What are the two most important issues facing the design and use of massively parallel computers? (1990) (1)
Parallel Simulation of Many-core Processors: Integration of Research and Education (2012) (0)
Randomized range-maxima in nearly-constant parallel time (1992) (0)
Architecture a ensemble d'instructions de generation-liaison (1998) (0)
Granularity of Parallel Memories (2011) (0)
On the Detection of Robust Curves (2018) (0)
FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algorithm on a Highly-Parallel Many Core (2016) (0)
Looking to Parallel Algorithms for ILP and Decentralization (1998) (0)
Feasibility Study of Scaling an XMT Many-Core (2015) (0)
PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness (2004) (0)
HPPC'09 Workshop Proceedings (2009) (0)
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems (1992) (0)
White paper: Towards a Second Line of Defense for Computer Security (2013) (0)
Approximate string searching (1997) (0)
Linking parallel algorithmic thinking to many-core memory systems and speedups for boosted decision trees (2018) (0)
Can optical interconnects lead to cheaper high-performance multiprocessors? (2004) (0)
Techniques and Applications for ApproximatingString Distances { Rough Draft ( April 11 2000 ) (2007) (0)
Multi-Threading ( XMT ) Bridging Models for InstructionParallelism ( extended summary and working document ) (2007) (0)
Parallel unit propagation: Optimal speedup 3CNF Horn SAT (2021) (0)
ImmunoTyper-SR: A computational approach for genotyping immunoglobulin heavy chain variable genes using short-read data. (2022) (0)
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (2018) (0)
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) (1990) (0)
Jeffrey and Holly Ullman Parallel Computing Day 20 October , 2009 10 : 45 Coffee & Tagging 11 : 05 No Need to Constrain Many-Core Parallel Programming (2009) (0)
Symmetry Breaking for Suux Tree Construction (2007) (0)
On the model of computation (2022) (0)
Project for Developing Computer Science Agenda(s) for High-Performance Computing: An Organizer's Summary (1998) (0)
On a Technique for Parsing a String (Abstract) (1995) (0)
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures (2021) (0)
Two techniques for reconciling algorithm parallelism with memory constraints (2002) (0)
Beyond worst-case analysis: observed low depth for a P-complete problem (2022) (0)
§ 240 (2018) (0)
On Choice of a Model of Parallel Computation (2011) (0)
5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
On Choice of a Model of Parallel Computation (2011) (0)
Methods in Parallel Algorithmics and Who May Need to Know Them? (1992) (0)
From Algorithm Parallelism to Instruction-level Parallelism: an Encode-decode Chain Using Preex-sum (extended Abstract) (1997) (0)
Randomized Range-Maxima inNearly-Constant Parallel Time (1991) (0)
SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006 (2006) (0)
IPDPS 2011 Tuesday 25th Year Panel - Looking back (2011) (0)
AC 2012-3055: PARALLEL SIMULATION OF MANY-CORE PROCES- SORS: INTEGRATION OF RESEARCH AND EDUCATION (2012) (0)
An Immediate Concurrent Execution (ICE) Abstraction Proposal for Many-Cores (2008) (0)
Methods in Parallel Algorithmics (Abstract) (1992) (0)

This paper list is powered by the following services:

Other Resources About Uzi Vishkin

en.wikipedia.org

What Schools Are Affiliated With Uzi Vishkin?

Uzi Vishkin is affiliated with the following schools: