J. Ian Munro

发表

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space pdf

J. Ian Munro, Sebastian Wild, 2019, ArXiv.

Succinct Data Structures for Path Queries

J. Ian Munro, Meng He, Gelin Zhou, 2012, ESA.

An Efficient Algorithm for Partial Order Production

Jean Cardinal, Raphaël M. Jungers, J. Ian Munro, 2010, SIAM J. Comput..

The Distance 4-Sector of Two Points Is Unique

Alejandro López-Ortiz, J. Ian Munro, Robert Fraser, 2013, ISAAC.

Selection from Read-Only Memory and Sorting with Optimum Data Movement

Venkatesh Raman, J. Ian Munro, J. I. Munro, 1992, FSTTCS.

Deterministic skip lists

J. Ian Munro, Robert Sedgewick, Thomas Papadakis, 1992, SODA '92.

Sorting and Selection with Equality Comparisons

S. Srinivasa Rao, Venkatesh Raman, J. Ian Munro, 2015, WADS.

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima pdf

Rajeev Raman, J. Ian Munro, Arash Farzan, 2012, ICALP.

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture

Johan Karlsson, J. Ian Munro, Andrej Brodnik, 2006, IFIP TCS.

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets

J. Ian Munro, Meng He, Gelin Zhou, 2012, ISAAC.

Searchability in merging and implicit data structures

J. Ian Munro, Patricio V. Poblete, 1987, BIT Comput. Sci. Sect..

An Implicit Binomial Queue with Constant Insertion Time

J. Ian Munro, Patricio V. Poblete, Svante Carlsson, 1988, SWAT.

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

S. Srinivasa Rao, J. Ian Munro, Alexander Golynski, 2006, SODA '06.

Integer Representation and Counting in the Bit Probe Model

J. Ian Munro, M. Ziaur Rahman, 2007, ISAAC.

Untangled Monotonic Chains and Adaptive Range Search

Stephane Durocher, Alejandro López-Ortiz, J. Ian Munro, 2009, ISAAC.

The Complexity of Partial Orders

J. Ian Munro, 2012, ALENEX.

The Parallel Complexity of Arithmetic Computation

J. Ian Munro, 1977, FCT.

Exegesis of Self-Organizing Linear Search

Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda, 1981, SIAM J. Comput..

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s)

J. Ian Munro, Patricio V. Poblete, Walter Cunto, 1991, WADS.

Proximity on a grid: Preliminary version

J. Ian Munro, Rolf G. Karlsson, 1984 .

In search of the fastest algorithm

J. Ian Munro, 1973, AFIPS National Computer Conference.

Data Manipulations Based on Orderings

J. Ian Munro, J. Ian Munro, 1989 .

Fast stable in-place sorting withO(n) data moves

Venkatesh Raman, J. Ian Munro, J. I. Munro, 1996, Algorithmica.

Integer Representation and Counting in the Bit Probe Model

J. Ian Munro, M. Ziaur Rahman, 2008, Algorithmica.

Technical Note - Reducing Space Requirements for Shortest Path Problems

J. Ian Munro, Raúl J. Ramírez, J. Munro, 1982, Oper. Res..

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs pdf

J. Ian Munro, Sebastian Wild, 2018, ESA.

Optimal Search Trees with 2-Way Comparisons

Marek Chrobak, J. Ian Munro, Mordecai J. Golin, 2015, ISAAC.

Adaptive Data Structures for Permutations and Binary Relations

J. Ian Munro, Francisco Claude, 2013, SPIRE.

Succinct ordinal trees based on tree covering

S. Srinivasa Rao, J. Ian Munro, Meng He, 2012, TALG.

Some results concerning efficient and optimal algorithms

J. Ian Munro, 1971, STOC '71.

Permuting in Place

Faith Ellen, J. Ian Munro, Patricio V. Poblete, 1995, SIAM J. Comput..

Analysis of the Expected Search Cost in Skip Lists

J. Ian Munro, Patricio V. Poblete, Thomas Papadakis, 1990, SWAT.

Robot Localization without Depth Perception

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, 2002, SWAT.

Range Majorities and Minorities in Arrays pdf

Gonzalo Navarro, J. Ian Munro, Travis Gagie, 2016, Algorithmica.

Cache-Oblivious Comparison-Based Algorithms on Multisets

