Implementing dictionaries using binary trees of very small height
type: Item
instance of: scholarly article
title: Implementing dictionaries using binary trees of very small height
zbMATH Open document ID: 0354.68063
DOI: 10.1016/0020-0190(76)90094-6
published in: Information Processing Letters
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3551890
author: Hermann Maurer
author: Thomas Ottmann
author: Hans-Werner Six
MaRDI profile type: Publication
full work available at URL: 0020-0190(76)90094-6
OpenAlex ID: W2018097735
cites work: On the computational power of pushdown automata
cites work: Symmetric binary B-trees: Data structure and maintenance algorithms
cites work: Q5585020
cites work: Q4776812
cites work: Q4079070
cites work: Binary Search Trees of Bounded Balance
description: scientific article; zbMATH DE number 3551890