Efficient optimally lazy algorithms for minimal-interval semantics

DOI10.1016/J.TCS.2016.07.036MaRDI QIDQ313957zbMATH OpenOpenAlexFDO

Authors 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

latticesinformation retrievallazy algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1445373
• scientific article; zbMATH DE number 1893562
• Combinatorial Pattern Matching
• Fast Evaluation of Union-Intersection Expressions

Cites work

• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 2119719 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• scientific article; zbMATH DE number 1424324 (Why is no real title available?)
• Computing on-line the lattice of maximal antichains of posets
• Efficient optimally lazy algorithms for minimal-interval semantics
• On Finding the Maxima of a Set of Vectors
• Plane-sweep algorithms for intersecting geometric figures
• Supporting random access in files of variable length records

Cited in

(3)

• On the problem of wiki texts indexing
• scientific article; zbMATH DE number 7365811 (Why is no real title available?)
• Efficient optimally lazy algorithms for minimal-interval semantics

Describes a project that uses

Uses Software

• Mimir

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

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