Gianni Franceschini, J. Ian Munro, Arash Farzan, 2005, ESA.

Succinct Data Structures ... Potential for Symbolic Computation?

J. Ian Munro, J. Munro, 2016, ISSAC.

An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms

Michael A. Bender, Erik D. Demaine, J. Ian Munro, 2007, SIAM J. Comput..

Partial Match Retrieval in Implicit Data Structures

Kurt Mehlhorn, J. Ian Munro, Helmut Alt, 1981, Inf. Process. Lett..

Succinct Data Structures for Representing Equivalence Classes pdf

Moshe Lewenstein, Venkatesh Raman, J. Ian Munro, 2013, ISAAC.

Fast Allocation and Deallocation with an Improved Buddy System

Erik D. Demaine, J. Ian Munro, 1999, FSTTCS.

Sorting with Minimum Data Movement

Venkatesh Raman, J. Ian Munro, J. I. Munro, 1992, J. Algorithms.

The Nearest Neighbor Problem on Bounded Domains

J. Ian Munro, Edward L. Robertson, Rolf G. Karlsson, 1985, ICALP.

On the Succinct Representation of Unlabeled Permutations

J. Ian Munro, Siwei Yang, Hicham El-Zein, 2015, ISAAC.

Continual Pattern Replication

J. Ian Munro, Edward L. Robertson, 1981, Inf. Control..

Succinct representation of dynamic trees

J. Ian Munro, Arash Farzan, 2011, Theor. Comput. Sci..

Succinct representations of permutations and functions

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2011, Theor. Comput. Sci..

Dynamic Data Structures for Document Collections and Graphs

Jeffrey Scott Vitter, J. Ian Munro, Yakov Nekrich, 2015, PODS.

Raising Permutations to Powers in Place

Matthew Robertson, J. Ian Munro, Hicham El-Zein, 2016, ISAAC.

Efficient Ordering of Hash Tables

Gaston H. Gonnet, J. Ian Munro, 1979, SIAM J. Comput..

Compressed Representations of Graphs

J. Ian Munro, Patrick K. Nicholson, J. Munro, 2016, Encyclopedia of Algorithms.

Sorting under partial information (without the ellipsoid algorithm)

Jean Cardinal, Raphaël M. Jungers, J. Ian Munro, 2013, Comb..

Deterministic SkipNet

J. Ian Munro, Nicholas J. A. Harvey, J. Munro, 2004, Inf. Process. Lett..

Optimum reorganization points for arbitrary database costs

Frank Wm. Tompa, J. Ian Munro, Raúl J. Ramírez, 2004, Acta Informatica.

Permuted scaled matching

J. Ian Munro, Ayelet Butman, Noa Lewenstein, 2016, Theor. Comput. Sci..

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.

J. Ian Munro, Yakov Nekrich, Sebastian Wild, 2020 .

Cache-oblivious dynamic dictionaries with update/query tradeoffs

Erik D. Demaine, John Iacono, J. Ian Munro, 2010, SODA '10.

An Application of Self-organizing Data Structures to Compression

Alejandro López-Ortiz, J. Ian Munro, Reza Dorrigiv, 2009, SEA.

The Complexity of Clickomania

Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, 2001, ArXiv.

Selection and sorting with limited storage

J. Ian Munro, Mike Paterson, J. I. Munro, 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

Data Structures for Path Queries

J. Ian Munro, Meng He, Gelin Zhou, 2016, ACM Trans. Algorithms.

Low Space Data Structures for Geometric Range Mode Query

Stephane Durocher, J. Ian Munro, Sharma V. Thankachan, 2014, CCCG.

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

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, 2003, IMC '03.

Succinct Representation of Balanced Parentheses and Static Trees

J. Ian Munro, Venkatesh Raman, J. I. Munro, 2002, SIAM J. Comput..

A O(|V|·|E|) algorithm for maximum matching of graphs

J. Ian Munro, T. Kameda, 2005, Computing.

Implicit B-trees: New results for the dictionary problem

Roberto Grossi, Gianni Franceschini, J. Ian Munro, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Analysis of the standard deletion algorithms in exact fit domain binary search trees

J. Ian Munro, Joseph C. Culberson, J. I. Munro, 1990, Algorithmica.

Efficient Determination of the Transitive Closure of a Directed Graph

