|
Search the dblp DataBase
Christian Glaßer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Christian Glaßer, Alan L. Selman, Liyu Zhang
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. [Citation Graph (0, 0)][DBLP] Essays in Memory of Shimon Even, 2006, pp:241-253 [Conf]
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:184-197 [Conf]
- Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:42-53 [Conf]
- Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:313-332 [Conf]
- Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer
A polynomial-time approximation scheme for base station positioning in UMTS networks. [Citation Graph (0, 0)][DBLP] DIAL-M, 2001, pp:52-59 [Conf]
- Christian Glaßer, Heinz Schmitz
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2001, pp:251-261 [Conf]
- Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2006, pp:408-419 [Conf]
- Christian Glaßer, Heinz Schmitz
Decidable Hierarchies of Starfree Languages. [Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:503-515 [Conf]
- Christian Glaßer, Steffen Reith, Heribert Vollmer
The Complexity of Base Station Positioning in Cellular Networks. [Citation Graph (0, 0)][DBLP] ICALP Satellite Workshops, 2000, pp:167-178 [Conf]
- Elmar Böhler, Christian Glaßer, Daniel Meister
Error-Bounded Probabilistic Computations between MA and AM. [Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:249-258 [Conf]
- Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems. [Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:392-403 [Conf]
- Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
A Protocol for Serializing Unique Strategies. [Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:660-672 [Conf]
- Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, Mitoticity, and Immunity. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:387-398 [Conf]
- Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical Disjoint NP-Pairs of Propositional Proof Systems. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:399-409 [Conf]
- Christian Glaßer, Stephen D. Travers
Machines that Can Output Empty Words. [Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:436-446 [Conf]
- Christian Glaßer
Polylog-Time Reductions Decrease Dot-Depth. [Citation Graph (0, 0)][DBLP] STACS, 2005, pp:170-181 [Conf]
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Redundancy in Complete Sets. [Citation Graph (0, 0)][DBLP] STACS, 2006, pp:444-454 [Conf]
- Christian Glaßer, Heinz Schmitz
Languages of Dot-Depth 3/2. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:555-566 [Conf]
- Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:248-259 [Conf]
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Mitosis in Computational Complexity. [Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:61-67 [Conf]
- Christian Glaßer, Lane A. Hemaspaandra
A Moment of Perfect Clarity I: The Parallel Census Technique [Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal]
- Christian Glaßer, Lane A. Hemaspaandra
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions [Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal]
- Christian Glaßer, Steffen Reith, Heribert Vollmer
The complexity of base station positioning in cellular networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:148, n:1, pp:1-12 [Journal]
- Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:011, pp:- [Journal]
- Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:027, pp:- [Journal]
- Elmar Böhler, Christian Glaßer, Daniel Meister
Small Bounded-Error Computations and Completeness [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:069, pp:- [Journal]
- Christian Glaßer
Counting with Counterfree Automata [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:011, pp:- [Journal]
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:019, pp:- [Journal]
- Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:037, pp:- [Journal]
- Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical Disjoint NP-Pairs of Propositional Proof Systems [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:106, pp:- [Journal]
- Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, Mitoticity, and Immunity [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:011, pp:- [Journal]
- Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:035, pp:- [Journal]
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Redundancy in Complete Sets [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:068, pp:- [Journal]
- Christian Glaßer, Alan L. Selman, Liyu Zhang
Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:072, pp:- [Journal]
- Christian Glaßer, Stephen D. Travers
Machines that can Output Empty Words [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:147, pp:- [Journal]
- Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:200, n:2, pp:247-267 [Journal]
- Christian Glaßer, Heinz Schmitz
The Boolean Structure of Dot-Depth One. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:437-452 [Journal]
- Elmar Böhler, Christian Glaßer, Daniel Meister
Error-bounded probabilistic computations between MA and AM. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:6, pp:1043-1076 [Journal]
- Christian Glaßer
Languages polylog-time reducible to dot-depth 1/2. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2007, v:73, n:1, pp:36-56 [Journal]
- Christian Glaßer, Gerd Wechsung
Relativizing Function Classes. [Citation Graph (0, 0)][DBLP] J. UCS, 2003, v:9, n:1, pp:34-50 [Journal]
- Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:6, pp:1369-1416 [Journal]
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:2, pp:516-542 [Journal]
- Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation problems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:260-295 [Journal]
- Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical disjoint NP-pairs of propositional proof systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:60-73 [Journal]
- Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:307-317 [Conf]
- Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Equivalence Problems for Circuits over Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP] CSR, 2007, pp:127-138 [Conf]
- Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, mitoticity, and immunity. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2007, v:73, n:5, pp:735-754 [Journal]
The Shrinking Property for NP and coNP. [Citation Graph (, )][DBLP]
Approximability and Hardness in Multi-objective Optimization. [Citation Graph (, )][DBLP]
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. [Citation Graph (, )][DBLP]
Non-mitotic Sets. [Citation Graph (, )][DBLP]
Multiobjective Disk Cover Admits a PTAS. [Citation Graph (, )][DBLP]
Space-Efficient Informational Redundancy. [Citation Graph (, )][DBLP]
The Fault Tolerance of NP-Hard Problems. [Citation Graph (, )][DBLP]
Balanced Combinations of Solutions in Multi-Objective Optimization [Citation Graph (, )][DBLP]
Satisfiability of algebraic circuits over sets of natural numbers. [Citation Graph (, )][DBLP]
The Shrinking Property for NP and coNP. [Citation Graph (, )][DBLP]
The Informational Content of Canonical Disjoint NP-Pairs. [Citation Graph (, )][DBLP]
Non-Mitotic Sets. [Citation Graph (, )][DBLP]
The Complexity of Unions of Disjoint Sets. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.465secs
|