Christian Glaßer Home Page Coauthor index DBLP Vis pubzone.org

Christian Glasser

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Stephen D. Travers: The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang: Non-mitotic sets. Theor. Comput. Sci. 410(21-23): 2011-2023 (2009)
2008
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Christian Reitwießner, Victor L. Selivanov: The Shrinking Property for NP and coNP. CiE 2008: 210-220
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Christian Reitwießner, Heinz Schmitz: Multiobjective Disk Cover Admits a PTAS. ISAAC 2008: 40-51
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer: Space-Efficient Informational Redundancy. ISAAC 2008: 448-459
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages CoRR abs/0802.2868: (2008)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Christian Reitwießner, Victor L. Selivanov: The Shrinking Property for NP and coNP. Electronic Colloquium on Computational Complexity (ECCC) 15(029): (2008)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Heinz Schmitz: Languages of Dot-Depth 3/2. Theory Comput. Syst. 42(2): 256-286 (2008)
2007
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Liyu Zhang: The Informational Content of Canonical Disjoint NP-Pairs. COCOON 2007: 307-317
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang: Non-mitotic Sets. FSTTCS 2007: 146-157
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr: Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS 2007: 253-264
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner: The Complexity of Unions of Disjoint Sets. STACS 2007: 248-259
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Liyu Zhang: The Informational Content of Canonical Disjoint NP-Pairs. Electronic Colloquium on Computational Complexity (ECCC) 14(018): (2007)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electronic Colloquium on Computational Complexity (ECCC) 14(094): (2007)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer: Languages polylog-time reducible to dot-depth 1/2. J. Comput. Syst. Sci. 73(1): 36-56 (2007)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Liyu Zhang: Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370(1-3): 60-73 (2007)
2006
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Stephen D. Travers, Klaus W. Wagner: Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory 2006: 408-419
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Stephen D. Travers: Machines that Can Output Empty Words. MFCS 2006: 436-446
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets. STACS 2006: 444-454
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Mitosis in Computational Complexity. TAMC 2006: 61-67
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner: The Complexity of Unions of Disjoint Sets. Electronic Colloquium on Computational Complexity (ECCC) 13(069): (2006)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang: Non-Mitotic Sets. Electronic Colloquium on Computational Complexity (ECCC) 13(090): (2006)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Christian Glaßer, Daniel Meister: Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6): 1043-1076 (2006)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006)
2005
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Liyu Zhang: Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS 2005: 399-409
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer: Polylog-Time Reductions Decrease Dot-Depth. STACS 2005: 170-181
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Steffen Reith, Heribert Vollmer: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1): 1-12 (2005)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity Electronic Colloquium on Computational Complexity (ECCC)(011): (2005)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Stephen D. Travers, Klaus W. Wagner: A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Electronic Colloquium on Computational Complexity (ECCC)(035): (2005)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(068): (2005)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Liyu Zhang: Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(072): (2005)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Stephen D. Travers: Machines that can Output Empty Words Electronic Colloquium on Computational Complexity (ECCC)(147): (2005)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between disjoint NP-Pairs. Inf. Comput. 200(2): 247-267 (2005)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation problems. Theor. Comput. Sci. 345(2-3): 260-295 (2005)
2004
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. IEEE Conference on Computational Complexity 2004: 184-197
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between Disjoint NP-Pairs. IEEE Conference on Computational Complexity 2004: 42-53
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems. MFCS 2004: 392-403
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta: A Protocol for Serializing Unique Strategies. MFCS 2004: 660-672
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer: Counting with Counterfree Automata Electronic Colloquium on Computational Complexity (ECCC)(011): (2004)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(019): (2004)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems Electronic Colloquium on Computational Complexity (ECCC)(037): (2004)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Liyu Zhang: Canonical Disjoint NP-Pairs of Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(106): (2004)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs. SIAM J. Comput. 33(6): 1369-1416 (2004)
2003
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs. IEEE Conference on Computational Complexity 2003: 313-332
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Christian Glaßer, Daniel Meister: Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC) 10(011): (2003)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC) 10(027): (2003)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Christian Glaßer, Daniel Meister: Small Bounded-Error Computations and Completeness Electronic Colloquium on Computational Complexity (ECCC)(069): (2003)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Gerd Wechsung: Relativizing Function Classes. J. UCS 9(1): 34-50 (2003)
2001
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Heinz Schmitz: Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Developments in Language Theory 2001: 251-261
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Heinz Schmitz: The Boolean Structure of Dot-Depth One. Journal of Automata, Languages and Combinatorics 6(4): 437-452 (2001)
2000
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Heinz Schmitz: Decidable Hierarchies of Starfree Languages. FSTTCS 2000: 503-515
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Steffen Reith, Heribert Vollmer: The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Heinz Schmitz: Languages of Dot-Depth 3/2. STACS 2000: 555-566
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Lane A. Hemaspaandra: A Moment of Perfect Clarity I: The Parallel Census Technique CoRR cs.CC/0007025: (2000)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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

1Elmar Böhler [10] [13] [17] [21] [24] [36]
2Marcel Crâsmaru [20]
3Matthias Galota [8]
4Lane A. Hemaspaandra (Lane A. Hemachandra) [1] [2]
5Katrin Herr [52]
6Daniel Meister [10] [13] [36]
7Mitsunori Ogihara (Mitsunori Ogiwara) [30] [34] [45]
8Aduri Pavan [18] [23] [28] [30] [34] [35] [39] [40] [45] [55] [65]
9Kenneth W. Regan [20]
10Steffen Reith [4] [8] [31]
11Christian Reitwießner [50] [52] [57] [61] [62]
12Heinz Schmitz [3] [5] [6] [7] [47] [54] [58] [59] [61]
13Bernhard Schwarz [17] [21] [24]
14Victor L. Selivanov [47] [57] [58] [59] [62]
15Alan L. Selman [11] [12] [14] [15] [16] [18] [22] [23] [25] [27] [28] [30] [33] [34] [35] [37] [38] [39] [40] [42] [44] [45] [48] [49] [51] [53] [55] [56] [63] [64]
16Samik Sengupta [11] [12] [14] [15] [18] [20] [22] [23] [25] [35]
17Stephen D. Travers [26] [29] [37] [38] [41] [43] [49] [50] [51] [52] [56] [63] [65]
18Heribert Vollmer [4] [8] [31]
19Klaus W. Wagner [17] [21] [24] [29] [38] [43] [49] [56]
20Matthias Waldherr [50] [52]
21Gerd Wechsung [9]
22Liyu Zhang [12] [14] [15] [16] [27] [28] [30] [33] [34] [37] [39] [40] [42] [44] [45] [48] [51] [53] [55] [63] [64]

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Mon Nov 23 18:13:59 2009 by Michael Ley (ley@uni-trier.de)