J. Ian Munro, J. I. Munro, Ian R. Munro, 1971, Inf. Process. Lett..

Succinct Representations of Arbitrary Graphs

J. Ian Munro, Arash Farzan, 2008, ESA.

On hardness of several string indexing problems

J. Ian Munro, Kasper Green Larsen, Jesper Sindahl Nielsen, 2015, Theor. Comput. Sci..

Ranked Document Selection

Gonzalo Navarro, J. Ian Munro, Rahul Shah, 2014, SWAT.

Succinct Representations of Permutations

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2003, ICALP.

Techniques for Collision Resolution in Hash Tables with Open Addressing

J. Ian Munro, Pedro Celis, 1986, FJCC.

Optimal Algorithms for Parallel Polynomial Evaluation

J. Ian Munro, Mike Paterson, J. I. Munro, 1971, J. Comput. Syst. Sci..

On hardness of several string indexing problems

J. Ian Munro, Kasper Green Larsen, Jesper Sindahl Nielsen, 2014, Theor. Comput. Sci..

Searching a two key table under a single key

J. Ian Munro, J. Munro, 1987, STOC.

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs pdf

J. Ian Munro, Yakov Nekrich, Sebastian Wild, 2020, ArXiv.

On the Competitiveness of Linear Search

J. Ian Munro, J. I. Munro, J. Munro, 2000, ESA.

Succinct encoding of arbitrary graphs

J. Ian Munro, Arash Farzan, J. I. Munro, 2013, Theor. Comput. Sci..

Robin hood hashing

J. Ian Munro, Per-Åke Larson, Pedro Celis, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Efficient visibility queries in simple polygons

Prosenjit Bose, J. Ian Munro, Anna Lubiw, 2002, Comput. Geom..

Dynamic Optimality Refuted - For Tournament Heaps pdf

Richard Peng, J. Ian Munro, Sebastian Wild, 2019, ArXiv.

Faster Algorithms for some Optimization Problems on Collinear Points

Michiel H. M. Smid, Prosenjit Bose, J. Ian Munro, 2018, SoCG.

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees

J. Ian Munro, Yakov Nekrich, Sebastian Wild, 2020, ISAAC.

Self-organizing binary search trees

J. Ian Munro, Brian Allen, 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

Worst case constant time priority queue

Johan Karlsson, J. Ian Munro, Svante Carlsson, 2001, SODA '01.

Selecting the median and two quartiles in a set of numbers

J. Ian Munro, Walter Cunto, Manuel Rey, 1992, Softw. Pract. Exp..

Optimal Time Minimal Space Selection Algorithms

David P. Dobkin, J. Ian Munro, 1981, JACM.

Variations on visibility

Derick Wood, Mark H. Overmars, J. Ian Munro, 1987, SCG '87.

The Hausdorff Core Problem on Simple Polygons

Stephane Durocher, Alejandro López-Ortiz, J. Ian Munro, 2014, J. Comput. Geom..

An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time

J. Ian Munro, J. Munro, 1984, FOCS.

Dynamic Path Counting and Reporting in Linear Space

J. Ian Munro, Meng He, Gelin Zhou, 2014, ISAAC.

Adaptive searching in succinctly encoded binary relations and tree-structured documents

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2007, Theor. Comput. Sci..

Document retrieval with one wildcard

Moshe Lewenstein, J. Ian Munro, Sharma V. Thankachan, 2016, Theor. Comput. Sci..

Path Queries in Weighted Trees

J. Ian Munro, Meng He, Gelin Zhou, 2011, ISAAC.

Maintaining Discrete Probability Distributions Optimally

Kurt Mehlhorn, J. Ian Munro, Torben Hagerup, 1993, ICALP.

Space Efficient Data Structures for Dynamic Orthogonal Range Counting

J. Ian Munro, Meng He, 2011, WADS.

COCA Filters: Co-occurrence Aware Bloom Filters

Alejandro López-Ortiz, J. Ian Munro, Kamran Tirdad, 2011, SPIRE.

The computational complexity of algebraic and numeric problems

Allan Borodin, J. Ian Munro, J. I. Munro, 1975, Elsevier computer science library.

Heaps on Heaps

Gaston H. Gonnet, J. Ian Munro, J. I. Munro, 1982, SIAM J. Comput..

