Fast local searches and updates in bounded universes (Q691776): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.comgeo.2012.01.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177407650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient regular data structures and algorithms for dilation, location, and proximity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic ordered sets with exponential search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for the predecessor problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal finger search trees in the pointer machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priority queue in which initialization and queue operations takeO(loglogD) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures with Local Update Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient data structures for range searching on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank

Latest revision as of 23:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast local searches and updates in bounded universes
scientific article

    Statements

    Fast local searches and updates in bounded universes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 December 2012
    0 references
    0 references
    predecessor search
    0 references
    nearest neighbour search
    0 references
    range search
    0 references
    distance sensitivity
    0 references
    bounded universe
    0 references
    0 references