Tight lower bounds for halfspace range searching (Q420572): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-012-9412-x / rank
Normal rank
 
Property / author
 
Property / author: David M. Mount / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-012-9412-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248139057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the importance of idempotence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of corners on the complexity of approximate range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is half-space 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 on the Complexity of Polytope Range Searching / 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: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal range searching in spaces of finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate range searching: The absolute model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realistic input models for geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halfplanar range search in linear space and \(O(n^{0.695})\) query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Tradeoffs for Emptiness Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Complexity of Some Optimal Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Maintaining Partial Sums / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-012-9412-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:02, 9 December 2024

scientific article
Language Label Description Also known as
English
Tight lower bounds for halfspace range searching
scientific article

    Statements

    Tight lower bounds for halfspace range searching (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2012
    0 references
    range searching
    0 references
    lower bounds
    0 references
    idempotence
    0 references

    Identifiers