Succinct Data Structures

J. Ian Munro, 2004, Electron. Notes Theor. Comput. Sci..

Selection from Read-Only Memory and Sorting with Minimum Data Movement

Venkatesh Raman, J. Ian Munro, J. I. Munro, 1996, Theor. Comput. Sci..

Fast Sorting In-Place Sorting with O(n) Data

Venkatesh Raman, J. Ian Munro, 1991, FSTTCS.

Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm

Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete, 1991, Inf. Comput..

An efficient algorithm for partial order production

Jean Cardinal, Raphaël M. Jungers, J. Ian Munro, 2008, STOC '09.

Fast allocation and deallocation with an improved buddy system

Erik D. Demaine, J. Ian Munro, Gerth Stølting Brodal, 2004, Acta Informatica.

Sorting and Searching in Multisets

J. Ian Munro, Philip M. Spira, P. M. Spira, 1976, SIAM J. Comput..

Efficient Uses of the Past

David P. Dobkin, J. Ian Munro, 1980, FOCS.

Finding modes with equality comparisons

S. Srinivasa Rao, Venkatesh Raman, J. Ian Munro, 2017, Theor. Comput. Sci..

Stable in situ sorting and minimum data movement

Venkatesh Raman, J. Ian Munro, Jeffrey S. Salowe, 1990, BIT.

Selection and Sorting in the “Restore” Model

Timothy M. Chan, Venkatesh Raman, J. Ian Munro, 2018, ACM Trans. Algorithms.

The binomial transform and the analysis of skip lists

J. Ian Munro, Patricio V. Poblete, Thomas Papadakis, 2006, Theor. Comput. Sci..

Average case selection

J. Ian Munro, Walter Cunto, 1984, STOC '84.

Designing overlay structures

J. Ian Munro, W. Morven Gentleman, 1977, Softw. Pract. Exp..

Online Routing in Convex Subdivisions

Prosenjit Bose, Pat Morin, Erik D. Demaine, 2002, Int. J. Comput. Geom. Appl..

Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies

B. John Oommen, J. Ian Munro, E. R. Hansen, 1990, Theor. Comput. Sci..

Space Efficient Suffix Trees

S. Srinivasa Rao, J. Ian Munro, Venkatesh Raman, 1998, J. Algorithms.

Efficient Evaluation of Polynomial Forms

Allan Borodin, J. Ian Munro, 1972, J. Comput. Syst. Sci..

Succinct Color Searching in One Dimension

J. Ian Munro, Yakov Nekrich, Hicham El-Zein, 2017, ISAAC.

Structure, Scoring and Purpose of Computing Competitions

Gordon V. Cormack, J. Ian Munro, Graeme Kemkes, 2006, Informatics Educ..

Fast Construction of Wavelet Trees

Jeffrey Scott Vitter, J. Ian Munro, Yakov Nekrich, 2014, SPIRE.

Less Space: Indexing for Queries with Wildcards

Moshe Lewenstein, Venkatesh Raman, J. Ian Munro, 2013, ISAAC.

Succinct representation of balanced parentheses, static trees and planar graphs

Venkatesh Raman, J. Ian Munro, J. I. Munro, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time

Gonzalo Navarro, J. Ian Munro, Yakov Nekrich, 2016, SODA.

Searchability in merging and implicit data structures

J. Ian Munro, Patricio V. Poblete, P. V. Poblete, 1983, BIT.

Developing Implicit Data Structures

J. Ian Munro, J. Ian Munro, 1996, MFCS.

Average search and update costs in skip lists

J. Ian Munro, Patricio V. Poblete, Thomas Papadakis, 1992, BIT.

Finding Frequent Elements in Compressed 2D Arrays and Strings

J. Ian Munro, Meng He, Travis Gagie, 2011, SPIRE.

Selection and Sorting in the "Restore" Model

Timothy M. Chan, Venkatesh Raman, J. Ian Munro, 2014, SODA.

The Diagonal Poisson Transform and its application to the analysis of a hashing scheme

J. Ian Munro, Patricio V. Poblete, Alfredo Viola, 1997, Random Struct. Algorithms.

Last-Come-First-Served Hashing

J. Ian Munro, Patricio V. Poblete, 1989, J. Algorithms.

Representing dynamic binary trees succinctly

