scientific article; zbMATH DE number 4047086

MaRDI QIDQ3783549zbMATH OpenFDO

Authors Lars Draws, Patrik Eriksson, Erik Forslund, Leif Höglund, Sören Vallner, Thomas Strothotte

Publication date 1988

zbMATH Keywords

double-ended priority queuesmin-max heaps

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A note on constructing min-max heaps
• Bounds for min-max heaps
• Heaps on Heaps
• Interval Heaps
• Min-max heaps and generalized priority queues

Cited in

(6)

• Reflected min-Max heaps
• A note on constructing min-max heaps
• A note on the construction of the data structure ``deap
• Recurrence relations on heaps
• Min-max heaps and generalized priority queues
• On sorting, heaps, and minimum spanning trees

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 Q3783549)