3,930 Hits in 4.8 sec

A calculus for the random generation of labelled combinatorial structures

Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem
1994 Theoretical Computer Science  
Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical  ...  A systematic approach to the random generation of labelled combinatorial objects is presented.  ...  Conclusions The random generation of a wide collection of labelled structures can be automated using symbolic manipulation systems.  ... 
doi:10.1016/0304-3975(94)90226-7 fatcat:tca3hycw7bbnlbxsarwd3qt3qm

A calculus of random generation [chapter]

Philippe Flajolet, Paul Zimmermann, Bernard Cutsem
1993 Lecture Notes in Computer Science  
A systematic approach to the random generation of labelled combinatorial objects is presented.  ...  In combinatorial terms, the generation problem simply amounts to drawing uniformly at random a tree with internal nodes of degree at least 2 and with leaves (external nodes) labelled by distinct integers  ...  The random generation algorithm for labelled trees corresponding to the standard speci cation A = A + ( ).  ... 
doi:10.1007/3-540-57273-2_53 fatcat:sqfmywmzzrft5eyd6bqmnyu5na

Page 5107 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
The resulting ADZ method enables one to generate decomposable data structures—both labelled and unlabelled—uniformly at random, in expected O(n'**) time and space, after a preprocessing phase of O(n?  ...  For the latter, the worst-case, as well as average case, complexity of generating a random m-ary with n internal nodes by the method of the paper is O(mn).  ... 

Page 3279 of Mathematical Reviews Vol. , Issue 96f [page]

1996 Mathematical Reviews  
generation of labelled combinatorial structures.  ...  Summary: “A systematic approach to the random generation of labelled combinatorial objects is presented.  ... 

Page 1374 of Mathematical Reviews Vol. , Issue 90C [page]

1990 Mathematical Reviews  
Joyal [Adv. in Math. 42 (1981), no. 1, 1-82; MR 84d:05025] as a model for the study of (labelled) combinatorial objects and their symmetry properties.  ...  adjoints which relate well to the algebraic structure of C[[t]]; in the present paper, the author studies the continuity properties of the linear operators in the umbral calculus by considering Banach  ... 

Page 6540 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
Summary: “In this article, we design and analyze algorithms that solve the unranking problem (i.e., generating a combinatorial structure of size n, given its rank) for a large collection of labeled combinatorial  ...  Egge (Gettysburg, PA) 2003i:05013 O5A15 68R05 Martinez, Conrado (E-UPB-LI; Barcelona) ; Molinero, Xavier (E-UPB-LI; Barcelona) A generic approach for the unranking of labeled combinatorial classes.  ... 

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

OLivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2021 Discrete Mathematics & Theoretical Computer Science  
Based on this procedure, we develop a generic algorithm to generate process executions uniformly at random.  ...  For some interesting sub-classes of processes we propose very efficient counting and random sampling algorithms.  ...  ISSN 1365-8050 Acknowledgements The authors would like to thank the anonymous referees who provided useful and detailed comments on previous versions of that article.  ... 
doi:10.46298/dmtcs.5820 fatcat:zetdgkalyffl7dzzwn72rpw3xy

Author index volume 132 (1994)

1994 Theoretical Computer Science  
Van Cutsem, A calculus for the random generation of labelled combinatorial structures (Fundamental Study) Garzon, M., see P. Koiran Homer, S., see K. Ambos-Spies Hromkovic, J., B. Rovan and A.  ...  ., see A. De Santis Diestel, R. and I. Leader, Domination games on infinite graphs (Mathematical Games) DuriS, P. and J.D.P. Rolim, A note on the density of oracle decreasing time., P.  ... 
doi:10.1016/0304-3975(94)90240-2 fatcat:nl7cda6rv5aujncx7kxgty377u

Formula Transformers and Combinatorial Test Generators for Propositional Intuitionistic Theorem Provers [article]

Paul Tarau
2019 arXiv   pre-print
that reduce formulas to equivalent formulas of a simpler structure.  ...  Our algorithms support exhaustive and random generators for formulas of these logics.  ...  Acknowledgement We thank the participants to the CLA'2018 and CLA'2019 for their comments and suggestions.  ... 
arXiv:1910.01775v1 fatcat:bbbtx56isjdxnlsetphluha4xy

Page 5057 of Mathematical Reviews Vol. , Issue 88j [page]

1988 Mathematical Reviews  
If G is freely generated by X, a subset A of G is said to be level (with respect to X) if [A], the subgroup generated by A, is freely generated by A and, for each b € [A], b €[{aA: L(a) < L(b)}].  ...  Basic definitions and combinatorial lemmas (pp. 321-350); Yeong-Nan Yeh, The calculus of virtual species and K- species (pp. 351-369); Doron Zeilberger, Toward a combinatorial proof of the Jacobian conjecture  ... 

Page 3202 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
(F-PARIS6-LF; Paris) A general upper bound for the satisfiability threshold of random r-SAT formulae. (English summary) J. Algorithms 24 (1997), no. 2, 395-420.  ...  Summary: “In this paper, we present an original method based on operator calculus for the analysis of dynamic data structures ap- plicable for Knuth’s model as well as the Markovian model.  ... 

The Combinatorics of Non-determinism

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Marc Herbstritt
2013 Foundations of Software Technology and Theoretical Computer Science  
A deep connection exists between the interleaving semantics of concurrent processes and increasingly labelled combinatorial structures.  ...  As a practical outcome of our quantitative study, we describe an efficient algorithm for generating computation paths uniformly at random.  ...  Uniform random generation of computation paths We describe in this section an algorithm to generate non-deterministic computation paths uniformly at random for a fixed non-deterministic process.  ... 
doi:10.4230/lipics.fsttcs.2013.425 dblp:conf/fsttcs/BodiniGP13 fatcat:vnfiwh46nzb43pm3264uano4tq

Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices [chapter]

Paul Tarau
2015 Lecture Notes in Computer Science  
Keywords: lambda calculus, de Bruijn indices, lambda term compression, combinatorics of lambda terms, ranking and unranking of lambda terms, bijective Gödel numberings of lambda terms.  ...  We introduce a compressed de Bruijn representation of lambda terms and define its bijections to standard representations.  ...  Acknowledgement We thank the anonymous referees of Calculemus'15 for their constructive criticisms and valuable suggestions that have helped improving the paper.  ... 
doi:10.1007/978-3-319-20615-8_8 fatcat:o6ix7yirerb6fa35gb46p7tsci

On k-colored Lambda Terms and Their Skeletons [chapter]

Paul Tarau
2017 Lecture Notes in Computer Science  
After a statistical study of properties of k-colored lambda terms and their skeletons, we focus on the case of simply-typed closed k-colored lambda terms for which a new combinatorial generation algorithm  ...  As a generalization of affine lambda terms, we introduce k-colored lambda terms obtained by labeling their lambda nodes with counts of the variables they bind.  ...  We thank the reviewers of PADL'18 for their careful reading of the paper and their valuable suggestions to improve its presentation.  ... 
doi:10.1007/978-3-319-73305-0_8 fatcat:mhxzsjus2zb6zf66mrbh3dunii

Asymptotic Distribution of Parameters in Random Maps

Olivier Bodini, Julien Courtiel, Sergey Dovgal, Hsien-Kuei Hwang, Marc Herbstritt
2018 International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms  
We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops,  ...  Each of these leads to a different limiting distribution, varying from (discrete) geometric and Poisson distributions to different continuous ones: Beta, normal, uniform, and an unusual distribution whose  ...  Uniform random generation. Cori's bijection is also useful for generating random rooted maps. Uniformly sampling a random diagram can be achieved by adding the chords sequentially one after another.  ... 
doi:10.4230/lipics.aofa.2018.13 dblp:conf/aofa/BodiniCDH18 fatcat:kzecyaqeyrceneefzfzql4quqe
« Previous Showing results 1 — 15 out of 3,930 results