Christian Glaßer

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 15

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

MFCS

Theor. Comput. Sci.

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

Fabian Egidy, Christian Glaßer, Martin Herold
Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. CoRR (2023)
Fabian Egidy, Christian Glaßer, Martin Herold
Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. MFCS (2023)
Anton Ehrmanntraut, Fabian Egidy, Christian Glaßer
Oracle with P=NP∩coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP. CoRR (2022)
Anton Ehrmanntraut, Fabian Egidy, Christian Glaßer
Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. MFCS (2022)
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
Emptiness problems for integer circuits. Theor. Comput. Sci. (2020)
Titus Dose, Christian Glaßer
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. STACS (2020)
Titus Dose, Christian Glaßer
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. 26 (2019)
Christian Glaßer, Peter Jonsson, Barnaby Martin
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. Theor. Comput. Sci. 703 (2017)
Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek
Introduction to Autoreducibility and Mitoticity. Computability and Complexity (2017)
Christian Glaßer, Maximilian Witek
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes. Inf. Comput. 256 (2017)
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
Emptiness Problems for Integer Circuits. Electron. Colloquium Comput. Complex. 24 (2017)
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
Emptiness Problems for Integer Circuits. MFCS (2017)
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
Efficient algorithms for membership in boolean hierarchies of regular languages. Theor. Comput. Sci. 646 (2016)
Christian Glaßer, Peter Jonsson, Barnaby Martin
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. CiE (2016)
Christian Glaßer, Peter Jonsson, Barnaby Martin
Constraint Satisfaction Problems around Skolem Arithmetic. CoRR (2015)
Christian Glaßer, Maximilian Witek
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. MFCS (2) (2014)
Christian Glaßer, Andrew Hughes, Alan L. Selman, Nils Wisiol
Disjoint NP-Pairs and Propositional Proof Systems. SIGACT News 45 (4) (2014)
Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory 6 (1) (2014)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect correspondences between dot-depth and polynomial-time hierarchies. J. Comput. Syst. Sci. 80 (7) (2014)
Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. ICALP (1) (2013)
Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. Electron. Colloquium Comput. Complex. 20 (2013)
Christian Glaßer, Maximilian Witek
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. Electron. Colloquium Comput. Complex. 20 (2013)
Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek
Structural Complexity of Multiobjective NP Search Problems. LATIN (2012)
Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
Unions of Disjoint NP-Complete Sets. COCOON (2011)
Christian Glaßer, Christian Reitwießner, Victor L. Selivanov
The shrinking property for NP and coNP. Theor. Comput. Sci. 412 (8-10) (2011)
Christian Glaßer, Aduri Pavan, Stephen D. Travers
The fault tolerance of NP-hard problems. Inf. Comput. 209 (3) (2011)
Christian Glaßer, Christian Reitwießner, Maximilian Witek
Applications of Discrepancy Theory in Multiobjective Approximation. FSTTCS (2011)
Christian Glaßer, Christian Reitwießner, Maximilian Witek
Applications of Discrepancy Theory in Multiobjective Approximation CoRR (2011)
Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Electron. Colloquium Comput. Complex. 18 (2011)
Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek
Approximability and Hardness in Multi-objective Optimization. CiE (2010)
Christian Glaßer
Space-efficient informational redundancy. J. Comput. Syst. Sci. 76 (8) (2010)
Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek
Hardness and Approximability in Multi-Objective Optimization. Electron. Colloquium Comput. Complex. 17 (2010)
Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Equivalence Problems for Circuits over Sets of Natural Numbers. Theory Comput. Syst. 46 (1) (2010)
Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Satisfiability of algebraic circuits over sets of natural numbers. Discret. Appl. Math. 158 (13) (2010)
Christian Glaßer, Christian Reitwießner, Maximilian Witek
Balanced Combinations of Solutions in Multi-Objective Optimization CoRR (2010)
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
10501 Executive Summary - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees (2010)
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees (2010)
Christian Glaßer, Aduri Pavan, Stephen D. Travers
The Fault Tolerance of NP-Hard Problems. LATA (2009)
Christian Glaßer, Stephen D. Travers
Machines that Can Output Empty Words. Theory Comput. Syst. 44 (3) (2009)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-mitotic sets. Theor. Comput. Sci. 410 (21-23) (2009)
Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. Int. J. Found. Comput. Sci. 20 (3) (2009)
Christian Glaßer, Christian Reitwießner, Maximilian Witek
Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman. Electron. Colloquium Comput. Complex. 16 (2009)
Christian Glaßer, Heinz Schmitz
Languages of Dot-Depth 3/2. Theory Comput. Syst. 42 (2) (2008)
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS (2008)
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) (2008)
Christian Glaßer
Space-Efficient Informational Redundancy. ISAAC (2008)
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages CoRR (2008)
Christian Glaßer, Christian Reitwießner, Heinz Schmitz
Multiobjective Disk Cover Admits a PTAS. ISAAC (2008)
Christian Glaßer, Christian Reitwießner, Victor L. Selivanov
The Shrinking Property for NP and coNP. CiE (2008)
Christian Glaßer, Christian Reitwießner, Victor L. Selivanov
The Shrinking Property for NP and coNP. Electron. Colloquium Comput. Complex. 15 (029) (2008)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Splitting NP-Complete Sets. SIAM J. Comput. 37 (5) (2008)
Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS (2007)
Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Equivalence Problems for Circuits over Sets of Natural Numbers. CSR (2007)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370 (1-3) (2007)
Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. COCOON (2007)
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73 (5) (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. STACS (2007)
Christian Glaßer
Languages polylog-time reducible to dot-depth 1/2. J. Comput. Syst. Sci. 73 (1) (2007)
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electron. Colloquium Comput. Complex. 14 (094) (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-mitotic Sets. FSTTCS (2007)
Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. 14 (018) (2007)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Mitosis in Computational Complexity. TAMC (2006)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Redundancy in Complete Sets. STACS (2006)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. Essays in Memory of Shimon Even (2006)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-Mitotic Sets. Electron. Colloquium Comput. Complex. 13 (090) (2006)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. 13 (069) (2006)
Elmar Böhler, Christian Glaßer, Daniel Meister
Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72 (6) (2006)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. SIAM J. Comput. 36 (2) (2006)
Christian Glaßer, Stephen D. Travers
Machines that Can Output Empty Words. MFCS (2006)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory (2006)
Christian Glaßer, Stephen D. Travers
Machines that can Output Empty Words Electron. Colloquium Comput. Complex. (147) (2005)
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, Mitoticity, and Immunity. MFCS (2005)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Electron. Colloquium Comput. Complex. (035) (2005)
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, Mitoticity, and Immunity Electron. Colloquium Comput. Complex. (011) (2005)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Electron. Colloquium Comput. Complex. (072) (2005)
Christian Glaßer
Polylog-Time Reductions Decrease Dot-Depth. STACS (2005)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS (2005)
Christian Glaßer, Steffen Reith, Heribert Vollmer
The complexity of base station positioning in cellular networks. Discret. Appl. Math. 148 (1) (2005)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation problems. Theor. Comput. Sci. 345 (2-3) (2005)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Redundancy in Complete Sets Electron. Colloquium Comput. Complex. (068) (2005)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between disjoint NP-Pairs. Inf. Comput. 200 (2) (2005)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. SIAM J. Comput. 33 (6) (2004)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems. MFCS (2004)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs. Computational Complexity Conference (2004)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. Computational Complexity Conference (2004)
Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
A Protocol for Serializing Unique Strategies. MFCS (2004)
Christian Glaßer
Counting with Counterfree Automata Electron. Colloquium Comput. Complex. (011) (2004)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets Electron. Colloquium Comput. Complex. (019) (2004)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical Disjoint NP-Pairs of Propositional Proof Systems Electron. Colloquium Comput. Complex. (106) (2004)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems Electron. Colloquium Comput. Complex. (037) (2004)
Elmar Böhler, Christian Glaßer, Daniel Meister
Small Bounded-Error Computations and Completeness Electron. Colloquium Comput. Complex. (069) (2003)
Christian Glaßer, Gerd Wechsung
Relativizing Function Classes. J. Univers. Comput. Sci. 9 (1) (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs Electron. Colloquium Comput. Complex. 10 (027) (2003)
Elmar Böhler, Christian Glaßer, Daniel Meister
Error-Bounded Probabilistic Computations between MA and AM. MFCS (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. Computational Complexity Conference (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs Electron. Colloquium Comput. Complex. 10 (011) (2003)
Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer
A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M (2001)
Christian Glaßer, Heinz Schmitz
The Boolean Structure of Dot-Depth One. J. Autom. Lang. Comb. 6 (4) (2001)
Christian Glaßer, Heinz Schmitz
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Developments in Language Theory (2001)
Christian Glaßer, Steffen Reith, Heribert Vollmer
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops (2000)

Christian Glaßer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christian Glaßer