Succinct Representation of Balanced Parentheses and Static Trees

By J. Ian Munro, Venkatesh Raman. SIAM journal on computing (Print), 2002

320 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/8d24356262f53de3269edbc0550c9b2ac7b08fcb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Meng He
2. Kunihiko Sadakane

In Computer Networks and Communications

1. Meng He
2. Kunihiko Sadakane

In Signal Processing

1. Meng He
2. Kunihiko Sadakane

Citations in the corpus

• Indexing Compressed Text (2003, methodology): “The representation of the binary tree itself was reduced to the information theoretic limit of 2 + o(1) bits per node by Munro and Raman [48].”
• Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets (2007, unknown): “Motivated by applications to very large data sets, as well as by applications to low-resource systems such as handheld and embedded computers, smart cards etc., there has been a renewal of interest in succinct representations of data [6, 5, 20, 17, 18, 22, 23, 24, 27].”
• Compressed Suffix Trees with Full Functionality (2007, methodology): “It was shown by Munro and Raman [23] that a node of a tree can be represented by a pair of parentheses ‘(.”