- Home
- Best Scientists - Computer Science
- Uri Zwick

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
44
Citations
12,209
149
World Ranking
4714
National Ranking
86

- Combinatorics
- Algorithm
- Discrete mathematics

Combinatorics, Discrete mathematics, Shortest path problem, Graph and Floyd–Warshall algorithm are his primary areas of study. His work on Maximum cut is typically connected to Parity game as part of general Combinatorics study, connecting several disciplines of science. His work carried out in the field of Discrete mathematics brings together such families of science as Shortest Path Faster Algorithm and Algorithm.

His work in Shortest path problem addresses subjects such as Tree, which are connected to disciplines such as Dense graph, Girth and Quotient. Uri Zwick has included themes like Additive error, Graph theory, Sublinear function and Conjecture in his Graph study. His work deals with themes such as Graph and Cycle graph, which intersect with Directed graph.

- Color-coding (762 citations)
- Approximate distance oracles (535 citations)
- Finding and counting given length cycles (495 citations)

Uri Zwick mainly focuses on Combinatorics, Discrete mathematics, Algorithm, Upper and lower bounds and Directed graph. His study involves Binary logarithm, Time complexity, Approximation algorithm, Floyd–Warshall algorithm and Graph, a branch of Combinatorics. As part of one scientific family, Uri Zwick deals mainly with the area of Floyd–Warshall algorithm, narrowing it down to issues related to the Shortest Path Faster Algorithm, and often Yen's algorithm and Johnson's algorithm.

As part of the same scientific family, he usually focuses on Discrete mathematics, concentrating on Matrix multiplication and intersecting with Multiplication. His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Linear programming and Function. His Directed graph research includes elements of Vertex, Feedback arc set and Strength of a graph.

- Combinatorics (76.14%)
- Discrete mathematics (47.72%)
- Algorithm (17.26%)

- Combinatorics (76.14%)
- Discrete mathematics (47.72%)
- Binary logarithm (11.17%)

His primary areas of investigation include Combinatorics, Discrete mathematics, Binary logarithm, Amortized analysis and Heap. He brings together Combinatorics and Expected value to produce work in his papers. His studies in Discrete mathematics integrate themes in fields like Function and Sorting algorithm.

His Binary logarithm research incorporates elements of Vertex and Undirected graph. In general Amortized analysis, his work in Proof of O time complexity of union–find is often linked to Ackermann function linking many areas of study. The concepts of his Heap study are interwoven with issues in Fibonacci heap and Pairing heap.

- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (51 citations)
- A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (29 citations)
- Adjacency Labeling Schemes and Induced-Universal Graphs (19 citations)

- Algorithm
- Combinatorics
- Algebra

Uri Zwick focuses on Combinatorics, Discrete mathematics, Randomized algorithm, Algorithm and Function. In his study, Upper and lower bounds is strongly linked to Linear programming, which falls under the umbrella field of Combinatorics. His research on Discrete mathematics focuses in particular on Independent set.

His Randomized algorithm research incorporates themes from Abstraction, Satisfiability, Enhanced Data Rates for GSM Evolution, Unique sink orientation and Computational problem. His biological study spans a wide range of topics, including Mixed graph, Multiple edges, Feedback arc set and Hopcroft–Karp algorithm. His study in Function is interdisciplinary in nature, drawing from both Communications protocol, Theoretical computer science, Communication complexity and Protocol.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Color-coding

Noga Alon;Raphael Yuster;Uri Zwick.

Journal of the ACM **(1995)**

1183 Citations

Color-coding

Noga Alon;Raphael Yuster;Uri Zwick.

Journal of the ACM **(1995)**

1183 Citations

Approximate distance oracles

Mikkel Thorup;Uri Zwick.

Journal of the ACM **(2005)**

1102 Citations

Approximate distance oracles

Mikkel Thorup;Uri Zwick.

Journal of the ACM **(2005)**

1102 Citations

Reachability and Distance Queries via 2-Hop Labels

Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick.

SIAM Journal on Computing **(2003)**

713 Citations

Reachability and Distance Queries via 2-Hop Labels

Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick.

SIAM Journal on Computing **(2003)**

713 Citations

Finding and counting given length cycles

Noga Alon;Raphael Yuster;Uri Zwick.

Algorithmica **(1997)**

670 Citations

Finding and counting given length cycles

Noga Alon;Raphael Yuster;Uri Zwick.

Algorithmica **(1997)**

670 Citations

Compact routing schemes

Mikkel Thorup;Uri Zwick.

acm symposium on parallel algorithms and architectures **(2001)**

668 Citations

Compact routing schemes

Mikkel Thorup;Uri Zwick.

acm symposium on parallel algorithms and architectures **(2001)**

668 Citations

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

Contact us

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:

Tel Aviv University

University of Copenhagen

University of Warwick

University of California, Los Angeles

University of Haifa

Tel Aviv University

Princeton University

Tel Aviv University

ETH Zurich

Kiel University

National Institute of Informatics

Fritz Haber Institute of the Max Planck Society

Xiangtan University

CisThera (United States)

Ottawa Hospital

University of Kentucky

Wayne State University

Boston Children's Hospital

University of Rochester Medical Center

Université Paris Cité

Harvard University

Rush University Medical Center

University of Sydney

University of Melbourne

University of Cape Town

University of Cambridge

Something went wrong. Please try again later.