Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68396OpenAlexW2495578842MaRDI QIDQ5431345

Conrado Martínez, Xavier Molinero

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (8)

On the lexicographical generation of compressed codes ⋮ Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study ⋮ A combinatorial link between labelled graphs and increasingly labelled Schröder trees ⋮ Beyond series-parallel concurrent systems: the case of arch processes ⋮ Towards a generic view of primality through multiset decompositions of natural numbers ⋮ A Groupoid of Isomorphic Data Transformations ⋮ Emulating Primality with Multiset Representations of Natural Numbers ⋮ Efficient iteration in admissible combinatorial classes

This page was built for publication: Mathematical Foundations of Computer Science 2003