Efficient optimally lazy algorithms for minimal-interval semantics (Q313957): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient optimally lazy algorithms for minimal-interval semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(E=I+T\): the internal extent formula for compacted tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on-line the lattice of maximal antichains of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane-sweep algorithms for intersecting geometric figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supporting random access in files of variable length records / rank
 
Normal rank

Revision as of 13:25, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficient optimally lazy algorithms for minimal-interval semantics
scientific article

    Statements

    Efficient optimally lazy algorithms for minimal-interval semantics (English)
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    lazy algorithms
    0 references
    information retrieval
    0 references
    lattices
    0 references

    Identifiers