2003 - Fellow of the Royal Society of Canada Academy of Science
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.
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.
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.
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.
Lecture Notes in Computer Science (2002)
Succinct Representation of Balanced Parentheses and Static Trees
J. Ian Munro;Venkatesh Raman.
SIAM Journal on Computing (2002)
Efficient suffix trees on secondary storage
David R. Clark;J. Ian Munro.
symposium on discrete algorithms (1996)
Representing Trees of Higher Degree
David Benoit;Erik D. Demaine;J. Ian Munro;Rajeev Raman.
Adaptive set intersections, unions, and differences
Erik D. Demaine;Alejandro López-Ortiz;J. Ian Munro.
symposium on discrete algorithms (2000)
Rank/select operations on large alphabets: a tool for text indexing
Alexander Golynski;J. Ian Munro;S. Srinivasa Rao.
symposium on discrete algorithms (2006)
Space Efficient Suffix Trees
J.Ian Munro;Venkatesh Raman;S.Srinivasa Rao.
Journal of Algorithms (2001)
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)
Membership in Constant Time and Almost-Minimum Space
Andrej Brodnik;J. Ian Munro.
SIAM Journal on Computing (1999)
Self-Organizing Binary Search Trees
Brian Allen;Ian Munro.
Journal of the ACM (1978)
If you think any of the details on this page are incorrect, let us know.
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: