The arithmetic of recursively run-length compressed natural numbers

DOI10.1007/978-3-319-10882-7_24zbMATH Open1423.68220OpenAlexW266085017MaRDI QIDQ2938176FDOQ2938176

Authors: Paul Tarau 

Publication date: 13 January 2015

Published in: Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10882-7_24

Recommendations

• Arithmetic and Boolean operations on recursively run-length compressed natural numbers
• Computing with Catalan families
• Efficient algorithms for Zeckendorf arithmetic
• The arithmetic of trees
• Arithmetic for rooted trees

zbMATH Keywords

arithmetic algorithms for giant numbershereditary numbering systemsrepresentation complexity of natural numbersrun-length compressed numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Number-theoretic algorithms; complexity (11Y16) Functional programming and lambda calculus (68N18)

This page was built for publication: The arithmetic of recursively run-length compressed natural numbers

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