Venkatesh Raman, J. Ian Munro, Adam J. Storm, 2001, SODA '01.

Determining the Mode

David P. Dobkin, J. Ian Munro, 1980, Theor. Comput. Sci..

Fault Tolerance and Storage Reduction in Binary Search Trees

J. Ian Munro, Patricio V. Poblete, P. V. Poblete, 1984, Inf. Control..

Range Reporting for Moving Points on a Grid pdf

Marek Karpinski, J. Ian Munro, Yakov Nekrich, 2010, ArXiv.

Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations

J. Ian Munro, Joseph C. Culberson, J. I. Munro, 1989, Computer/law journal.

Proximity of a Grid

J. Ian Munro, Rolf G. Karlsson, J. Munro, 1985, STACS.

Dynamic Range Selection in Linear Space

J. Ian Munro, Meng He, Patrick K. Nicholson, 2011, ISAAC.

Succinct Representation of Data Structures

S. Srinivasa Rao, J. Ian Munro, J. I. Munro, 2018, Handbook of Data Structures and Applications.

Multi-Pivot Quicksort: Theory and Experiments

Alejandro López-Ortiz, J. Ian Munro, Shrinu Kushagra, 2014, ALENEX.

List Update Algorithms for Data Compression

Alejandro López-Ortiz, J. Ian Munro, Reza Dorrigiv, 2008, Data Compression Conference (dcc 2008).

Selection and sorting with limited storage

J. Ian Munro, Mike Paterson, J. I. Munro, 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time

Amos Fiat, Moni Naor, Jeanette P. Schmidt, 1991, J. Comput. Syst. Sci..

Untangled monotonic chains and adaptive range search

Stephane Durocher, Alejandro López-Ortiz, J. Ian Munro, 2011, Theor. Comput. Sci..

Self-Organizing Binary Search Trees

J. Ian Munro, Brian Allen, 1976, FOCS.

On Huang and Wong's Algorithm for Generalized Binary Split Trees pdf

Marek Chrobak, J. Ian Munro, Mordecai J. Golin, 2019, ArXiv.

Fun-Sort--or the chaos of unordered binary search

Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, 2004, Discret. Appl. Math..

A novel approach for leveraging co-occurrence to improve the false positive error in signature files

Alejandro López-Ortiz, J. Ian Munro, Kamran Tirdad, 2013, J. Discrete Algorithms.

Average case selection

J. Ian Munro, Walter Cunto, W. Cunto, 1989, JACM.

Permuted Scaled Matching

J. Ian Munro, Ayelet Butman, Noa Lewenstein, 2014, CPM.

Dynamic Trees with Almost-Optimal Access Cost

John Iacono, J. Ian Munro, Stefan Langerman, 2018, ESA.

Document Retrieval with One Wildcard

Moshe Lewenstein, J. Ian Munro, Sharma V. Thankachan, 2014, MFCS.

Efficient Suffix Trees on Secondary Storage (extended Abstract)

J. Ian Munro, David R. Clark, 1996, SODA.

Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds

Peter Bro Miltersen, J. Ian Munro, Andrej Brodnik, 1997, WADS.

Dynamic Planar Point Location in External Memory

J. Ian Munro, Yakov Nekrich, Yakov Nekrich, 2019, SoCG.

Reflections on Optimal and Nearly Optimal Binary Search Trees

J. Ian Munro, J. I. Munro, 2009, Efficient Algorithms.

Anodic protection of white and green kraft liquor tankage: Part II-Anodic protection design and system operation

J. Ian Munro, 2002 .

Range majority in constant time and linear space

Stephane Durocher, J. Ian Munro, Meng He, 2011, Inf. Comput..

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers

Timothy M. Chan, Venkatesh Raman, J. Ian Munro, 2013, ISAAC.

Succinct Ordinal Trees Based on Tree Covering

S. Srinivasa Rao, J. Ian Munro, Meng He, 2007, ICALP.

Dynamic Range Majority Data Structures pdf

Amr Elmasry, J. Ian Munro, Patrick K. Nicholson, 2011, ISAAC.

Online Routing in Convex Subdivisions

Prosenjit Bose, Pat Morin, Erik D. Demaine, 2000, ISAAC.

Space efficient data structures for dynamic orthogonal range counting

J. Ian Munro, Meng He, 2014, Comput. Geom..

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance

