On the hierarchy of distribution-sensitive properties for data structures

DOI10.1007/S00236-013-0180-8zbMATH Open1270.68096OpenAlexW1972656838MaRDI QIDQ2391860FDOQ2391860

Authors: Amr Elmasry, Arash Farzan, John Iacono 

Publication date: 5 August 2013

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-013-0180-8

Recommendations

• A unifying property for distribution-sensitive priority queues
• Layered working-set trees
• Layered working-set trees
• A unified access bound on comparison-based dynamic dictionaries
• A history of distribution-sensitive data structures

zbMATH Keywords

self-organizing data structuresunified-bound propertyworking-set property

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Self-adjusting binary search trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Queaps
• A unified access bound on comparison-based dynamic dictionaries
• Title not available (Why is that?)
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Sequential access in splay trees takes linear time
• On the sequential access theorem and deque conjecture for splay trees
• A unifying property for distribution-sensitive priority queues
• A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
• Fishspear: a priority queue algorithm

Cited In (2)

• LATIN 2004: Theoretical Informatics
• Belga B-trees

This page was built for publication: On the hierarchy of distribution-sensitive properties for data structures

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