Mathematical Foundations of Computer Science 2003

DOI10.1007/B11836MaRDI QIDQ5431345zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Efficient iteration in admissible combinatorial classes
• scientific article; zbMATH DE number 2127730
• A generic approach for the unranking of labeled combinatorial classes
• scientific article; zbMATH DE number 3864523
• scientific article; zbMATH DE number 1504592

Cited in

(21)

• Exhaustive generation of combinatorial objects by ECO
• Generating combinatorial sets with given properties
• On the lexicographical generation of compressed codes
• Towards a generic view of primality through multiset decompositions of natural numbers
• Efficient iteration in admissible combinatorial classes
• Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
• Generation of combinatorial elements using OOP
• On O(1) time algorithms for combinatorial generation
• A generic approach for the unranking of labeled combinatorial classes
• An exhaustive generation algorithm for Catalan objects and others
• Emulating primality with multiset representations of natural numbers
• scientific article; zbMATH DE number 2127730 (Why is no real title available?)
• scientific article; zbMATH DE number 3864523 (Why is no real title available?)
• A Groupoid of Isomorphic Data Transformations
• Efficient Algorithms for Listing Combinatorial Structures
• scientific article; zbMATH DE number 516970 (Why is no real title available?)
• Isomorph-Free Exhaustive Generation
• scientific article; zbMATH DE number 1504592 (Why is no real title available?)
• scientific article; zbMATH DE number 1504644 (Why is no real title available?)
• Beyond series-parallel concurrent systems: the case of arch processes
• A combinatorial link between labelled graphs and increasingly labelled Schröder trees

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

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