The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Random maps, coalescing saddles, singularity analysis, and airy phenomena
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Statistical properties of simple types
Mathematical Structures in Computer Science
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Analytic Combinatorics
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Theoretical Computer Science
Classical and intuitionistic logic are asymptotically identical
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 5.23 |
This paper presents a bijection between combinatorial maps and a class of enriched trees, corresponding to a class of expression trees in some logical systems (constrained lambda terms). Starting from two alternative definitions of combinatorial maps: the classical definition by gluing half-edges, and a definition by non-ambiguous depth-first traversal, we derive non-trivial asymptotic expansions and efficient random generation of logic formulae (syntactic trees) in the BCI or BCK systems.