| 2009 |
|---|
| 15 | EE | Christian Glaßer,
Aduri Pavan,
Stephen D. Travers:
The Fault Tolerance of NP-Hard Problems.
LATA 2009: 374-385 |
| 14 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Liyu Zhang:
Non-mitotic sets.
Theor. Comput. Sci. 410(21-23): 2011-2023 (2009) |
| 2008 |
|---|
| 13 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Klaus W. Wagner:
The complexity of unions of disjoint sets.
J. Comput. Syst. Sci. 74(7): 1173-1187 (2008) |
| 2007 |
|---|
| 12 | EE | Christian Glaßer,
Katrin Herr,
Christian Reitwießner,
Stephen D. Travers,
Matthias Waldherr:
Equivalence Problems for Circuits over Sets of Natural Numbers.
CSR 2007: 127-138 |
| 11 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Liyu Zhang:
Non-mitotic Sets.
FSTTCS 2007: 146-157 |
| 10 | EE | Christian Glaßer,
Christian Reitwießner,
Stephen D. Travers,
Matthias Waldherr:
Satisfiability of Algebraic Circuits over Sets of Natural Numbers.
FSTTCS 2007: 253-264 |
| 9 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets.
STACS 2007: 248-259 |
| 2006 |
|---|
| 8 | EE | Christian Glaßer,
Stephen D. Travers,
Klaus W. Wagner:
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
Developments in Language Theory 2006: 408-419 |
| 7 | EE | Christian Glaßer,
Stephen D. Travers:
Machines that Can Output Empty Words.
MFCS 2006: 436-446 |
| 6 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets.
Electronic Colloquium on Computational Complexity (ECCC) 13(069): (2006) |
| 5 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Liyu Zhang:
Non-Mitotic Sets.
Electronic Colloquium on Computational Complexity (ECCC) 13(090): (2006) |
| 4 | EE | Stephen D. Travers:
The complexity of membership problems for circuits over sets of integers.
Theor. Comput. Sci. 369(1-3): 211-229 (2006) |
| 2005 |
|---|
| 3 | EE | Christian Glaßer,
Stephen D. Travers,
Klaus W. Wagner:
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
Electronic Colloquium on Computational Complexity (ECCC)(035): (2005) |
| 2 | EE | Christian Glaßer,
Stephen D. Travers:
Machines that can Output Empty Words
Electronic Colloquium on Computational Complexity (ECCC)(147): (2005) |
| 2004 |
|---|
| 1 | EE | Stephen D. Travers:
The Complexity of Membership Problems for Circuits over Sets of Integers.
MFCS 2004: 322-333 |
