default search action
Theoretical Computer Science, Volume 159
Volume 159, Number 1, 28 May 1996
- Herbert S. Wilf:
Récents développements et problèmes dans le domaine de la génération aléatoire. 5-13 - Laurent Alonso, René Schott:
A Parallel Algorithm for the Generation of a Permutation and Applications. 15-28 - Elena Barcucci, Alberto Del Lungo, Renzo Pinzani:
"Deco" Polyominoes, Permutations and Random Generation. 29-42 - Alain Denise:
Génération aléatoire uniforme de mots de langages rationnels. 43-63 - Guy Louchard:
Probabilistic Analysis of Some (Un)Directed Animals. 65-79 - Mohamed Mosbah:
Probabilistic Hyperedge Replacement Grammars. 81-102 - Jean-Claude Fournier:
Pavage des figures planes sans trous par des dominos: Fondement graphique de l'algorithme de Thurston, parallélisation, unicité et décomposition. 105-128 - Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Renzo Sprugnoli:
Polyominoes Defined by Their Vertical and Horizontal Projections. 129-136 - Thomas Chaboud:
Domino Tiling in Planar Graphs with Regular and Bipartite Dual. 137-142
Volume 159, Number 2, 3 June 1996
- Reinhard Bündgen:
Buchberger's Algorithm: The Term Rewriter's Point of View. 143-190 - Andrea Asperti, Cosimo Laneve:
Interaction Systems II: The Practice of Optimal Reductions. 191-244 - Thomas F. Gritzner, Rudolf Berghammer:
A Relation Algebraic Model of Robust Correctness. 245-270 - M. Hakan Erdogmus, Robert Johnston, Michael J. Ferguson:
On the Operational Semantics of Nondeterminism and Divergence. 271-317 - Giovanni Sambin, Silvio Valentini, Paolo Virgili:
Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology. 319-341 - Noriko H. Arai:
A Proper Hierarchy of Propositional Sequent Calculi. 343-354 - Mingsheng Ying:
When is the Ideal Completion of Abstract Basis Algebraic. 355-356
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.