What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Algebra
His primary scientific interests are in Combinatorics, Algorithm, Upper and lower bounds, Constant and Discrete mathematics.
J. Ian Munro mostly deals with Representation in his studies of Combinatorics.
His Algorithm study incorporates themes from Binary logarithm, Implicit data structure, Simple and Queue, Priority queue.
His studies deal with areas such as Multiset, Multiplicity and Mode as well as Upper and lower bounds.
His Constant study combines topics from a wide range of disciplines, such as Space, Negative integer and Permutation.
His work on Multiplicative constant as part of general Discrete mathematics research is frequently linked to Star-shaped polygon, thereby connecting diverse disciplines of science.
His most cited work include:
- Frequency Estimation of Internet Packet Streams with Limited Space (455 citations)
- Succinct Representation of Balanced Parentheses and Static Trees (295 citations)
- Representing Trees of Higher Degree (215 citations)
What are the main themes of his work throughout his whole career to date?
J. Ian Munro mainly investigates Combinatorics, Discrete mathematics, Algorithm, Upper and lower bounds and Succinct data structure.
His study in Combinatorics is interdisciplinary in nature, drawing from both Space, Range and Constant.
J. Ian Munro combines subjects such as Sequence, Range query and Adjacency list with his study of Discrete mathematics.
His Algorithm research incorporates elements of Point and Implicit data structure.
His Upper and lower bounds research incorporates themes from Selection algorithm and Entropy.
His research investigates the connection between Succinct data structure and topics such as Theoretical computer science that intersect with problems in Binary relation and Binary search algorithm.
He most often published in these fields:
- Combinatorics (54.87%)
- Discrete mathematics (26.35%)
- Algorithm (24.19%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (54.87%)
- Succinct data structure (16.25%)
- Binary logarithm (10.47%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Combinatorics, Succinct data structure, Binary logarithm, Discrete mathematics and Time complexity.
J. Ian Munro interconnects Space, Upper and lower bounds, Range and Sequence in the investigation of issues within Combinatorics.
He has included themes like Rank, Tree traversal, Tree, Chordal graph and Interval in his Succinct data structure study.
His research integrates issues of Optimal binary search tree, Bounded function and Splay tree in his study of Binary logarithm.
His Discrete mathematics study integrates concerns from other disciplines, such as Entropy and Binary tree.
The various areas that J. Ian Munro examines in his Time complexity study include Recurrence relation, Representation and Compressed suffix array.
Between 2016 and 2021, his most popular works were:
- Space-efficient construction of compressed indexes in deterministic linear time (28 citations)
- Succinct Representation of Data Structures (11 citations)
- Succinct Data Structures for Chordal Graphs (7 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Algebra
His primary areas of investigation include Combinatorics, Succinct data structure, Upper and lower bounds, Discrete mathematics and Space.
His Combinatorics research is multidisciplinary, relying on both Element, Equivalence class and Order.
His Succinct data structure study combines topics in areas such as Vertex, Sequence, Strongly connected component and Chordal graph.
His research in Upper and lower bounds intersects with topics in Selection algorithm, Radix sort and Integer sorting.
His Discrete mathematics research includes themes of Sorting, Entropy, Generalization and Computation.
His biological study spans a wide range of topics, including Range and Compressed suffix array.
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.
