scientific article; zbMATH DE number 2080210

MaRDI QIDQ4472452zbMATH OpenFDO

Authors Pilu Crescenzi, Roberto Grossi, Elena Lodi, L. Pagli, Gianluca Rossi, A. Del Lungo

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740290.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15)

Recommendations

• Text sparsification via local maxima.
• scientific article; zbMATH DE number 432798
• Sparse text indexing in small space
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Compressing dictionary matching index via sparsification technique

Cited in

(3)

• Text sparsification via local maxima.
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Monotone runs of uniformly distributed integer random variables: A probabilistic analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472452)