#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1971

2019

- This year (10)
- Last 5 years (58)
- Last 10 years (102)

#### Publication Type

#### Co-author

#### Journals and Conferences

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â€¦ (More)

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

We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Our representations use an amount of spaceâ€¦ (More)

- David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
- Algorithmica
- 2004

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â€¦ (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â€¦ (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â€¦ (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â€¦ (More)

Motivated by boolean queries in text database systems, we consider the problems of nding the intersection, union, or diierence of a collection of sorted sets. While the worst-case complexity of theseâ€¦ (More)

- J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
- J. Algorithms
- 2001

Å½ . We give first the representation of a suffix tree that uses n lg n O n bits of Å½ space and supports searching for a pattern string in the given text from a fixed size . Å½ . alphabet in O m time,â€¦ (More)

- J. Ian Munro
- J. Comput. Syst. Sci.
- 1986

We introduce a data structure that requires only one pointer for every k data values and supports searches in O(logn) time and insertions and deletions in O(k flogn) time. By choosing k to be O(logâ€¦ (More)

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

Thank you for downloading the computational complexity of algebraic and numeric problems elsevier computer science library theory of computation series 1. As you may know, people have search numerousâ€¦ (More)