Regular numeral systems for data structures

DOI10.1007/s00236-021-00407-9OpenAlexW3184711651MaRDI QIDQ2139186

Amr Elmasry, Jyrki Katajainen

Publication date: 17 May 2022

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

Full work available at URL: https://doi.org/10.1007/s00236-021-00407-9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• heapsort

Cites Work

• Two skew-binary numeral systems and one application
• Two new methods for constructing double-ended priority queues from priority queues
• Integer representation and counting in the bit probe model
• Two-tier relaxed heaps
• Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2--4, 2010. Proceedings
• An applicative random-access stack
• Weak-heap sort
• The weak-heap data structure: variants and applications
• Red-black trees with constant update time
• FAT HEAPS WITHOUT REGULAR COUNTERS
• In-Place Binary Counters
• Worst-Case Optimal Priority Queues via Extended Regular Counters
• Integer Representations towards Efficient Counting in the Bit Probe Model
• Purely functional, real-time deques with catenation
• A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
• Strictly-Regular Number System and Data Structures
• Improved Methods For Generating Quasi-gray Codes
• Meldable heaps and boolean union-find
• Efficient generation of the binary reflected gray code and its applications
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• A new method for functional arrays
• Bipartite binomial heaps
• Purely Functional Data Structures
• Multipartite priority queues
• Fast meldable priority queues
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular numeral systems for data structures