Stephane Durocher, Alejandro López-Ortiz, J. Ian Munro, 2009, WADS.

Cache-oblivious priority queue and graph algorithm applications

Michael A. Bender, Erik D. Demaine, J. Ian Munro, 2002, STOC '02.

Efficient Generation of Uniform Samples from Phylogenetic Trees

J. Ian Munro, Derek Phillips, Paul E. Kearney, 2003, WABI.

Improved Time and Space Bounds for Dynamic Range Mode pdf

J. Ian Munro, Meng He, Bryce Sandlund, 2018, ESA.

Succinct Indices for Path Minimum, with Applications to Path Reporting

Timothy M. Chan, J. Ian Munro, Meng He, 2014, ESA.

Range Queries over Untangled Chains

J. Ian Munro, Patrick K. Nicholson, Francisco Claude, 2010, SPIRE.

Succinct Data Structures for Chordal Graphs

J. Ian Munro, Kaiyu Wu, Kaiyu Wu, 2018, ISAAC.

Sorting under partial information (without the ellipsoid algorithm)

Jean Cardinal, Raphaël M. Jungers, J. Ian Munro, 2009, STOC '10.

Succinct indexes for strings, binary relations and multilabeled trees

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2011, TALG.

Less space: Indexing for queries with wildcards

Moshe Lewenstein, Venkatesh Raman, J. Ian Munro, 2014, Theor. Comput. Sci..

Partial Match Retrieval in Implicit Data Structures

Kurt Mehlhorn, J. Ian Munro, Helmut Alt, 1981, Inf. Process. Lett..

Implicit B-trees: a new data structure for the dictionary problem

Roberto Grossi, Gianni Franceschini, J. Ian Munro, 2004, J. Comput. Syst. Sci..

Optimal Algorithms for Parallel Polynomial Evaluation

J. Ian Munro, Mike Paterson, J. I. Munro, 1971, J. Comput. Syst. Sci..

Top-k Term-Proximity in Succinct Space

Gonzalo Navarro, J. Ian Munro, Jesper Sindahl Nielsen, 2016, Algorithmica.

On universally easy classes for NP-complete problems

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, 2001, SODA.

Representing Trees of Higher Degree

Rajeev Raman, Erik D. Demaine, S. Srinivasa Rao, 2005, Algorithmica.

Range Majority in Constant Time and Linear Space

Stephane Durocher, J. Ian Munro, Meng He, 2011, ICALP.

Implicit data structures (Preliminary Draft)

J. Ian Munro, Hendra Suwanda, 1979, STOC '79.

Lower Bounds for Succinct Data Structures

J. Ian Munro, 2008, CPM.

Finding median in read-only memory on integer input

Timothy M. Chan, Venkatesh Raman, J. Ian Munro, 2015, Theor. Comput. Sci..

Succinct Posets

J. Ian Munro, Patrick K. Nicholson, 2012, ESA.

Frequency Estimation of Internet Packet Streams with Limited Space

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, 2002, ESA.

Dynamic Succinct Ordered Trees

J. Ian Munro, Arash Farzan, Arash Farzan, 2009, ICALP.

The Analysis of a Fringe Heuristic for Binary Search Trees

J. Ian Munro, Patricio V. Poblete, P. V. Poblete, 1985, J. Algorithms.

Range Counting with Distinct Constraints

J. Ian Munro, Sharma V. Thankachan, Yakov Nekrich, 2015, CCCG.

Time and Space Bounds for Selection Problems

David P. Dobkin, J. Ian Munro, 1978, ICALP.

A Uniform Approach Towards Succinct Representation of Trees

J. Ian Munro, Arash Farzan, 2008, SWAT.

Time and Space Efficient Representations of Distributive Lattices

J. Ian Munro, Corwin Sinnamon, 2018, SODA.

Fast construction of wavelet trees

Jeffrey Scott Vitter, J. Ian Munro, Yakov Nekrich, 2016, Theor. Comput. Sci..

Document Listing on Versioned Documents

J. Ian Munro, Francisco Claude, 2013, SPIRE.

Succinct Posets

J. Ian Munro, Patrick K. Nicholson, J. I. Munro, 2015, Algorithmica.

Representing Trees of Higer Degree

Erik D. Demaine, Venkatesh Raman, J. Ian Munro, 1999, WADS.

