A log log n data structure for three-sided range queries
type: Item
instance of: scholarly article
title: A log log n data structure for three-sided range queries
zbMATH Open document ID: 0653.68057
DOI: 10.1016/0020-0190(87)90174-8
author: O. Fries
author: K. Mehlhorn
author: S. Näher
author: Athanasios K. Tsakalidis
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 4066351
zbMATH Keywords: data structure
zbMATH Keywords: priority search tree
zbMATH Keywords: range search
zbMATH Keywords: lowest common ancestor
zbMATH Keywords: heap
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90174-8
OpenAlex ID: W2081589479
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Q3219753
cites work: Priority Search Trees
cites work: Q3332263
cites work: Q3992847
description: scientific article; zbMATH DE number 4066351