#### Filter Results:

- Full text PDF available (93)

#### Publication Year

1971

2017

- This year (3)
- Last 5 years (51)
- Last 10 years (82)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
- Algorithmica
- 1999

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

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

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

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

- J. Ian Munro
- Inf. Process. Lett.
- 1971

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

We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simply too much data to be recorded for later analysis, on the order of gigabytes a second. As a result, network routers can collect only relatively few statistics… (More)