What is he best known for?
The fields of study he is best known for:
- Algorithm
- Operating system
- Combinatorics
His primary scientific interests are in Combinatorics, Algorithm, Data structure, Priority queue and Parallel computing.
Gerth Stølting Brodal has included themes like Discrete mathematics and Multiplication in his Combinatorics study.
Gerth Stølting Brodal regularly links together related areas like Cache-oblivious algorithm in his Algorithm studies.
His Data structure research is multidisciplinary, relying on both Auxiliary memory, Shortest path problem and Pointer machine.
Gerth Stølting Brodal has researched Priority queue in several fields, including Heap, Priority inheritance, Earliest deadline first scheduling and Queue management system.
His Parallel computing study combines topics from a wide range of disciplines, such as Self-balancing binary search tree, Fusion tree, Sorting, Binary search tree and Range tree.
His most cited work include:
- Dynamic planar convex hull (176 citations)
- Algorithms – ESA 2005 (162 citations)
- Cache oblivious search trees via binary trees of small height (122 citations)
What are the main themes of his work throughout his whole career to date?
Gerth Stølting Brodal mostly deals with Combinatorics, Data structure, Discrete mathematics, Algorithm and Binary logarithm.
The various areas that Gerth Stølting Brodal examines in his Combinatorics study include Auxiliary memory and Binary number.
His Data structure research is multidisciplinary, incorporating perspectives in Linear space, Block size, Priority queue, Constant and Cache-oblivious algorithm.
His study explores the link between Cache-oblivious algorithm and topics such as Theoretical computer science that cross with problems in Cache algorithms.
His Discrete mathematics research includes themes of Degree, String, Suffix tree and Binary tree.
His work in the fields of Sorting algorithm, Randomized algorithm, Search tree and Longest common subsequence problem overlaps with other areas such as Subsequence.
He most often published in these fields:
- Combinatorics (48.85%)
- Data structure (39.08%)
- Discrete mathematics (33.91%)
What were the highlights of his more recent work (between 2012-2021)?
- Combinatorics (48.85%)
- Data structure (39.08%)
- Binary logarithm (17.82%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Combinatorics, Data structure, Binary logarithm, Time complexity and Algorithm.
The concepts of his Combinatorics study are interwoven with issues in Heap and Auxiliary memory.
The concepts of his Data structure study are interwoven with issues in Block size and Linear space.
He interconnects Word, Sorting algorithm, Open problem and Integer sorting in the investigation of issues within Binary logarithm.
As a member of one scientific family, Gerth Stølting Brodal mostly works in the field of Time complexity, focusing on Network topology and, on occasion, Binary tree, Tree and Overhead.
He has researched Algorithm in several fields, including Paging and Competitive analysis.
Between 2012 and 2021, his most popular works were:
- tqDist: a library for computing the quartet and triplet distances between binary or general trees (38 citations)
- Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree (17 citations)
- Algorithms for computing the triplet and quartet distances for binary and general trees. (16 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Operating system
- Combinatorics
Algorithm, Binary number, Time complexity, Network topology and Tree are his primary areas of study.
His work on Online algorithm, Randomized algorithm and Theory of computation as part of general Algorithm research is frequently linked to Page replacement algorithm, bridging the gap between disciplines.
His study looks at the relationship between Binary number and fields such as Distance measures, as well as how they intersect with chemical problems.
His Binary logarithm study improves the overall literature in Combinatorics.
His Combinatorics study typically links adjacent topics like Discrete mathematics.
His work deals with themes such as Overhead and Binary tree, which intersect with Time complexity.
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.
