UB Paderborn / Katalog / Suche / in CDI

Mathematical Foundations of Computer Science 1988: Proceedings of the 13th Symposium Carlsbad, Czechoslovakia, August 29 – September 2, 1988

1988

Volltextzugriff (PDF)

Mathematical Foundations of Computer Science 1984: Proceedings, 11th Symposium Praha, Czechoslovakia September 3–7, 1984

1984

Volltextzugriff (PDF)

Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings

1, 2004

Volltextzugriff (PDF)

Mathematical Foundations of Computer Science 1992: 17th International Symposium Prague, Czechoslovakia, August 24–28, 1992 Proceedings

1992

Volltextzugriff (PDF)

Fixed Points of Set Functors: How Many Iterations are Needed?

Applied categorical structures, 2016-10, Vol.24 (5), p.649-661

2016

Volltextzugriff (PDF)

On endomorphism monoids in varieties of bands

Algebra universalis, 2016-10, Vol.76 (2), p.287-292

2016

Volltextzugriff (PDF)

Optimal embeddings of odd ladders into a hypercube

Discrete Applied Mathematics, 2002-01, Vol.116 (1), p.73-102

2002

Volltextzugriff (PDF)

Algorithms for transitive closure

Information processing letters, 2002-03, Vol.81 (6), p.289-296

2002

Volltextzugriff (PDF)

Set Functors and Filters

Applied categorical structures, 2015-06, Vol.23 (3), p.337-363

2015

Volltextzugriff (PDF)

Long paths in hypercubes with a quadratic number of faults

Information sciences, 2009-10, Vol.179 (21), p.3763-3771

2009

Volltextzugriff (PDF)

Endomorphism monoids of chained graphs

Discrete mathematics, 2002, Vol.242 (1), p.157-174

2002

Volltextzugriff (PDF)

Universal expansions and determinacy for finitely generated varieties of dp-algebras

Acta scientiarum mathematicarum (Szeged), 2012-01, Vol.78 (3-4), p.419-458

2012

Volltextzugriff (PDF)

On the disjunctive set problem

Theoretical computer science, 1998-09, Vol.204 (1), p.99-118

1998

Volltextzugriff (PDF)

Almost ff-universality Implies Q-universality

Applied categorical structures, 2009-10, Vol.17 (5), p.419-434

2009

Volltextzugriff (PDF)

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

Journal of graph theory, 2006-02, Vol.51 (2), p.137-169

2006

Volltextzugriff (PDF)

Endomorphism monoids in varieties of commutative semigroups

Semigroup forum, 2013-10, Vol.87 (2), p.351-376

2013

Volltextzugriff (PDF)

Preface

Theoretical computer science, 2005-11, Vol.345 (2-3), p.171-172

2005

Volltextzugriff (PDF)

An equimorphic diversity case

Journal of algebra, 2011-07, Vol.338 (1), p.157-168

2011

Volltextzugriff (PDF)

How large are left exact functors?

Theory and applications of categories, 2001-06, Vol.8 (13), p.377

2001

Volltextzugriff (PDF)

On Relative Universality and Q-Universality

Studia logica, 2004-11, Vol.78 (1/2), p.279-291

2004

Volltextzugriff (PDF)

Optimal embeddings of generalized ladders into hypercubes

Discrete mathematics, 2001-04, Vol.233 (1), p.65-83

2001

Volltextzugriff (PDF)

Universal topological unary varieties

Topology and its applications, 2003-01, Vol.127 (3), p.425-446

Koubek, V.

2003

Volltextzugriff (PDF)

On the greatest fixed point of a set functor

Theoretical computer science, 1995-10, Vol.150 (1), p.57-75

1995

Volltextzugriff (PDF)

Almost ff-universal and q-universal varieties of modular 0-lattices

Colloquium mathematicum, 2004, Vol.101 (2), p.161-182

2004

Volltextzugriff (PDF)

Mathematical foundations of computer science 2004

Theoretical computer science, 2005, Vol.345 (2-3)

2005

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Mathematical Foundations of Computer Science 1988: Proceedings of the 13th Symposium Carlsbad, Czechoslovakia, August 29 – September 2, 1988

Mathematical Foundations of Computer Science 1984: Proceedings, 11th Symposium Praha, Czechoslovakia September 3–7, 1984

Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings

Mathematical Foundations of Computer Science 1992: 17th International Symposium Prague, Czechoslovakia, August 24–28, 1992 Proceedings

Fixed Points of Set Functors: How Many Iterations are Needed?

On endomorphism monoids in varieties of bands

Optimal embeddings of odd ladders into a hypercube

Algorithms for transitive closure

Set Functors and Filters

Long paths in hypercubes with a quadratic number of faults

Endomorphism monoids of chained graphs

Universal expansions and determinacy for finitely generated varieties of dp-algebras

On the disjunctive set problem

Almost ff-universality Implies Q-universality

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

Endomorphism monoids in varieties of commutative semigroups

Preface

An equimorphic diversity case

How large are left exact functors?

On Relative Universality and Q-Universality

Optimal embeddings of generalized ladders into hypercubes

Universal topological unary varieties

On the greatest fixed point of a set functor

Almost ff-universal and q-universal varieties of modular 0-lattices

Mathematical foundations of computer science 2004

Suchergebnisse filtern