 | 2009 |
|---|
| 7 |       | Ferdinand Börner,
Andrei A. Bulatov,
Hubie Chen,
Peter Jeavons,
Andrei A. Krokhin:
The complexity of constraint satisfaction games and QCSP.
Inf. Comput. 207(9): 923-944 (2009) |
| 2008 |
|---|
| 6 | | Ferdinand Börner:
Basics of Galois Connections.
Complexity of Constraints 2008: 38-67 |
| 2003 |
|---|
| 5 | | Ferdinand Börner,
Andrei A. Bulatov,
Peter Jeavons,
Andrei A. Krokhin:
Quantified Constraints: Algorithms and Complexity.
CSL 2003: 58-70 |
| 1998 |
|---|
| 4 | | Ferdinand Börner,
Lucien Haddad:
Generating Sets for Clones and Partial Clones.
ISMVL 1998: 363-368 |
| 1991 |
|---|
| 3 |  | Ferdinand Börner,
Lucien Haddad,
Reinhard Pöschel:
A Note on Minimal Partial Clones.
ISMVL 1991: 262-267 |
| 1988 |
|---|
| 2 | | Reinhard Pöschel,
F. Wächter,
Ferdinand Börner:
Realization of sets of permutations by permutation networks.
Parcella 1988: 326-331 |
| 1985 |
|---|
| 1 | | Ferdinand Börner,
Reinhard Pöschel,
Michael Gössel:
Sets of Permutations and Their Realization by Permutation Networks.
Elektronische Informationsverarbeitung und Kybernetik 21(7/8): 331-342 (1985) |
