Cache-oblivious implicit predecessor dictionaries with the working-set property

DOI10.4230/LIPICS.STACS.2012.112MaRDI QIDQ2904754zbMATH OpenFDO

Authors Gerth Stølting Brodal, Casper Kejlberg-Rasmussen

Publication date 23 August 2012

Full work available at URL https://arxiv.org/abs/1112.5472

zbMATH Keywords

cache-obliviousexternal memoryI/O efficientimplicit dictionaryworking-set propertyworst case

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• A Cache-Oblivious Implicit Dictionary with the Working Set Property
• scientific article; zbMATH DE number 2038720
• Optimal worst-case operations for implicit cache-oblivious search trees.
• scientific article; zbMATH DE number 2079398
• Implicit \(B\)-trees: A new data structure for the dictionary problem

Cited in

(2)

• A Cache-Oblivious Implicit Dictionary with the Working Set Property
• scientific article; zbMATH DE number 2038720 (Why is no real title available?)

This page was built for publication: Cache-oblivious implicit predecessor dictionaries with the working-set property

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