Regular numeral systems for data structures

DOI10.1007/S00236-021-00407-9OpenAlexW3184711651MaRDI QIDQ2139186FDOQ2139186

Authors: 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

Recommendations

• Strictly-regular number system and data structures
• Two skew-binary numeral systems and one application
• Numeration systems on a regular language
• Numerical representations as purely functional data structures
• scientific article; zbMATH DE number 1805762

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Introduction to algorithms.
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer arithmetic algorithms.
• Title not available (Why is that?)
• Weak-heap sort
• The weak-heap data structure: variants and applications
• A data structure for manipulating priority queues
• Multipartite priority queues
• Efficient generation of the binary reflected gray code and its applications
• Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2--4, 2010. Proceedings
• Title not available (Why is that?)
• Purely Functional Data Structures
• Implementation and Analysis of Binomial Queue Algorithms
• Fast meldable priority queues
• An applicative random-access stack
• Two skew-binary numeral systems and one application
• Two-tier relaxed heaps
• Title not available (Why is that?)
• Purely functional, real-time deques with catenation
• Title not available (Why is that?)
• Two new methods for constructing double-ended priority queues from priority queues
• A new method for functional arrays
• Integer representation and counting in the bit probe model
• Meldable heaps and boolean union-find
• Red-black trees with constant update time
• Bipartite binomial heaps
• Worst-case optimal priority queues via extended regular counters
• A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
• Fat heaps without regular counters
• In-place binary counters
• Integer representations towards efficient counting in the bit probe model
• Strictly-regular number system and data structures
• Improved methods for generating quasi-Gray codes
• Title not available (Why is that?)

Uses Software

• heapsort

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

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