J. Munro

Publications
Influence

Succinct Representation of Balanced Parentheses and Static Trees

J. Munro, Venkatesh Raman
Computer Science, Mathematics
SIAM J. Comput.
1 March 2002

We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Expand

Representing Trees of Higher Degree

D. Benoit, E. Demaine, J. Munro, R. Raman, V. Raman, S. S. Rao
Mathematics, Computer Science
Algorithmica
1 December 2005

This paper focuses on space efficient representations of rooted trees of higher degree that permit basic navigation in constant time. Expand

Frequency Estimation of Internet Packet Streams with Limited Space

E. Demaine, A. López-Ortiz, J. Munro
Mathematics, Computer Science
ESA
17 September 2002

We present an algorithm that deterministically finds (in particular) all categories having a frequency above 1/(m+1) using m counters, which we prove is best possible in the worst case. Expand

Selection and Sorting with Limited Storage

J. Munro, M. Paterson
Computer Science
Theor. Comput. Sci.
1 November 1980

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. Expand

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

Alexander Golynski, J. Munro, S. S. Rao
Mathematics, Computer Science
SODA '06
22 January 2006

We consider a generalization of the problem of supporting rank and select queries on binary strings. Expand

Adaptive set intersections, unions, and differences

E. Demaine, A. López-Ortiz, J. Munro
Mathematics, Computer Science
SODA '00
1 February 2000

We consider the problems of finding the intersection, union, or difference of a collection of sorted sets. Expand

Selection and sorting with limited storage

J. Munro, M. Paterson
Computer Science
19th Annual Symposium on Foundations of Computer…
16 October 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 to select the Kth highest of N inputs. Expand

Self-organizing binary search trees

B. Allen, J. Munro
Computer Science
17th Annual Symposium on Foundations of Computer…
1 October 1978

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. Expand

Succinct representation of balanced parentheses, static trees and planar graphs

J. Munro, V. Raman
Mathematics, Computer Science
Proceedings 38th Annual Symposium on Foundations…
19 October 1997

We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced parenthesis expression. Expand

The computational complexity of algebraic and numeric problems

A. Borodin, J. Munro
Computer Science
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, but end up in harmful downloads. Expand

Recommended Authors