Implicit data structures for weighted elements

DOI10.1016/S0019-9958(85)80013-9MaRDI QIDQ3703301zbMATH OpenFDO

Authors Greg N. Frederickson

Publication date 1985

Published in Information and Control (Search for Journal in Brave)

zbMATH Keywords

searchingsearch treesworst-case search timeaccess probabilitiesdictionaries containing elements with different weights

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Self-Organizing Heuristics for Implicit Data Structures
• Weighted Leaf AVL-Trees
• scientific article; zbMATH DE number 2079398
• Biased dictionaries with fast insert/deletes
• Implicit \(B\)-trees: A new data structure for the dictionary problem

Cited in

(5)

• scientific article; zbMATH DE number 3990869 (Why is no real title available?)
• Self-adjusting multi-way search trees
• Searching among intervals and compact routing tables
• Searching among intervals and compact routing tables
• Self-Organizing Heuristics for Implicit Data Structures

This page was built for publication: Implicit data structures for weighted elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703301)