What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- Color-coding (762 citations)
- Approximate distance oracles (535 citations)
- Finding and counting given length cycles (495 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (76.14%)
- Discrete mathematics (47.72%)
- Algorithm (17.26%)
What were the highlights of his more recent work (between 2013-2021)?
- Combinatorics (76.14%)
- Discrete mathematics (47.72%)
- Binary logarithm (11.17%)
In recent papers he was focusing on the following fields of study:
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.
Between 2013 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
