A deterministic skip list for \(k\)-dimensional range search

DOI10.1007/s00236-004-0157-8zbMath1067.68055OpenAlexW1984054760MaRDI QIDQ1772103

Michael G. Lamoureux, Bradford G. Nickerson

Publication date: 15 April 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0157-8

zbMATH Keywords

multi-dimensional point data

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS ⋮ A deterministic skip list for \(k\)-dimensional range search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Efficient worst-case data structures for range searching
• A deterministic skip list for \(k\)-dimensional range search
• A data structure for dynamic range queries
• Ignoring ignorance and agreeing to disagree
• Priority Search Trees
• New Data Structures for Orthogonal Range Queries
• Adding range restriction capability to dynamic data structures
• A Lower Bound on the Complexity of Orthogonal Range Queries
• Multidimensional binary search trees used for associative searching

This page was built for publication: A deterministic skip list for \(k\)-dimensional range search