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
[1]
Hilfe
Suche: Author="Reitwie{\ss}ner, Christian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Parsing Boolean grammars over a one-letter alphabet using online convolution
Alexander Okhotin
,
Christian Reitwießner
Theoretical Computer Science
457
, 2012, pp. 149-157
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
Conjunctive grammars with restricted disjunction
Alexander Okhotin
,
Christian Reitwießner
Theoretical Computer Science
411
(26-28), 2010, pp. 2559-2571
Multiobjective disk cover admits a PTAS
Christian Glaßer
,
Christian Reitwießner
,
Heinz Schmitz
Lecture Notes in Computer Science
5369
, 2008, pp. 40-51
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