Computing and Combinatorics

Kyung-Yong Chwa, J. Ian Munro, 2004, Lecture Notes in Computer Science.

Preface

J. Ian Munro, Dorothea Wagner, 2010, JEAL.

Implicit Data Structures for Fast Search and Update

J. Ian Munro, Hendra Suwanda, J. Munro, 1980, J. Comput. Syst. Sci..

Succinct Dynamic One-Dimensional Point Reporting

J. Ian Munro, Yakov Nekrich, Hicham El-Zein, 2018, SWAT.

Compressed Data Structures for Dynamic Sequences pdf

J. Ian Munro, Yakov Nekrich, 2015, ESA.

A linear probing sort and its analysis(Preliminary Draft)

Gaston H. Gonnet, J. Ian Munro, 1981, STOC '81.

Succinct Representation of Labeled Graphs

Jérémy Barbay, J. Ian Munro, Meng He, 2007, Algorithmica.

Succinct Representation of Labeled Graphs

Jérémy Barbay, J. Ian Munro, Meng He, 2007, ISAAC.

Fast Compressed Self-indexes with Deterministic Linear-Time Construction pdf

Gonzalo Navarro, J. Ian Munro, Yakov Nekrich, 2017, Algorithmica.

Sorting with networks of data structures

Alejandro López-Ortiz, J. Ian Munro, Therese C. Biedl, 2010, Discret. Appl. Math..

Succinct indexes for strings, binary relations and multi-labeled trees

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2007, SODA '07.

Space-Efficient Data Structures for Lattices

J. Ian Munro, Bryce Sandlund, Corwin Sinnamon, 2020, SWAT.

Categorical Range Reporting with Frequencies

J. Ian Munro, Rahul Shah, Sharma V. Thankachan, 2019, ICDT.

On the cost of unsuccessful searches in search trees with two-way comparisons

Marek Chrobak, J. Ian Munro, Mordecai J. Golin, 2020 .

Space Efficient Suffix Trees

S. Srinivasa Rao, Venkatesh Raman, J. Ian Munro, 1998, FSTTCS.

The analysis of an improved hashing technique

Gaston H. Gonnet, J. Ian Munro, J. I. Munro, 1977, STOC '77.

Dynamic Path Queries in Linear Space

J. Ian Munro, Meng He, Gelin Zhou, 2018, Algorithmica.

Improved Explicit Data Structures in the Bitprobe Model

Moshe Lewenstein, Venkatesh Raman, J. Ian Munro, 2014, ESA.

Efficient uses of the past

David P. Dobkin, J. Ian Munro, D. Dobkin, 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

Text Indexing and Searching in Sublinear Time

Gonzalo Navarro, J. Ian Munro, Yakov Nekrich, 2020, CPM.

Succinct Representations of Dynamic Strings pdf

J. Ian Munro, Meng He, 2010, SPIRE.

Towards Optimal Multiple Selection

Kurt Mehlhorn, Peter Sanders, J. Ian Munro, 2005, ICALP.

Neighbours on a Grid

J. Ian Munro, Andrej Brodnik, 1996, SWAT.

A categorization theorem on suffix arrays with applications to space efficient text indexes

S. Srinivasa Rao, J. Ian Munro, Meng He, 2005, SODA '05.

A discipline for robustness or storage reduction in binary search trees

J. Ian Munro, Patricio V. Poblete, 1983, PODS '83.

Implicit dictionaries with O(1) modifications per update and fast search

Gianni Franceschini, J. Ian Munro, Gianni Franceschini, 2006, SODA '06.

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes

Venkatesh Raman, J. Ian Munro, Hicham El-Zein, 2014, ISAAC.

Membership in Constant Time and Minimum Space

J. Ian Munro, Andrej Brodnik, 1994, ESA.

Dynamic range majority data structures

Amr Elmasry, J. Ian Munro, Meng He, 2016, Theor. Comput. Sci..

Top- k Term-Proximity in Succinct Space

Gonzalo Navarro, J. Ian Munro, Jesper Sindahl Nielsen, 2014, ISAAC.

Resizable Arrays in Optimal Time and Space

Erik D. Demaine, J. Ian Munro, Svante Carlsson, 1999, WADS.

The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract)

J. Ian Munro, Patricio V. Poblete, Alfredo Viola, 1994, ESA.

