scientific article; zbMATH DE number 1476490

MaRDI QIDQ4490355zbMATH OpenFDO

Authors Gerth Stølting Brodal

Publication date 14 July 2000

zbMATH Keywords

dictionariespartial persistencepriority queues

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 871899
• On RAM Priority Queues
• scientific article; zbMATH DE number 218385
• Worst-case efficient external-memory priority queues
• scientific article; zbMATH DE number 871900

Cited in

(7)

• Worst-case data structures for the priority queue with attrition
• Worst-case optimal priority queues via extended regular counters
• scientific article; zbMATH DE number 4129963 (Why is no real title available?)
• Tight(er) worst-case bounds on dynamic searching and priority queues
• scientific article; zbMATH DE number 218385 (Why is no real title available?)
• scientific article; zbMATH DE number 871899 (Why is no real title available?)
• Query-optimal partially persistent B-trees with constant worst-case update time

This page was built for publication:

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