default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Glaßer
Person information
- affiliation: Julius Maximilians University Würzburg, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c42]David Dingel, Fabian Egidy, Christian Glaßer:
An Oracle with no UP-Complete Sets, but NP = PSPACE. MFCS 2024: 50:1-50:17- [i36]David Dingel, Fabian Egidy, Christian Glaßer:
An Oracle with no UP-Complete Sets, but NP=PSPACE. CoRR abs/2404.19104 (2024) - [i35]Fabian Egidy, Christian Glaßer:
Oracle without Optimal Proof Systems outside Nondeterministic Subexponential Time. CoRR abs/2408.07408 (2024) - 2023
- [c41]Fabian Egidy, Christian Glaßer, Martin G. Herold:
Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. MFCS 2023: 44:1-44:15 - [i34]Fabian Egidy, Christian Glaßer, Martin G. Herold:
Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. CoRR abs/2304.14702 (2023) - 2022
- [c40]Anton Ehrmanntraut
, Fabian Egidy, Christian Glaßer:
Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. MFCS 2022: 45:1-45:15 - [i33]Anton Ehrmanntraut, Fabian Egidy, Christian Glaßer:
Oracle with P=NP∩coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP. CoRR abs/2203.11079 (2022) - 2020
- [j31]Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau:
Emptiness problems for integer circuits. Theor. Comput. Sci. 824-825: 11-35 (2020) - [c39]Titus Dose, Christian Glaßer:
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. STACS 2020: 9:1-9:18
2010 – 2019
- 2019
- [i32]Titus Dose, Christian Glaßer:
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- [j30]Christian Glaßer, Maximilian Witek:
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes. Inf. Comput. 256: 93-107 (2017) - [j29]Christian Glaßer, Peter Jonsson, Barnaby Martin:
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. Theor. Comput. Sci. 703: 18-36 (2017) - [c38]Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek:
Introduction to Autoreducibility and Mitoticity. Computability and Complexity 2017: 56-78 - [c37]Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau:
Emptiness Problems for Integer Circuits. MFCS 2017: 33:1-33:14 - [i31]Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau:
Emptiness Problems for Integer Circuits. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j28]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient algorithms for membership in boolean hierarchies of regular languages. Theor. Comput. Sci. 646: 86-108 (2016) - [c36]Christian Glaßer, Peter Jonsson, Barnaby Martin:
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. CiE 2016: 323-332 - 2015
- [i30]Christian Glaßer, Peter Jonsson, Barnaby Martin:
Constraint Satisfaction Problems around Skolem Arithmetic. CoRR abs/1504.04181 (2015) - 2014
- [j27]Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
Perfect correspondences between dot-depth and polynomial-time hierarchies. J. Comput. Syst. Sci. 80(7): 1359-1373 (2014) - [j26]Christian Glaßer, Andrew Hughes, Alan L. Selman, Nils Wisiol:
Disjoint NP-Pairs and Propositional Proof Systems. SIGACT News 45(4): 59-75 (2014) - [j25]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory 6(1): 3:1-3:10 (2014) - [c35]Christian Glaßer, Maximilian Witek:
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. MFCS (2) 2014: 311-323 - 2013
- [c34]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: 473-484 - [i29]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. TR13 (2013) - [i28]Christian Glaßer, Maximilian Witek:
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c33]Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek:
Structural Complexity of Multiobjective NP Search Problems. LATIN 2012: 338-349 - 2011
- [j24]Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The fault tolerance of NP-hard problems. Inf. Comput. 209(3): 443-455 (2011) - [j23]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The shrinking property for NP and coNP. Theor. Comput. Sci. 412(8-10): 853-864 (2011) - [c32]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. COCOON 2011: 240-251 - [c31]Christian Glaßer, Christian Reitwießner, Maximilian Witek:
Applications of Discrepancy Theory in Multiobjective Approximation. FSTTCS 2011: 55-65 - [i27]Christian Glaßer, Christian Reitwießner, Maximilian Witek:
Applications of Discrepancy Theory in Multiobjective Approximation. CoRR abs/1107.0634 (2011) - [i26]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. TR11 (2011) - 2010
- [j22]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): 1394-1403 (2010) - [j21]Christian Glaßer:
Space-efficient informational redundancy. J. Comput. Syst. Sci. 76(8): 792-811 (2010) - [j20]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): 80-103 (2010) - [c30]Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek:
Approximability and Hardness in Multi-objective Optimization. CiE 2010: 180-189 - [e1]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010. Dagstuhl Seminar Proceedings 10501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i25]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 - [i24]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 - [i23]Christian Glaßer, Christian Reitwießner, Maximilian Witek:
Balanced Combinations of Solutions in Multi-Objective Optimization. CoRR abs/1007.5475 (2010) - [i22]Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek:
Hardness and Approximability in Multi-Objective Optimization. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j19]Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. Int. J. Found. Comput. Sci. 20(3): 501-522 (2009) - [j18]Christian Glaßer, Stephen D. Travers:
Machines that Can Output Empty Words. Theory Comput. Syst. 44(3): 369-390 (2009) - [j17]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic sets. Theor. Comput. Sci. 410(21-23): 2011-2023 (2009) - [c29]Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385 - [i21]Christian Glaßer, Christian Reitwießner, Maximilian Witek:
Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j16]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) - [j15]Christian Glaßer, Heinz Schmitz:
Languages of Dot-Depth 3/2. Theory Comput. Syst. 42(2): 256-286 (2008) - [j14]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008) - [c28]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The Shrinking Property for NP and coNP. CiE 2008: 210-220 - [c27]Christian Glaßer, Christian Reitwießner, Heinz Schmitz:
Multiobjective Disk Cover Admits a PTAS. ISAAC 2008: 40-51 - [c26]Christian Glaßer:
Space-Efficient Informational Redundancy. ISAAC 2008: 448-459 - [c25]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348 - [i20]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. CoRR abs/0802.2868 (2008) - [i19]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The Shrinking Property for NP and coNP. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j13]Christian Glaßer:
Languages polylog-time reducible to dot-depth 1/2. J. Comput. Syst. Sci. 73(1): 36-56 (2007) - [j12]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007) - [j11]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370(1-3): 60-73 (2007) - [c24]Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. COCOON 2007: 307-317 - [c23]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 - [c22]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic Sets. FSTTCS 2007: 146-157 - [c21]Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS 2007: 253-264 - [c20]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets. STACS 2007: 248-259 - [i18]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electron. Colloquium Comput. Complex. TR07 (2007) - [i17]Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j10]Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6): 1043-1076 (2006) - [j9]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006) - [c19]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: 241-253 - [c18]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 - [c17]Christian Glaßer, Stephen D. Travers:
Machines that Can Output Empty Words. MFCS 2006: 436-446 - [c16]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. STACS 2006: 444-454 - [c15]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Mitosis in Computational Complexity. TAMC 2006: 61-67 - [i16]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - [i15]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-Mitotic Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j8]Christian Glaßer, Steffen Reith, Heribert Vollmer:
The complexity of base station positioning in cellular networks. Discret. Appl. Math. 148(1): 1-12 (2005) - [j7]Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between disjoint NP-Pairs. Inf. Comput. 200(2): 247-267 (2005) - [j6]Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner:
Generation problems. Theor. Comput. Sci. 345(2-3): 260-295 (2005) - [c14]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398 - [c13]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS 2005: 399-409 - [c12]Christian Glaßer:
Polylog-Time Reductions Decrease Dot-Depth. STACS 2005: 170-181 - [i14]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. Electron. Colloquium Comput. Complex. TR05 (2005) - [i13]Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes. Electron. Colloquium Comput. Complex. TR05 (2005) - [i12]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. Electron. Colloquium Comput. Complex. TR05 (2005) - [i11]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems. Electron. Colloquium Comput. Complex. TR05 (2005) - [i10]Christian Glaßer, Stephen D. Travers:
Machines that can Output Empty Words. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j5]Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. SIAM J. Comput. 33(6): 1369-1416 (2004) - [c11]Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between Disjoint NP-Pairs. CCC 2004: 42-53 - [c10]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. CCC 2004: 184-197 - [c9]Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner:
Generation Problems. MFCS 2004: 392-403 - [c8]Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta:
A Protocol for Serializing Unique Strategies. MFCS 2004: 660-672 - [i9]Christian Glaßer:
Counting with Counterfree Automata. Electron. Colloquium Comput. Complex. TR04 (2004) - [i8]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. Electron. Colloquium Comput. Complex. TR04 (2004) - [i7]Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner:
Generation Problems. Electron. Colloquium Comput. Complex. TR04 (2004) - [i6]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical Disjoint NP-Pairs of Propositional Proof Systems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j4]Christian Glaßer, Gerd Wechsung:
Relativizing Function Classes. J. Univers. Comput. Sci. 9(1): 34-50 (2003) - [c7]Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. CCC 2003: 313-332 - [c6]Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258 - [i5]Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - [i4]Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - [i3]Elmar Böhler, Christian Glaßer, Daniel Meister:
Small Bounded-Error Computations and Completeness. Electron. Colloquium Comput. Complex. TR03 (2003) - 2001
- [b1]Christian Glaßer:
Forbidden-patterns and word extensions for concatenation hierarchies. Julius Maximilians University Würzburg, Germany, 2001, pp. 1-132 - [j3]Christian Glaßer, Heinz Schmitz:
The Boolean Structure of Dot-Depth One. J. Autom. Lang. Comb. 6(4): 437-452 (2001) - [c5]Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer:
A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M 2001: 52-59 - [c4]Christian Glaßer, Heinz Schmitz:
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Developments in Language Theory 2001: 251-261 - 2000
- [j2]Lane A. Hemaspaandra, Christian Glaßer:
A moment of perfect clarity I: the parallel census technique. SIGACT News 31(3): 37-42 (2000) - [j1]Christian Glaßer, Lane A. Hemaspaandra:
A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions. SIGACT News 31(4): 39-51 (2000) - [c3]Christian Glaßer, Heinz Schmitz:
Decidable Hierarchies of Starfree Languages. FSTTCS 2000: 503-515 - [c2]Christian Glaßer, Steffen Reith, Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178 - [c1]Christian Glaßer, Heinz Schmitz:
Languages of Dot-Depth 3/2. STACS 2000: 555-566 - [i2]Christian Glaßer, Lane A. Hemaspaandra:
A Moment of Perfect Clarity I: The Parallel Census Technique. CoRR cs.CC/0007025 (2000) - [i1]Christian Glaßer, Lane A. Hemaspaandra:
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions. CoRR cs.CC/0011019 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
