Computing with Catalan families
DOI10.1007/978-3-319-04921-2_46zbMATH Open1407.68343OpenAlexW607836348MaRDI QIDQ5404944FDOQ5404944
Authors: Paul Tarau
Publication date: 31 March 2014
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_46
Recommendations
- The arithmetic of recursively run-length compressed natural numbers
- Some remarks on Catalan families
- Arithmetic and Boolean operations on recursively run-length compressed natural numbers
- New classes of Catalan-type numbers and polynomials with their applications related to \(p\)-adic integrals and computational algorithms
- scientific article; zbMATH DE number 1408352
Catalan familieshereditary numbering systemsrun-length compressed numbersarithmetic algorithms for combinatorial objectsstructural complexity of natural numbers
Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Analysis of algorithms (68W40) Data structures (68P05)
Cited In (2)
This page was built for publication: Computing with Catalan families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404944)