- Home
- Top Scientists - Computer Science
- J. Ian Munro

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
41
Citations
7,538
180
World Ranking
4361
National Ranking
193

2003 - Fellow of the Royal Society of Canada Academy of Science

- 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.

- 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)

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.

- Combinatorics (54.87%)
- Discrete mathematics (26.35%)
- Algorithm (24.19%)

- Combinatorics (54.87%)
- Succinct data structure (16.25%)
- Binary logarithm (10.47%)

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.

- 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)

- 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.

Frequency Estimation of Internet Packet Streams with Limited Space

Erik D. Demaine;Alejandro Lopez-Ortiz;J. Ian Munro.

european symposium on algorithms **(2002)**

581 Citations

Succinct Representation of Balanced Parentheses and Static Trees

J. Ian Munro;Venkatesh Raman.

SIAM Journal on Computing **(2002)**

372 Citations

Efficient suffix trees on secondary storage

David R. Clark;J. Ian Munro.

symposium on discrete algorithms **(1996)**

298 Citations

Representing Trees of Higher Degree

David Benoit;Erik D. Demaine;J. Ian Munro;Rajeev Raman.

Algorithmica **(2005)**

285 Citations

Adaptive set intersections, unions, and differences

Erik D. Demaine;Alejandro López-Ortiz;J. Ian Munro.

symposium on discrete algorithms **(2000)**

235 Citations

Rank/select operations on large alphabets: a tool for text indexing

Alexander Golynski;J. Ian Munro;S. Srinivasa Rao.

symposium on discrete algorithms **(2006)**

222 Citations

Space Efficient Suffix Trees

J.Ian Munro;Venkatesh Raman;S.Srinivasa Rao.

foundations of software technology and theoretical computer science **(1998)**

189 Citations

Identifying frequent items in sliding windows over on-line packet streams

Lukasz Golab;David DeHaan;Erik D. Demaine;Alejandro Lopez-Ortiz.

internet measurement conference **(2003)**

187 Citations

Membership in Constant Time and Almost-Minimum Space

Andrej Brodnik;J. Ian Munro.

SIAM Journal on Computing **(1999)**

175 Citations

Cache-oblivious priority queue and graph algorithm applications

Lars Arge;Michael A. Bender;Erik D. Demaine;Bryan Holland-Minkley.

symposium on the theory of computing **(2002)**

156 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Institute of Mathematical Sciences

MIT

University of Chile

ETH Zurich

University of Illinois at Urbana-Champaign

University of Leicester

University of California, Riverside

University of California, Riverside

University of Mississippi

Max Planck Institute for Informatics

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.