Uzi Vishkin
According to our database^{1},
Uzi Vishkin
authored at least 171 papers
between 1981 and 2019.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1996, "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.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at id.loc.gov

at dl.acm.org
On csauthors.net:
Bibliography
2019
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.
J. Cryptology, 2019
2018
Easy PRAMBased HighPerformance Parallel Programming with ICE.
IEEE Trans. Parallel Distrib. Syst., 2018
Linking parallel algorithmic thinking to manycore memory systems and speedups for boosted decision trees.
Proceedings of the International Symposium on Memory Systems, 2018
2016
FFT on XMT: Case Study of a BandwidthIntensive Regular Algorithm on a HighlyParallel Many Core.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016
POSTER: Easy PRAMbased HighPerformance Parallel Programming with ICE.
Proceedings of the 2016 International Conference on Parallel Architectures and Compilation, 2016
2015
Oblivious Network RAM.
IACR Cryptology ePrint Archive, 2015
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.
Proceedings of the Advances in Cryptology  ASIACRYPT 2015  21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015
2014
Lazy Scheduling: A Runtime Adaptive Scheduler for Declarative Parallelism.
ACM Trans. Program. Lang. Syst., 2014
Parallel algorithms for BurrowsWheeler compression and decompression.
Theor. Comput. Sci., 2014
Is multicore hardware for generalpurpose parallel processing broken?
Commun. ACM, 2014
2013
Brief announcement: truly parallel burrowswheeler compression and decompression.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
2012
Brief announcement: speedups for parallel graph triconnectivity.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012
Better speedups using simpler parallel programming for graph connectivity and biconnectivity.
Proceedings of the 2012 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2012
2011
A LowOverhead Asynchronous Interconnection Network for GALS Chip Multiprocessors.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2011
ResourceAware Compiler Prefetching for FineGrained ManyCores.
International Journal of Parallel Programming, 2011
Using simple abstraction to reinvent computing for parallelism.
Commun. ACM, 2011
Brief announcement: better speedups for parallel maxflow.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011
Panel Statement.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
Toolchain for Programming, Simulating and Studying the XMT ManyCore Architecture.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
PowerPerformance Comparison of SingleTask Driven ManyCores.
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011
Improving RunTime Scheduling for GeneralPurpose Parallel Code.
Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques, 2011
2010
Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience.
Proceedings of the 41st ACM technical symposium on Computer science education, 2010
Lazy binarysplitting: a runtime adaptive workstealing scheduler.
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2010
A LowOverhead Asynchronous Interconnection Network for GALS Chip Multiprocessors.
Proceedings of the NOCS 2010, 2010
ResourceAware Compiler Prefetching for ManyCores.
Proceedings of the Ninth International Symposium on Parallel and Distributed Computing, 2010
Thermal Management of a ManyCore Processor under FineGrained Parallelism.
Proceedings of the EuroPar 2011: Parallel Processing Workshops  CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2010
2009
MeshofTrees and Alternative Interconnection Networks for SingleChip Parallelism.
IEEE Trans. VLSI Syst., 2009
Brief announcement: performance potential of an easytoprogram PRAMonchip prototype versus stateoftheart processor.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009
Algorithmic approach to designing an easytoprogram system: Can it lead to a HWenhanced programmer's workflow addon?
Proceedings of the 27th International Conference on Computer Design, 2009
HPPC 2009 Panel: Are ManyCore Computer Vendors on Track?
Proceedings of the EuroPar 2009, 2009
2008
A pilot study to compare programming effort for two parallel programming models.
Journal of Systems and Software, 2008
XMTGPU: A PRAM Architecture for Graphics Computation.
Proceedings of the 2008 International Conference on Parallel Processing, 2008
An areaefficient highthroughput hybrid interconnection network for singlechip parallel processing.
Proceedings of the 45th Design Automation Conference, 2008
Fpgabased prototype of a pramonchip processor.
Proceedings of the 5th Conference on Computing Frontiers, 2008
2007
Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAMOnChip Platform.
Proceedings of the Handbook of Parallel Computing  Models, Algorithms and Applications., 2007
PRAMonchip: first commitment to silicon.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007
LayoutAccurate Design and Implementation of a HighThroughput Interconnection Network for SingleChip Parallel Processing.
Proceedings of the 15th Annual IEEE Symposium on HighPerformance Interconnects, 2007
Toward Realizing a PRAMonaChip Vision.
Proceedings of the EuroPar 2007 Workshops: Parallel Processing, 2007
2006
Bootstrapping FreeSpace Optical Networks.
IEEE Journal on Selected Areas in Communications, 2006
Case study of gatelevel logic simulation on an extremely finegrained chip multiprocessor.
J. Embedded Computing, 2006
A bootstrapping model for directional wireless networks.
IEEE Communications Letters, 2006
A MeshofTrees Interconnection Network for SingleChip Parallel Processing.
Proceedings of the 2006 IEEE International Conference on ApplicationSpecific Systems, 2006
2005
Bootstrapping FreeSpace Optical Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005
2004
PRAMOnChip: A Quest for NotSoObvious Nonobviousness.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Arbitrateandmove primitives for high throughput onchip interconnection networks.
Proceedings of the 2004 International Symposium on Circuits and Systems, 2004
2003
Towards a First Vertical Prototyping of an Extremely FineGrained Parallel Programming Approach.
Theory Comput. Syst., 2003
Deterministic Resource Discovery in Distributed Networks.
Theory Comput. Syst., 2003
2002
A PrimalDual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
CoRR, 2002
Two techniques for reconciling algorithm parallelism with memory constraints.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002
2001
Towards a first vertical prototyping of an extremely finegrained parallel programming approach.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Deterministic resource discovery in distributed networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Evaluating the XMT Parallel Programming Model.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS01), 2001
What to Do with All this Hardware? (Invited Lecture).
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001
2000
Experiments With List Ranking for Explicit MultiThreaded (XMT) Instruction Parallelism.
ACM Journal of Experimental Algorithmics, 2000
A PRAMonChip Vision (invited abstract).
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000
A nobusywait balanced tree parallel algorithmic paradigm.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
Communication complexity of document exchange.
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
1999
Tradeoffs between Communication Throughput and Parallel Time.
J. Complexity, 1999
Experiments with List Ranking for Explicit MultiThreaded (XMT) Instruction Parallelism.
Proceedings of the Algorithm Engineering, 1999
1998
Explicit MultiThreading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998
1997
From Algorithm Parallelism to InstructionLevel Parallelism: An EncodeDecode Chain Using PrefixSum.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997
ConflictFree Access to Multiple SinglePorted Register Files.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997
Approximate string searching.
Proceedings of the Pattern Matching Algorithms, 1997
1996
Sorting Strings and Constructing Digital Search Trees in Parallel.
Theor. Comput. Sci., 1996
A fast parallel algorithm for finding the convex hull of a sorted point set.
Int. J. Comput. Geometry Appl., 1996
Can Parallel Algorithms Enhance Seriel Implementation?
Commun. ACM, 1996
Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
1995
Almost Fullyparallel Parentheses Matching.
Discrete Applied Mathematics, 1995
Parallel algorithms for database operations and a database operation for parallel algorithms.
Proceedings of IPPS '95, 1995
A note on reducing parallel model simulations to integer sorting.
Proceedings of IPPS '95, 1995
On a Technique for Parsing a String (Abstract).
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995
1994
TopBottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.
SIAM J. Comput., 1994
Finding LevelAncestors in Trees.
J. Comput. Syst. Sci., 1994
A PrimalDual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers.
J. Algorithms, 1994
Biconnectivity Approximations and Graph Carvings.
J. ACM, 1994
On the Parallel Complexity of Digraph Reachability.
Inf. Process. Lett., 1994
On the Detection of Robust Curves.
CVGIP: Graphical Model and Image Processing, 1994
Pattern Matching in a Digitized Image.
Algorithmica, 1994
Symmetry breaking for suffix tree construction.
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Tradeoffs between communication throughput and parallel time.
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix.
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Optimal Parallel Approximation for Prefix Sums and Integer Sorting.
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Can Parallel Algorithms Enhance Serial Implementation?
Proceedings of the 8th International Symposium on Parallel Processing, 1994
Sorting Strings and Constructing Digital Search Trees in Parallel.
Proceedings of the 8th International Symposium on Parallel Processing, 1994
On a ParallelAlgorithms Method for String Matching Problems.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994
1993
On Parallel Integer Merging
Inf. Comput., October, 1993
Recursive StarTree Parallel Data Structure.
SIAM J. Comput., 1993
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.
J. Algorithms, 1993
Approximate Parallel Prefix Computation and its Applications.
Proceedings of the Seventh International Parallel Processing Symposium, 1993
A primaldual parallel approximation technique applied to weighted set and vertex cover.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
Two Dimensional Pattern Matching in a Digitized Image.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993
1992
A Parallel Blocking Flow Algorithm for Acyclic Networks.
J. Algorithms, 1992
Efficient Pattern Matching with Scaling.
J. Algorithms, 1992
Randomized RangeMaxima in NearlyConstant Parallel Time.
Computational Complexity, 1992
Biconnectivity Approximations and Graph Carvings
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Pattern Matching in a Digitized Image.
Proceedings of the Third Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1992
A Case for the PRAM As a Standard Programmer's Model.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992
Methods in Parallel Algorithmics (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Methods in Parallel Algorithmics and Who May Need to Know Them?
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
Randomized RangeMaxima inNearlyConstant Parallel Time.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
1991
Approximate Parallel Scheduling. II. Applications to LogarithmicTime Optimal Parallel Graph Algorithms
Inf. Comput., May, 1991
Can parallel algorithms enhance serial implementation.
SIGACT News, 1991
Deterministic Sampling  A New Technique for Fast Pattern Matching.
SIAM J. Comput., 1991
On Parallel Hashing and Integer Sorting.
J. Algorithms, 1991
Converting High Probability into NearlyConstant Timewith Applications to Parallel Hashing (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Strutural Parallel Algorithmics.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
Towards a Theory of Nearly Constant Time Parallel Algorithms
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm.
Discrete Applied Mathematics, 1990
Deterministic SamplingA New Technique for Fast Pattern Matching
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Efficient Pattern Matching with Scaling.
Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, 1990
On Parallel Hashing and Integer Sorting (Extended Summary).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
Some TriplyLogarithmic Parallel Algorithms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Faster Optimal Parallel Prefix Sums and List Ranking
Inf. Comput., June, 1989
Fast Parallel and Serial Approximate String Matching.
J. Algorithms, 1989
Highly Parallelizable Problems (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Recursive *Tree Parallel DataStructure (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
On Finding a Minimum Dominating Set in a Tournament.
Theor. Comput. Sci., 1988
Matching Patterns in Strings Subject to MultiLinear Transformations.
Theor. Comput. Sci., 1988
On Finding Lowest Common Ancestors: Simplification and Parallelization.
SIAM J. Comput., 1988
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time.
SIAM J. Comput., 1988
Fast String Matching with k Differences.
J. Comput. Syst. Sci., 1988
Locating alignments with k differences for nucleotide and amino acid sequences.
Computer Applications in the Biosciences, 1988
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time.
Algorithmica, 1988
Parallel Construction of a Suffix Tree with Applications.
Algorithmica, 1988
On Finding Lowest Common Ancestors: Simplification and Parallelization.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
Efficient Parallel Triconnectivity in Logarithmic Time.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Tight Comparison Bounds on the Complexity of Parallel Sorting.
SIAM J. Comput., 1987
Randomized Parallel Speedups for List Ranking.
J. Parallel Distrib. Comput., 1987
Parallel Construction of a Suffix Tree (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking
Information and Control, July, 1986
Parallel Ear Decomposition Search (EDS) and stNumbering in Graphs.
Theor. Comput. Sci., 1986
Efficient String Matching with k Mismatches.
Theor. Comput. Sci., 1986
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
Nucleic Acids Research, 1986
Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
Tight Complexity Bounds for Parallel Comparison Sorting
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
Parallel Ear Decomposition Search (EDS) and StNumbering in Graphs (Extended Abstract).
Proceedings of the VLSI Algorithms and Architectures, 1986
1985
Optimal Parallel Generation of a Computation Tree Form.
ACM Trans. Program. Lang. Syst., 1985
TradeOffs Between Depth and Width in Parallel Computation.
SIAM J. Comput., 1985
An Efficient Parallel Biconnectivity Algorithm.
SIAM J. Comput., 1985
On Efficient Parallel Strong Orientation.
Inf. Process. Lett., 1985
Optimal Parallel Pattern Matching in Strings
Information and Control, 1985
Efficient implementation of a shifting algorithm.
Discrete Applied Mathematics, 1985
Solving NPhard problems in 'almost trees': Vertex cover.
Discrete Applied Mathematics, 1985
Optimal Parallel Pattern Matching in Strings (Extended Summary).
Proceedings of the Automata, 1985
Efficient String Matching in the Presence of Errors
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
A ParallelDesign DistributedImplementation (PDDI) GeneralPurpose Computer.
Theor. Comput. Sci., 1984
Simulation of Parallel Random Access Machines by Circuits.
SIAM J. Comput., 1984
Constant Depth Reducibility.
SIAM J. Comput., 1984
Finding Euler Tours in Parallel.
J. Comput. Syst. Sci., 1984
Solving NPHard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.
J. ACM, 1984
An optimal parallel connectivity algorithm.
Discrete Applied Mathematics, 1984
Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories.
Acta Inf., 1984
Randomized SpeedUps in Parallel Computation
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
Dynamic Parallel Memories
Information and Control, March, 1983
An efficient distributed orientation algorithm.
IEEE Trans. Information Theory, 1983
Implementation of Simultaneous Memory Address Access in Models That Forbid It.
J. Algorithms, 1983
Parallel Computation on 23Trees.
ITA, 1983
Granularity of Memory in Parallel Computation.
Proceedings of the WG '83, 1983
Parallel Dictionaries in 23 Trees.
Proceedings of the Automata, 1983
TradeOffs between Depth and Width in Parallel Computation (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
An O(n² log n) Parallel MAXFLOW Algorithm.
J. Algorithms, 1982
An O(log n) Parallel Connectivity Algorithm.
J. Algorithms, 1982
Complexity of Finding kPathFree Dominating Sets in Graphs.
Inf. Process. Lett., 1982
Golden ratios in a pairs covering problem.
Discrete Mathematics, 1982
A Complexity Theory for Unbounded FanIn Parallelism
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model.
J. Algorithms, 1981
Finding the maximum, merging and sorting in a parallel computation model.
Proceedings of the CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, 1981