| Publication | Date of Publication | Type |
|---|
One drop of non-determinism in a random deterministic automaton
| 2024-10-08 | Paper |
Gapped pattern statistics
| 2020-05-25 | Paper |
On the biased partial word collector problem
| 2020-02-12 | Paper |
On the search path length of random binary skip graphs
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
On the expected number of distinct gapped palindromic factors
| 2018-09-06 | Paper |
On the link pattern distribution of quarter-turn symmetric FPL configurations
| 2018-08-29 | Paper |
A new generation tree for permutations, preserving the number of fixed points
| 2018-08-29 | Paper |
Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation
| 2018-07-23 | Paper |
Preserving the number of cycles of length \(k\) in a growing uniform permutation
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Local update algorithms for random graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Non-searchability of random scale-free graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Half-turn symmetric FPLs with rare couplings and tilings of hexagons
Theoretical Computer Science | 2014-01-10 | Paper |
Asymptotic analysis and random sampling of digitally convex polyominoes
Discrete Geometry for Computer Imagery | 2013-05-31 | Paper |
Random generation of combinatorial structures: Boltzmann samplers and beyond
| 2011-12-21 | Paper |
Enumeration of alternating sign matrices of even size (quasi-)Invariant under a quarter-turn rotation
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Enumeration of alternating sign matrices of even size (quasi-)nvariant under a quarter-turn rotation
| 2009-10-16 | Paper |
Distributed Approximation Algorithm for Resource Clustering
Structural Information and Communication Complexity | 2008-07-10 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Broadcast in the rendezvous model
Information and Computation | 2006-06-30 | Paper |
Could any graph be turned into a small-world?
Theoretical Computer Science | 2006-04-28 | Paper |
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing | 2005-04-18 | Paper |
scientific article; zbMATH DE number 2127732 (Why is no real title available?)
| 2005-01-14 | Paper |
scientific article; zbMATH DE number 2086647 (Why is no real title available?)
| 2004-08-11 | Paper |
A generalization of the results of Kreweras on the enumeration polynomial of inversions in arborescences
Annales des Sciences Mathématiques du Québec | 2001-12-05 | Paper |
On the enumeration and generation of generalized Dyck words
Discrete Mathematics | 2000-12-19 | Paper |
scientific article; zbMATH DE number 1375601 (Why is no real title available?)
| 1999-12-09 | Paper |
\(Q\)-grammars and wall polyominoes
Annals of Combinatorics | 1999-10-05 | Paper |
