Combined data structure for previous- and next-smaller-values

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching Read More: http://epubs.siam.org/doi/abs/10.1137/S0097539702402354

Roberto Grossi, Jeffrey Scott Vitter · KU ScholarWorks (The University of Kansas) · 2005 · 438 citations · Full text

Computing, Computer Science, Algorithms +13

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · 2002 · 401 citations

Computing, Computer Science, Mathematics +10

Succinct Representation of Balanced Parentheses and Static Trees

J. Ian Munro, Venkatesh Raman · SIAM Journal on Computing · 2001 · 329 citations

Computing, Computer Science, Algorithms +13

Compressed Suffix Trees with Full Functionality

Kunihiko Sadakane · Theory of Computing Systems · 2007 · 297 citations

Computing, Computer Science, Computer Systems +11

Representing Trees of Higher Degree

David Benoit, Erik D. Demaine, J. Ian Munro et al. · Algorithmica · 2005 · 233 citations

Computing, Computer Science, Mathematics +6