The complexity of lexicographic sorting and searching

DOI10.21136/am.1981.103933zbMath0467.68057OpenAlexW4233000920MaRDI QIDQ3920657

Juraj Wiedermann

Publication date: 1981

Full work available at URL: https://eudml.org/doc/15214

zbMATH Keywords

static data structureasymptotically optimal sorting algorithmlexicographic search tree

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• How good is the information theory bound in sorting?
• Partial-Match Retrieval Algorithms

This page was built for publication: The complexity of lexicographic sorting and searching