World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
63
Citations
14155
World Ranking
2784
National Ranking
1376

Research.com Recognitions

  • 1996 - ACM Fellow 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.

Overview

Uzi Vishkin is affiliated with the University of Maryland, College Park in the United States. Their research primarily spans the field of Computer Science, with significant contributions in several subfields including Artificial Intelligence, Immunology, Molecular Biology, Computer Vision and Pattern Recognition, and Hardware and Architecture.

The scientist's work covers multiple topics, notably T-cell and B-cell Immunology, vaccines and immunoinformatics approaches, machine learning and data classification, advanced neural network applications, logic, programming, and type systems. Additional areas include immunodeficiency and autoimmune disorders, as well as machine learning applications in materials science.

Recent publication venues featuring their work include arXiv (Cornell University), Cell Systems, ACM Transactions on Parallel Computing, bioRxiv (Cold Spring Harbor Laboratory), and Communications of the ACM. The scholar has several frequent coauthors, such as Ananth Hari, Oscar L. Rodriguez, Junyan Xu, Justin Lack, and Cihan Oguz.

Selected recent papers by Uzi Vishkin are:

  • ImmunoTyper-SR: A computational approach for genotyping immunoglobulin heavy chain variable genes using short-read data, 2022, Cell Systems
  • Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks, 2021, arXiv (Cornell University)
  • Study of Fine-grained Nested Parallelism in CDCL SAT Solvers, 2021, ACM Transactions on Parallel Computing
  • ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes using Short Read Data, 2022, bioRxiv (Cold Spring Harbor Laboratory)

In 1996, Uzi Vishkin was recognized as an ACM Fellow for contributions in parallel algorithms research, identified as a pioneer in shaping the understanding of parallelism in the fundamental theory of Computer Science.

Best Publications

  • An O(logn) parallel connectivity algorithm

    Yossi Shiloach;Uzi Vishkin

  • On Finding Lowest Common Ancestors: Simplification and Parallelization

    Baruch Schieber;Uzi Vishkin

  • An Efficient Parallel Biconnectivity Algorithm

    Robert Endre Tarjan;Uzi Vishkin

  • Deterministic coin tossing with applications to optimal parallel list ranking

    Richard Cole;Uzi Vishkin;Uzi Vishkin

  • Fast parallel and serial approximate string matching

    G. M. Landau;U. Vishkin

  • Constant Depth Reducibility

    Ashok K. Chandra;Larry J. Stockmeyer;Uzi Vishkin

  • Finding the maximum, merging and sorting in a parallel computation model

    Yossi Shiloach;Uzi Vishkin

  • Biconnectivity approximations and graph carvings

    Samir Khuller;Uzi Vishkin

  • Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

    Kurt Mehlhorn;Uzi Vishkin

  • Finding biconnected componemts and computing tree functions in logarithmic parallel time

    R.E. Tarjan;U. Vishkin

  • An O ( n 2 log n ) parallel max-flow algorithm

    Yossi Shiloach;Uzi Vishkin

  • Faster optimal parallel prefix sums and list ranking

    Richard Cole;Uzi Vishkin

  • Fast string matching with k -differences

    Gad M. Landau;Uzi Vishkin

  • Approximate and exact parallel scheduling with applications to list, tree and graph problems

    Richard Cole;Uzi Vishkin

  • Simulation of Parallel Random Access Machines by Circuits

    Larry J. Stockmeyer;Uzi Vishkin

  • Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

    R Cole;U Vishkin

  • Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

    Richard Cole;Uzi Vishkin

  • Efficient String Matching With K Mismatches

    G M Landau;U Vishkin

  • Recursive star-tree parallel data structure

    Omer Berkman;Uzi Vishkin

  • Parallel construction of a suffix tree with applications

    A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber

Frequent Co-Authors

Gad M. Landau
Gad M. Landau University of Haifa
Baruch Schieber
Baruch Schieber New Jersey Institute of Technology
Yossi Matias
Yossi Matias Google (United States)
Richard Cole
Richard Cole New York University
Gang Qu
Gang Qu University of Maryland, College Park
Samir Khuller
Samir Khuller Northwestern University
Joseph JaJa
Joseph JaJa University of Maryland, College Park
Chau-Wen Tseng
Chau-Wen Tseng University of Maryland, College Park
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Ruth Nussinov
Ruth Nussinov National Institutes of Health

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As you consider a future in Computer Science, it’s worth exploring related online degrees and career options. Many students choose to enhance their skills or transition into other fields by pursuing advanced or specialized degrees online.

For tech professionals considering leadership roles, the best online executive mba programs offer a valuable blend of business and technology management. Those interested in data organization or information management might look at a library degree to complement their technical background.

Cost is a common concern, but there are increasingly cheap online master's programs available in numerous fields, making further study more accessible. For those aiming at the highest levels of leadership, an online doctorate like the phd in leadership online can prepare graduates for executive or academic careers.

Exploring these pathways can help Computer Science graduates diversify their expertise and open up new possibilities in the evolving job market.

Best Scientists Citing Uzi Vishkin

Trending Scientists