DOIAbstract
AbstractWe show, in this paper, how algorithms for the sequential generation of combinatorial structures can be automatically specified by functional equations of the form A = F(X,A)
AbstractWe show, in this paper, how algorithms for the sequential generation of combinatorial structures can be automatically specified by functional equations of the form A = F(X,A)
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
AbstractWe give extensional and intensional characterizations of higher-order functional programs wi...
AbstractA systematic approach to the random generation of labelled combinatorial objects is presente...
AbstractWe show, in this paper, how algorithms for the sequential generation of combinatorial struct...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
SIGLETIB: RN 7281 (146) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
. A systematic approach to the random generation of labelled combinatorial objects is presented. It ...
AbstractA systematic approach to the random generation of labelled combinatorial objects is presente...
AbstractWe consider systems of recursively defined combinatorial structures. We give algorithms chec...
International audienceA systematic approach to the random generation of labelled combinatorial objec...
International audienceWe consider systems of recursively defined combinatorial structures. We give a...
It is shown that the type structure of nite-type functionals associated to a combinatory algebra of ...
AbstractThis paper presents a combinatorial theory of formal power series. The combinatorial interpr...
International audienceA systematic approach to the random generation of labelled combinatorial objec...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
AbstractWe give extensional and intensional characterizations of higher-order functional programs wi...
AbstractA systematic approach to the random generation of labelled combinatorial objects is presente...
AbstractWe show, in this paper, how algorithms for the sequential generation of combinatorial struct...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
SIGLETIB: RN 7281 (146) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
. A systematic approach to the random generation of labelled combinatorial objects is presented. It ...
AbstractA systematic approach to the random generation of labelled combinatorial objects is presente...
AbstractWe consider systems of recursively defined combinatorial structures. We give algorithms chec...
International audienceA systematic approach to the random generation of labelled combinatorial objec...
International audienceWe consider systems of recursively defined combinatorial structures. We give a...
It is shown that the type structure of nite-type functionals associated to a combinatory algebra of ...
AbstractThis paper presents a combinatorial theory of formal power series. The combinatorial interpr...
International audienceA systematic approach to the random generation of labelled combinatorial objec...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
AbstractWe give extensional and intensional characterizations of higher-order functional programs wi...
AbstractA systematic approach to the random generation of labelled combinatorial objects is presente...
Add to ORKG