default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 502
Volume 502, September 2013
- Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud:
Generation of Combinatorial Structures. 1-3
- Timothy R. Walsh:
Counting maps on doughnuts. 4-15 - Gunnar Brinkmann, Nicolas Van Cleemput
, Tomaz Pisanski:
Generation of various classes of trivalent graphs. 16-29 - Mohamed Abdo:
Efficient generation of the ideals of a poset in gray code order, part II. 30-45 - Joe Sawada, Aaron Williams:
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. 46-54 - Olivier Bodini, Alice Jacquot:
Boltzmann samplers for v-balanced cycles. 55-63 - Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari:
On the time and the bit complexity of distributed randomised anonymous ring colouring. 64-75 - Jérôme Fortier, Alain Goupil, Jonathan Lortie, Jérôme Tremblay:
Exhaustive generation of gominoes. 76-87 - Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi:
Enumeration of 4-stack polyominoes. 88-97 - Alexandre Blondin Massé, Ariane Garon, Sébastien Labbé:
Combinatorial properties of double square tiles. 98-117 - Valérie Berthé, Annie Lacasse, Geneviève Paquin, Xavier Provençal:
A study of Jacobi-Perron boundary words for the generation of discrete planes. 118-142 - Jean-Christophe Aval, Philippe Duchon:
Half-turn symmetric FPLs with rare couplings and tilings of hexagons. 143-152 - Roberto Mantaci, Paolo Massazza:
On the exhaustive generation of plane partitions. 153-164 - Johan Oudinet, Alain Denise, Marie-Claude Gaudel:
A new dichotomic algorithm for the uniform random generation of words in regular languages. 165-176 - William Andrew Lorenz, Yann Ponty:
Non-redundant random generation algorithms for weighted context-free grammars. 177-194 - Jean-Christophe Aval, Adrien Boussicault, Sandrine Dasse-Hartaut:
Dyck tableaux. 195-209 - Elena Barcucci, Vincent Vajnovszki:
Generalized Schröder permutations. 210-216 - Michele D'Adderio, Adriano M. Garsia:
Explicit formulas for a sequence of binary tree polynomials. 217-226 - Olivier Bodini, Danièle Gardy, Alice Jacquot:
Asymptotics and random sampling for BCI and BCK lambda terms. 227-238 - Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi:
Catalan structures and Catalan pairs. 239-248
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
