Efficient optimally lazy algorithms for minimal-interval semantics

DOI10.1016/j.tcs.2016.07.036zbMath1350.68090OpenAlexW1633549960MaRDI QIDQ313957

Paolo Boldi, Sebastiano Vigna

Publication date: 12 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.036

zbMATH Keywords

information retrievallatticeslazy algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Information storage and retrieval of data (68P20)

Related Items (3)

Efficient optimally lazy algorithms for minimal-interval semantics ⋮ \(E=I+T\): the internal extent formula for compacted tries ⋮ On the problem of wiki texts indexing

Uses Software

• Mimir

Cites Work

• Efficient optimally lazy algorithms for minimal-interval semantics
• Computing on-line the lattice of maximal antichains of posets
• Supporting random access in files of variable length records
• \(E=I+T\): the internal extent formula for compacted tries
• Plane-sweep algorithms for intersecting geometric figures
• On Finding the Maxima of a Set of Vectors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient optimally lazy algorithms for minimal-interval semantics