What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Programming language
Robert E. Tarjan mainly focuses on Combinatorics, Algorithm, Discrete mathematics, Spanning tree and Time complexity.
His works in Directed graph, Line graph, Binary logarithm, Planar graph and Graph theory are all subjects of inquiry into Combinatorics.
The various areas that Robert E. Tarjan examines in his Algorithm study include Theoretical computer science, Shortest path problem, Integer, Disjoint sets and Floyd–Warshall algorithm.
His Spanning tree study combines topics in areas such as Fibonacci heap, Graph, Data structure and Minimum spanning tree.
In his research, Amortized analysis is intimately related to Min-max heap, which falls under the overarching field of Fibonacci heap.
His work carried out in the field of Time complexity brings together such families of science as Linear space and Chordal graph.
His most cited work include:
- Depth-First Search and Linear Graph Algorithms (4695 citations)
- Fibonacci heaps and their uses in improved network optimization algorithms (2209 citations)
- Amortized efficiency of list update and paging rules (1828 citations)
What are the main themes of his work throughout his whole career to date?
Robert E. Tarjan spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, Data structure and Time complexity.
Much of his study explores Combinatorics relationship to Amortized analysis.
Robert E. Tarjan combines subjects such as Heap and Fibonacci heap with his study of Discrete mathematics.
His Algorithm study integrates concerns from other disciplines, such as Graph, Theoretical computer science, Maximum flow problem, Shortest path problem and Simple.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Weight-balanced tree and Ternary search tree.
Robert E. Tarjan usually deals with Maximum flow problem and limits it to topics linked to Push–relabel maximum flow algorithm and Flow network.
He most often published in these fields:
- Combinatorics (55.79%)
- Discrete mathematics (38.77%)
- Algorithm (36.17%)
What were the highlights of his more recent work (between 2011-2021)?
- Combinatorics (55.79%)
- Discrete mathematics (38.77%)
- Algorithm (36.17%)
In recent papers he was focusing on the following fields of study:
Robert E. Tarjan mostly deals with Combinatorics, Discrete mathematics, Algorithm, Disjoint sets and Data structure.
His Combinatorics research is multidisciplinary, incorporating perspectives in AVL tree, Amortized analysis and Set.
His Discrete mathematics research incorporates elements of Fibonacci heap, Pairing heap, Skew heap, d-ary heap and Control flow graph.
His biological study spans a wide range of topics, including Maximum flow problem and Connected component.
In his study, Concurrent algorithm, Sequential algorithm and Parallel random-access machine is strongly linked to Ackermann function, which falls under the umbrella field of Disjoint sets.
His studies in Data structure integrate themes in fields like Class, Upper and lower bounds and Pointer.
Between 2011 and 2021, his most popular works were:
- Software self-checking systems and methods (151 citations)
- Finding Minimum-cost Flows by Double Scaling (108 citations)
- Improved Time Bounds for the Maximum Flow Problem (97 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Operating system
His main research concerns Discrete mathematics, Algorithm, Combinatorics, Disjoint sets and Maximum flow problem.
His Discrete mathematics research incorporates themes from Scapegoat tree, Binomial heap, Skew heap, d-ary heap and AVL tree.
Robert E. Tarjan has researched Algorithm in several fields, including Flow and Numerical analysis.
His Combinatorics research is multidisciplinary, incorporating elements of Amortized analysis and Data analysis.
His Disjoint sets research includes themes of Span tree, Construct, Rank and Independent spanning trees.
His Maximum flow problem research is multidisciplinary, relying on both Segmentation, Object, Adjacency list, Series and Integer.
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.
