Bipartite binomial heaps

DOI10.1051/ita/2017010zbMath1390.68209OpenAlexW2773815487MaRDI QIDQ4637854

Jyrki Katajainen, Claus Jensen, Amr Elmasry

Publication date: 3 May 2018

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2017010

zbMATH Keywords

data structuresnumeral systemsheapscomparison complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (1)

Regular numeral systems for data structures

Cites Work

• Unnamed Item
• Two new methods for constructing double-ended priority queues from priority queues
• Two-tier relaxed heaps
• Weak-heap sort
• The weak-heap data structure: variants and applications
• FAT HEAPS WITHOUT REGULAR COUNTERS
• Worst-Case Optimal Priority Queues via Extended Regular Counters
• Strictly-Regular Number System and Data Structures
• Meldable heaps and boolean union-find
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Purely Functional Data Structures
• Fast meldable priority queues

This page was built for publication: Bipartite binomial heaps