Two skew-binary numeral systems and one application

DOI10.1007/s00224-011-9357-0zbMath1254.68097OpenAlexW1973118591MaRDI QIDQ692930

Jyrki Katajainen, Amr Elmasry, Claus Jensen

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9357-0

zbMATH Keywords

data structurespriority queuesnumeral systemsbinary heaps

Mathematics Subject Classification ID

Data structures (68P05) Elementary number theory (11A99)

Related Items

Regular numeral systems for data structures ⋮ Optimizing binary heaps ⋮ A Survey of Data Structures in the Bitprobe Model

Uses Software

• heapsort

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of heaps and its applications
• Two-tier relaxed heaps
• An applicative random-access stack
• Heaps on Heaps
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Optimal purely functional priority queues
• Purely Functional Data Structures
• Multipartite priority queues
• Fibonacci heaps and their uses in improved network optimization algorithms
• M-Heap: A Modified Heap Data Structure