#### Filter Results:

- Full text PDF available (100)

#### Publication Year

1971

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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, Venkatesh Raman
- SIAM J. Comput.
- 2001

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

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)

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

- David R. Clark, J. Ian Munro
- SODA '96
- 1996

We present a new representation for suffix trees, a data structure used in full text searching, that uses little more storage than the lg n bits per index point required to store the list of index points. We also show algorithms for maintaining the structure on secondary storage in such a way that we minimize the number of disk accesses while searching and… (More)

- J. Ian Munro
- FSTTCS
- 1996

- 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 not ion of complexity that depends on the particular instance. We develop the idea of a proof that a given set is… (More)

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

- Brian Allen, J. Ian Munro
- 17th Annual Symposium on Foundations of Computer…
- 1976

We consider heuristics which attempt to maintain a binary search tree in a near optimal form, assuming that elements are requested with fixed, but unknown, independent probabilities. A "move to root" heuristic is shown to yield an expected search time within a constant factor of that of an optimal static binary search tree. On the other hand, a closely… (More)