#### Filter Results:

#### Publication Year

1976

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our attention to trees of higher degree. We consider both cardinal trees (or k-ary tries), where each node has k slots, labelled {1,. .. , k}, each of which may have a… (More)

- J. Ian Munro, Venkatesh Raman
- SIAM J. Comput.
- 2001

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

We consider a generalization of the problem of supporting rank and select queries on binary strings. Given a string of length <i>n</i> from an alphabet of size σ, we give the first representation that supports <i>rank</i> and <i>access</i> operations in <i>O</i>(lg lg σ) time, and <i>select</i> in <i>O</i>(1) time while using the optimal… (More)

- J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
- ICALP
- 2003

- J. Ian Munro, Mike Paterson
- 19th Annual Symposium on Foundations of Computer…
- 1978

When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the amount of internal storage available and the number of passes required to select the Kth highest of N inputs. We show, for example, that to find the median in two… (More)

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

Motivated by boolean queries in text database systems, we consider the problems of finding the intersection, union, or difference of a collection of sorted sets. While the worst-case complexity of these problems is straightforward , we consider a notion of complexity that depends on the particular instance. We develop the idea of a proof that a given set is… (More)

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

- J. Ian Munro, Thomas Papadakis, Robert Sedgewick
- SODA
- 1992

We explore techniques based on the notion of a skip list to guarantee logarithmic search, insert and delete costs. The basic idea is to insist that between any pair of elements above a given height are a small number of elements of precisely that height. The desired behaviour can be achieved by either using some extra space for pointers, or by adding the… (More)

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

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