Toward self-organizing linear search

Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda, 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

Direct dynamic structures for some line segment problems

Gaston H. Gonnet, Derick Wood, J. Ian Munro, 1983, Comput. Vis. Graph. Image Process..

Sorting Multisets and Vectors In-Place

Venkatesh Raman, J. Ian Munro, 1991, WADS.

On Approximate Range Mode and Range Selection

J. Ian Munro, Meng He, Bryce Sandlund, 2019, ISAAC.

The Complexity of Partial Orders

J. Ian Munro, J. I. Munro, 2012, Workshop on Analytic Algorithmics and Combinatorics.

Succinct Indices for Path Minimum, with Applications

Timothy M. Chan, J. Ian Munro, Meng He, 2016, Algorithmica.

Succinct representation of finite abelian groups

J. Ian Munro, Arash Farzan, 2006, ISSAC '06.

On the relative dominance of paging algorithms

Alejandro López-Ortiz, J. Ian Munro, Reza Dorrigiv, 2009, Theor. Comput. Sci..

Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2006, CPM.

A Uniform Paradigm to Succinctly Encode Various Families of Trees

J. Ian Munro, Arash Farzan, 2012, Algorithmica.

On the relative dominance of paging algorithms

Alejandro López-Ortiz, J. Ian Munro, Reza Dorrigiv, 2007, Theor. Comput. Sci..

(Preliminary Report) ~ a.jS~ --r~ hQ~ .fJ1h<'-(ic~ ~~~t"~i

J. Ian Munro, Per-Ake Larson, Pedro Celis, 1985 .

Membership in Constant Time and Almost-Minimum Space

J. Ian Munro, Andrej Brodnik, J. I. Munro, 1999, SIAM J. Comput..

Succinct Representations of Functions

S. Srinivasa Rao, J. Ian Munro, J. Munro, 2004, ICALP.

Evaluating Polynomials at Many Points

Allan Borodin, J. Ian Munro, J. I. Munro, 1971, Inf. Process. Lett..

Succinct Encoding of Permutations: Applications to Text Indexing

Jérémy Barbay, J. Ian Munro, 2008, Encyclopedia of Algorithms.

Ranked document selection

J. Ian Munro, Sharma V. Thankachan, Gonzalo Navarro, 2020, Theor. Comput. Sci..

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons

Marek Chrobak, J. Ian Munro, Mordecai J. Golin, 2021, ACM Trans. Algorithms.

Adaptive set intersections, unions, and differences

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, 2000, SODA '00.

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets

J. Ian Munro, Meng He, Gelin Zhou, 2014, Algorithmica.

Heaps on Heaps

Gaston H. Gonnet, J. Ian Munro, 1982, ICALP.

On the Succinct Representation of Equivalence Classes

Moshe Lewenstein, Timothy M. Chan, Venkatesh Raman, 2017, Algorithmica.

Sorting with Minimum Data Movement (Preliminary Draft)

Venkatesh Raman, J. Ian Munro, J. I. Munro, 1989, WADS.

The Binomial Transform and its Application to the Analysis of Skip Lists

J. Ian Munro, Patricio V. Poblete, Thomas Papadakis, 1995, ESA.

Brief announcement: deterministic skipnet

J. Ian Munro, Nicholas J. A. Harvey, 2003, PODC '03.

In as Few Comparisons as Possible

J. Ian Munro, 2014, WALCOM.

Robin Hood Hashing (Preliminary Report)

J. Ian Munro, Per-Åke Larson, Pedro Celis, 1985, FOCS 1985.

Experiments on Adaptive Set Intersections for Text Retrieval Systems

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, 2001, ALENEX.

Optimal search trees with equality tests pdf

Marek Chrobak, J. Ian Munro, Mordecai J. Golin, 2015, ArXiv.

Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures

J. Ian Munro, Sebastian Wild, Patrick K. Nicholson, 2021, ESA.

The diagonal Poisson transform and its application to the analysis of a hashing scheme

J. Ian Munro, Patricio V. Poblete, Alfredo Viola, 1997 .

How Small Can the Mean Shadow of a Set Be

J. Ian Munro, Allen J. Schwenk, 1983 .

Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds

Peter Bro Miltersen, J. Ian Munro, Andrej Brodnik, 1997 .