Semi-group range sum revisited: query-space lower bound tightened (Q1751095): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tight lower bounds for halfspace range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: part II. The arithmetic model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Range Searching in the Group Model and Combinatorial Discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cell probe complexity of dynamic range counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549595 / rank
 
Normal rank

Revision as of 16:04, 15 July 2024

scientific article
Language Label Description Also known as
English
Semi-group range sum revisited: query-space lower bound tightened
scientific article

    Statements

    Semi-group range sum revisited: query-space lower bound tightened (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2018
    0 references
    range-sum queries
    0 references
    semigroup
    0 references
    lower bound
    0 references
    length-decomposition property
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references