World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
13905
World Ranking
5508
National Ranking
86

Overview

Uri Zwick is affiliated with Tel Aviv University in Israel, specializing in the field of Computer Science with a focus on Computational Theory and Mathematics.

Their research spans several key subfields including:

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Artificial Intelligence
  • Electrical and Electronic Engineering
  • Signal Processing

Uri Zwick's work addresses multiple core topics, notably:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Logic, Reasoning, and Knowledge
  • Algorithms and Data Compression
  • Data Management and Algorithms
  • Advanced Algebra and Logic
  • Semigroups and Automata Theory

They have contributed extensively to research literature, with a significant number of publications across prominent venues. Frequent publication outlets include:

  • arXiv (Cornell University)
  • European Journal of Combinatorics
  • Society for Industrial and Applied Mathematics eBooks
  • SIAM Journal on Computing

Recent papers authored or co-authored by Uri Zwick include:

  • Finding strong components using depth-first search, 2023, European Journal of Combinatorics
  • Optimal energetic paths for electric cars, 2023, arXiv (Cornell University)
  • On the Mysteries of MAX NAE-SAT, 2021, Society for Industrial and Applied Mathematics eBooks
  • Finding Strong Components Using Depth-First Search, 2022, arXiv (Cornell University)
  • Optimal resizable arrays, 2022, arXiv (Cornell University)

Uri Zwick frequently collaborates with a range of researchers. Among their most common coauthors are:

  • Robert E. Tarjan
  • Haim Kaplan
  • Joshua Brakensiek
  • Neng Huang
  • Virginia Vassilevska Williams

Best Publications

  • Color-coding

    Noga Alon;Raphael Yuster;Uri Zwick

  • Approximate distance oracles

    Mikkel Thorup;Uri Zwick

  • Reachability and Distance Queries via 2-Hop Labels

    Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick

  • Finding and counting given length cycles

    Noga Alon;Raphael Yuster;Uri Zwick

  • Compact routing schemes

    Mikkel Thorup;Uri Zwick

  • The complexity of mean payoff games on graphs

    Uri Zwick;Mike Paterson

  • A Deterministic Subexponential Algorithm for Solving Parity Games

    Marcin Jurdziński;Mike Paterson;Uri Zwick

  • All pairs shortest paths using bridging sets and rectangular matrix multiplication

    Uri Zwick

  • All-Pairs Almost Shortest Paths

    Dorit Dor;Shay Halperin;Uri Zwick

  • Fast sparse matrix multiplication

    Raphael Yuster;Uri Zwick

  • A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time

    Liam Roditty;Uri Zwick

  • A 7/8-approximation algorithm for MAX 3SAT?

    H. Karloff;U. Zwick

  • Deterministic Rendezvous in Graphs

    Anders Dessmark;Pierre Fraigniaud;Andrzej Pelc

  • On Dynamic Shortest Paths Problems

    Liam Roditty;Uri Zwick

  • Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor

    Thomas Dueholm Hansen;Peter Bro Miltersen;Uri Zwick

  • Exact and Approximate Distances in Graphs - A Survey

    Uri Zwick

  • Reachability and distance queries via 2-hop labels

    Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick

  • Spanners and emulators with sublinear distance errors

    Mikkel Thorup;Uri Zwick

  • Improved Dynamic Reachability Algorithms for Directed Graphs

    Liam Roditty;Uri Zwick

  • Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences

    Amnon Ta-Shma;Uri Zwick

Frequent Co-Authors

Haim Kaplan
Haim Kaplan Tel Aviv University
Mikkel Thorup
Mikkel Thorup University of Copenhagen
Mike Paterson
Mike Paterson University of Warwick
Eran Halperin
Eran Halperin University of California, Los Angeles
Liam Roditty
Liam Roditty Bar-Ilan University
Raphael Yuster
Raphael Yuster University of Haifa
Edith Cohen
Edith Cohen Tel Aviv University
Robert E. Tarjan
Robert E. Tarjan Princeton University
Noga Alon
Noga Alon Tel Aviv University
Benny Sudakov
Benny Sudakov ETH Zurich

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

Exploring online education can open diverse career pathways within and beyond Computer Science. Programs such as an online bachelor degree offer affordability and flexibility for students starting their journey, letting you learn at your own pace from anywhere.

For those interested in blending computer science with engineering skills, enrolling in an online engineering degree provides a solid foundation for technical roles. The demand for interdisciplinary expertise continues to rise across tech industries.

Ambitious professionals may consider advancing into leadership by pursuing a 1 year executive mba online, which helps develop business acumen while balancing work and study. Executive MBAs are great for those looking to transition into management or entrepreneurship.

Additionally, the digital age has increased opportunities for tech-savvy librarians and information specialists. If you’re drawn to organizing and managing digital information, looking into a master's in library science online cost can help you find an affordable program that fits your career aspirations.

Best Scientists Citing Uri Zwick

Trending Scientists

Recently Published Articles