Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=502
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generation of combinatorial structures
Srec̑ko Brlek
,
Christophe Reutenauer
,
Jean-Guy Penaud
Theoretical Computer Science
502
, 2013, pp. 1-3
Counting maps on doughnuts
Timothy R. Walsh
Theoretical Computer Science
502
, 2013, pp. 4-15
Generation of various classes of trivalent graphs
Gunnar Brinkmann
,
Nico Van Cleemput
,
Tomaz̑ Pisanski
Theoretical Computer Science
502
, 2013, pp. 16-29
Efficient generation of the ideals of a poset in gray code order, part II
Mohamed Abdo
Theoretical Computer Science
502
, 2013, pp. 30-45
A gray code for fixed-density necklaces and Lyndon words in constant amortized time
J. Sawada
,
A. Williams
Theoretical Computer Science
502
, 2013, pp. 46-54
Boltzmann samplers for
\nu
-balanced cycles
Olivier Bodini
,
Alice Jacquot
Theoretical Computer Science
502
, 2013, pp. 55-63
On the time and the bit complexity of distributed randomised anonymous ring colouring
Y. Métivier
,
J.M. Robson
,
N. Saheb-Djahromi
,
A. Zemmari
Theoretical Computer Science
502
, 2013, pp. 64-75
Exhaustive generation of gominoes
Jérôme Fortier
,
Alain Goupil
,
Jonathan Lortie
,
Jérôme Tremblay
Theoretical Computer Science
502
, 2013, pp. 76-87
Enumeration of 4-stack polyominoes
J.M. Fedou
,
A. Frosini
,
S. Rinaldi
Theoretical Computer Science
502
, 2013, pp. 88-97
Combinatorial properties of double square tiles
A. Blondin Massé
,
A. Garon
,
S. Labbé
Theoretical Computer Science
502
, 2013, pp. 98-117
A study of Jacobi-Perron boundary words for the generation of discrete planes
Valérie Berthé
,
Annie Lacasse
,
Geneviève Paquin
,
Xavier Provençal
Theoretical Computer Science
502
, 2013, pp. 118-142
Half-turn symmetric FPLs with rare couplings and tilings of hexagons
Jean-Christophe Aval
,
Philippe Duchon
Theoretical Computer Science
502
, 2013, pp. 143-152
On the exhaustive generation of plane partitions
R. Mantaci
,
P. Massazza
Theoretical Computer Science
502
, 2013, pp. 153-164
A new dichotomic algorithm for the uniform random generation of words in regular languages
Johan Oudinet
,
Alain Denise
,
Marie-Claude Gaudel
Theoretical Computer Science
502
, 2013, pp. 165-176
Non-redundant random generation algorithms for weighted context-free grammars
William Andrew Lorenz
,
Yann Ponty
Theoretical Computer Science
502
, 2013, pp. 177-194
Dyck tableaux
Jean-Christophe Aval
,
Adrien Boussicault
,
Sandrine Dasse-Hartaut
Theoretical Computer Science
502
, 2013, pp. 195-209
Generalized Schröder permutations
Elena Barcucci
,
Vincent Vajnovszki
Theoretical Computer Science
502
, 2013, pp. 210-216
Explicit formulas for a sequence of binary tree polynomials
M. D'Adderio
,
A.M. Garsia
Theoretical Computer Science
502
, 2013, pp. 217-226
Asymptotics and random sampling for BCI and BCK lambda terms
O. Bodini
,
D. Gardy
,
A. Jacquot
Theoretical Computer Science
502
, 2013, pp. 227-238
Catalan structures and Catalan pairs
S. Bilotta
,
F. Disanto
,
R. Pinzani
,
S. Rinaldi
Theoretical Computer Science
502
, 2013, pp. 239-248