What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Mathematical analysis
Robert Sedgewick mainly investigates Theoretical computer science, Combinatorics, Algorithm, Analysis of algorithms and Algorithm animation.
His Theoretical computer science research is multidisciplinary, incorporating elements of Tree, Algorithm design and Splay tree.
His Combinatorics research is multidisciplinary, incorporating perspectives in Asymptotic expansion and Pure mathematics.
His work deals with themes such as Graph and String processing, Data structure, which intersect with Algorithm.
His Analysis of algorithms research is multidisciplinary, relying on both Leader election, Mellin transform, Simple and Permutation.
Along with Algorithm animation, other disciplines of study including Workstation, Engineering drawing, Computer graphics and Software are integrated into his research.
His most cited work include:
- Analytic Combinatorics (2651 citations)
- Analytic Combinatorics: RANDOM STRUCTURES (900 citations)
- Algorithms in C (779 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Discrete mathematics, Algorithm, Combinatorics, Analytic combinatorics and Theoretical computer science.
Robert Sedgewick combines subjects such as Analysis of algorithms and Floyd–Warshall algorithm with his study of Discrete mathematics.
His Algorithm study incorporates themes from Graph, Data structure and Spanning tree.
His study in Combinatorics is interdisciplinary in nature, drawing from both Euclidean shortest path, Distance, Yen's algorithm and Shellsort.
The Analytic combinatorics study combines topics in areas such as Extremal combinatorics, Enumerative combinatorics and Algebraic combinatorics.
His Theoretical computer science research includes elements of Insertion sort, Skip list, Splay tree and Heapsort, Sorting algorithm.
He most often published in these fields:
- Discrete mathematics (28.89%)
- Algorithm (22.22%)
- Combinatorics (20.00%)
What were the highlights of his more recent work (between 2006-2017)?
- Analytic combinatorics (17.78%)
- Discrete mathematics (28.89%)
- Combinatorics and physics (7.78%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Analytic combinatorics, Discrete mathematics, Combinatorics and physics, Extremal combinatorics and Algebraic combinatorics.
His work in Analytic combinatorics tackles topics such as Combinatorial class which are related to areas like Field, Presentation, Subject and Management science.
His work in Discrete mathematics covers topics such as Algebra which are related to areas like Analysis of algorithms and Theory of computation.
Robert Sedgewick interconnects Association scheme and Symbolic computation in the investigation of issues within Algebraic combinatorics.
As part of one scientific family, Robert Sedgewick deals mainly with the area of Association scheme, narrowing it down to issues related to the Algorithm engineering, and often Theoretical computer science.
His work is dedicated to discovering how Theoretical computer science, Algorithm are connected with Data structure and Java and other disciplines.
Between 2006 and 2017, his most popular works were:
- Analytic Combinatorics (2651 citations)
- Analytic Combinatorics: RANDOM STRUCTURES (900 citations)
- Introduction to Programming in Java: An Interdisciplinary Approach (40 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Mathematical analysis
His primary areas of investigation include Analytic combinatorics, Combinatorics and physics, Programming paradigm, Extremal combinatorics and Procedural programming.
His Analytic combinatorics study integrates concerns from other disciplines, such as Field, Management science, Applied mathematics and Subject.
Discrete mathematics covers Robert Sedgewick research in Extremal combinatorics.
His Procedural programming research incorporates themes from First-generation programming language, Software engineering, Implementation and Data structure.
His research integrates issues of Analytic function and Monkey saddle in his study of Algebraic combinatorics.
His studies deal with areas such as Java, Theoretical computer science and Modular programming as well as Inductive programming.
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.
