Uzi Vishkin
Affiliations: University of Maryland, College Park, USA
According to our database^{1},
Uzi Vishkin
authored at least 162 papers
between 1981 and 2022.
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
Online presence:

on id.loc.gov

on dl.acm.org
On csauthors.net:
Bibliography
2022
Commun. ACM, 2022
ImmunoTyperSR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes Using Short Read Data.
Proceedings of the Research in Computational Molecular Biology, 2022
Proceedings of the PMAM@PPoPP 2022: Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores, Virtual Event / Seoul, Republic of Korea, April 2, 2022
2021
ACM Trans. Parallel Comput., 2021
SPAA'21 Panel Paper: ArchitectureFriendly Algorithms versus AlgorithmFriendly Architectures.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021
Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2019
J. Cryptol., 2019
2018
IEEE Trans. Parallel Distributed 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
Proceedings of the 2016 International Conference on Parallel Architectures and Compilation, 2016
2015
IACR Cryptol. ePrint Arch., 2015
2014
ACM Trans. Program. Lang. Syst., 2014
Theor. Comput. Sci., 2014
Commun. ACM, 2014
2013
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
2012
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. Comput. Aided Des. Integr. Circuits Syst., 2011
Int. J. Parallel Program., 2011
Commun. ACM, 2011
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011
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
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011
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
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2010
Proceedings of the Ninth International Symposium on Parallel and Distributed Computing, 2010
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. Very Large Scale Integr. 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
Proceedings of the EuroPar 2009, 2009
2008
J. Syst. Softw., 2008
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
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
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
Proceedings of the EuroPar 2007 Workshops: Parallel Processing, 2007
2006
IEEE J. Sel. Areas Commun., 2006
Case study of gatelevel logic simulation on an extremely finegrained chip multiprocessor.
J. Embed. Comput., 2006
IEEE Commun. Lett., 2006
Proceedings of the 2006 IEEE International Conference on ApplicationSpecific Systems, 2006
2004
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
Theory Comput. Syst., 2003
2002
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002
2001
Proceedings of the HighLevel Parallel Programming Models and Supportive Environments, 2001
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001
2000
Experiments With List Ranking for Explicit MultiThreaded (XMT) Instruction Parallelism.
ACM J. Exp. Algorithmics, 2000
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
1999
J. Complex., 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
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997
Approximate string searching.
Proceedings of the Pattern Matching Algorithms, 1997
1996
Theor. Comput. Sci., 1996
Int. J. Comput. Geom. Appl., 1996
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
Discret. Appl. Math., 1995
Parallel algorithms for database operations and a database operation for parallel algorithms.
Proceedings of IPPS '95, 1995
Proceedings of IPPS '95, 1995
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995
1994
SIAM J. Comput., 1994
J. Comput. Syst. Sci., 1994
A PrimalDual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers.
J. Algorithms, 1994
J. ACM, 1994
Inf. Process. Lett., 1994
CVGIP Graph. Model. Image Process., 1994
Algorithmica, 1994
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
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994
1993
Inf. Comput., October, 1993
SIAM J. Comput., 1993
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.
J. Algorithms, 1993
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
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993
1992
J. Algorithms, 1992
J. Algorithms, 1992
Comput. Complex., 1992
Proceedings of the Parallel Architectures and Their Efficient Use, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
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
SIGACT News, 1991
SIAM J. Comput., 1991
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
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
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.
Discret. Appl. Math., 1990
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Inf. Comput., June, 1989
J. Algorithms, 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Theor. Comput. Sci., 1988
Theor. Comput. Sci., 1988
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
J. Comput. Syst. Sci., 1988
Comput. Appl. Biosci., 1988
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time.
Algorithmica, 1988
Algorithmica, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
SIAM J. Comput., 1987
J. Parallel Distributed Comput., 1987
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Inf. Control., July, 1986
Theor. Comput. Sci., 1986
Theor. Comput. Sci., 1986
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
Nucleic Acids Res., 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
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
ACM Trans. Program. Lang. Syst., 1985
SIAM J. Comput., 1985
SIAM J. Comput., 1985
Inf. Process. Lett., 1985
Inf. Control., 1985
Discret. Appl. Math., 1985
Discret. Appl. Math., 1985
Proceedings of the Automata, 1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
Theor. Comput. Sci., 1984
SIAM J. Comput., 1984
SIAM J. Comput., 1984
J. Comput. Syst. Sci., 1984
Solving NPHard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.
J. ACM, 1984
Discret. Appl. Math., 1984
Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories.
Acta Informatica, 1984
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
Inf. Control., March, 1983
IEEE Trans. Inf. Theory, 1983
J. Algorithms, 1983
RAIRO Theor. Informatics Appl., 1983
Granularity of Memory in Parallel Computation.
Proceedings of the WG '83, 1983
Proceedings of the Automata, 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
J. Algorithms, 1982
J. Algorithms, 1982
Inf. Process. Lett., 1982
Discret. Math., 1982
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
PhD thesis, 1981
J. Algorithms, 1981