Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Gla{\ss}er, Christian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect correspondences between dot-depth and polynomial-time hierarchies
Christian Glaßer
,
Stephen Travers
,
Klaus W. Wagner
Journal of Computer and System Sciences
80
(7), 2014, pp. 1359-1373
Autoreducibility of complete sets for log-space and polynomial-time reductions
Christian Glaßer
,
Dung T. Nguyen
,
Christian Reitwießner
,
Alan L. Selman
,
Maximilian Witek
Lecture Notes in Computer Science
7965
, 2013, pp. 473-484
Unions of disjoint NP-complete sets
Christian Glaßer
,
John M. Hitchcock
,
A. Pavan
,
Stephen Travers
Lecture Notes in Computer Science
6842
, 2011, pp. 240-251
The fault tolerance of NP-hard problems
Christian Glaßer
,
A. Pavan
,
Stephen Travers
Information and Computation
209
(3), 2011, pp. 443-455
The shrinking property for
NP
and co
NP
Christian Glaßer
,
Christian Reitwießner
,
Victor Selivanov
Theoretical Computer Science
412
(8-10), 2011, pp. 853-864
Applications of discrepancy theory in multiobjective approximation
Christian Glaßer
,
Christian Reitwießner
,
Maximilian Witek
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 55-65
Equivalence problems for circuits over sets of natural numbers
Christian Glaßer
,
Katrin Herr
,
Christian Reitwießner
,
Stephen Travers
,
Matthias Waldherr
Theory of Computing Systems
46
(1), 2010, pp. 80-103
Space-efficient informational redundancy
Christian Glaßer
Journal of Computer and System Sciences
76
(8), 2010, pp. 792-811
Non-mitotic sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Liyu Zhang
Theoretical Computer Science
410
(21-23), 2009, pp. 2011-2023
The informational content of canonical disjoint
NP
pairs
Christian Glaßer
,
Alan L. Selman
,
Liyu Zhang
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 501-522
Machines that can output empty words
Christian Glaßer
,
Stephen Travers
Theory of Computing Systems
44
(3), 2009, pp. 369-390
Splitting
NP
-complete sets
Christian Glaßer
,
A. Pavan
,
Alan L. Selman
,
Liyu Zhang
SIAM Journal on Computing
37
(5), 2008, pp. 1517-1535
Multiobjective disk cover admits a PTAS
Christian Glaßer
,
Christian Reitwießner
,
Heinz Schmitz
Lecture Notes in Computer Science
5369
, 2008, pp. 40-51
Efficient algorithms for membership in Boolean hierarchies of regular languages
Christian Glaßer
,
Heinz Schmitz
,
Victor Selivanov
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 337-348
Languages of dot-depth 3/2
Christian Glaßer
,
Heinz Schmitz
Theory of Computing Systems
42
(2), 2008, pp. 256-286
The complexity of unions of disjoint sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Klaus W. Wagner
Journal of Computer and System Sciences
74
(7), 2008, pp. 1173-1187
Space-efficient informational redundancy
Christian Glaßer
Lecture Notes in Computer Science
5369
, 2008, pp. 448-459
Autoreducibility, mitoticity, and immunity
Christian Glaßer
,
Mitsunori Ogihara
,
A. Pavan
,
Alan L. Selman
,
Liyu Zhang
Journal of Computer and System Sciences
73
(5), 2007, pp. 735-754
Satisfiability of algebraic circuits over sets of natural numbers
Christian Glaßer
,
Christian Reitwießner
,
Stephen Travers
,
Matthias Waldherr
Lecture Notes in Computer Science
4855
, 2007, pp. 253-264
The complexity of unions of disjoint sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Klaus W. Wagner
Lecture Notes in Computer Science
4393
, 2007, pp. 248-259
Non-mitotic sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Liyu Zhang
Lecture Notes in Computer Science
4855
, 2007, pp. 146-157
The informational content of canonical disjoint
NP
-pairs
Christian Glaßer
,
Alan L. Selman
,
Liyu Zhang
Lecture Notes in Computer Science
4598
, 2007, pp. 307-317
Canonical disjoint
NP
-pairs of propositional proof systems
Christian Glaßer
,
Alan L. Selman
,
Liyu Zhang
Theoretical Computer Science
370
(1-3), 2007, pp. 60-73
Languages polylog-time reducible to dot-depth 1/2
Christian Glaßer
Journal of Computer and System Sciences
73
(1), 2007, pp. 36-56
Error-bounded probabilistic computations between MA and AM
Elmar Böhler
,
Christian Glaßer
,
Daniel Meister
Journal of Computer and System Sciences
72
(6), 2006, pp. 1043-1076
Seiten 1
2
>