In-place binary counters

DOI10.1007/978-3-642-40313-2_32MaRDI QIDQ2849923zbMATH OpenOpenAlexFDO

Authors Amr Elmasry, Jyrki Katajainen

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_32

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data structures (68P05)

Recommendations

• Integer representations towards efficient counting in the bit probe model
• Integer representations towards efficient counting in the bit probe model
• A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
• Integer representation and counting in the bit probe model
• Integer Representation and Counting in the Bit Probe Model

Cited in

(6)

• Regular numeral systems for data structures
• Integer representations towards efficient counting in the bit probe model
• Integer representations towards efficient counting in the bit probe model
• A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
• Threshold counters with increments and decrements
• Integer representation and counting in the bit probe model

This page was built for publication: In-place binary counters

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