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=159
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Récents développements et problèmes dans le domaine de la génération aléatoire
Herbert S. Wilf
Theoretical Computer Science
159
(1), 1996, pp. 5-13
A parallel algorithm for the generation of a permutation and applications
Laurent Alonso
,
René Schott
Theoretical Computer Science
159
(1), 1996, pp. 15-28
"Deco" polyominoes, permutations and random generation
Elena Barcucci
,
Alberto Del Lungo
,
Renzo Pinzani
Theoretical Computer Science
159
(1), 1996, pp. 29-42
Génération aléatoire uniforme de mots de langages rationnels
Alain Denise
Theoretical Computer Science
159
(1), 1996, pp. 43-63
Probabilistic analysis of some (un)directed animals
G. Louchard
Theoretical Computer Science
159
(1), 1996, pp. 65-79
Probabilistic hyperedge replacement grammars
Mohamed Mosbah
Theoretical Computer Science
159
(1), 1996, pp. 81-102
Pavage des figures planes sans trous par des dominos: Fondement graphique de l'algorithme de Thurston, parallélisation, unicité et décomposition
J.C. Fournier
Theoretical Computer Science
159
(1), 1996, pp. 105-128
Polyominoes defined by their vertical and horizontal projections
Elena Barcucci
,
Alberto Del Lungo
,
Renzo Pinzani
,
Renzo Sprugnoli
Theoretical Computer Science
159
(1), 1996, pp. 129-136
Domino tiling in planar graphs with regular and pipartite dual
Thomas Chaboud
Theoretical Computer Science
159
(1), 1996, pp. 137-142
Buchberger's algorithm: The term rewriter's point of view
Reinhard Bündgen
Theoretical Computer Science
159
(2), 1996, pp. 143-190
Interaction systems II: The practice of optimal reductions
Andrea Asperti
,
Cosimo Laneve
Theoretical Computer Science
159
(2), 1996, pp. 191-244
A relation algebraic model of robust correctness
Thomas F. Gritzner
,
Rudolf Berghammer
Theoretical Computer Science
159
(2), 1996, pp. 245-270
On the operational semantics of nondeterminism and divergence
Hakan Erdogmus
,
Robert Johnston
,
Michael Ferguson
Theoretical Computer Science
159
(2), 1996, pp. 271-317
Constructive domain theory as a branch of intuitionistic pointfree topology
Giovanni Sambin
,
Silvio Valentini
,
Paolo Virgili
Theoretical Computer Science
159
(2), 1996, pp. 319-341
A proper hierarchy of propositional sequent calculi
Noriko H. Arai
Theoretical Computer Science
159
(2), 1996, pp. 343-354
When is the ideal completion of abstract basis algebraic
Mingsheng Ying
Theoretical Computer Science
159
(2), 1996, pp. 355-356