Optimal choice of discriminators in a balanced K-D binary search tree
type: Item
instance of: scholarly article
title: Optimal choice of discriminators in a balanced K-D binary search tree
zbMATH Open document ID: 0464.68062
DOI: 10.1016/0020-0190(81)90034-X
author: Ysmar V. Silva Filho
published in: Information Processing Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 3727644
zbMATH Keywords: partial-match search
MaRDI profile type: Publication
cites work: Multidimensional binary search trees used for associative searching
cites work: Multidimensional Binary Search Trees in Database Applications
cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time
cites work: On nonlinear optimization in integers
cites work: Optimal partial-match retrieval
full work available at URL: 0020-0190(81)90034-x
OpenAlex ID: W2083113666
description: scientific article; zbMATH DE number 3727644