Self-Organizing Heuristics for Implicit Data Structures

DOI10.1137/0213020MaRDI QIDQ3326852zbMATH OpenOpenAlexFDO

Authors Greg N. Frederickson

Publication date 1984

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0213020

zbMATH Keywords

access probabilitiesbinary search treedictionaryimplicit data structuresearch timessearchingself-organizing heuristicsunsuccessful search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Implicit data structures for weighted elements
• Self-adjusting binary search trees
• scientific article; zbMATH DE number 2102775
• Unsuccessful Search in Self-Adjusting Data Structures
• scientific article; zbMATH DE number 4064505

Cited in

(14)

• Self-organizing sequential search and Hilbert's inequalities
• Implicit data structures for linear hashing schemes
• Self-adjusting multi-way search trees
• An Aid For The Selection Of Efficient Storage Structures
• Implicit data structures for weighted elements
• Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching
• HISTORICAL SEARCHING
• Unsuccessful Search in Self-Adjusting Data Structures
• scientific article; zbMATH DE number 742968 (Why is no real title available?)
• An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
• Implicit \(B\)-trees: A new data structure for the dictionary problem
• Searching rigid data structures
• Analysis and experimentation on list update algorithms
• On search by address computation

This page was built for publication: Self-Organizing Heuristics for Implicit Data Structures

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