Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Christian Glaßer Christian Glasser ( http://dblp.L3S.de/Authors/Christian_Glaßer )

Publication years (Num. hits)
2000-2003 (16) 2004-2005 (20) 2006-2007 (19) 2008-2010 (20) 2011-2012 (7)
Publication types (Num. hits)
article(49) inproceedings(33)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(20) MFCS(6) CoRR(5) J. Comput. Syst. Sci.(5) STACS(5) FSTTCS(4) Theor. Comput. Sci.(4) IEEE Conference on Computation...(3) SIAM J. Comput.(3) Theory Comput. Syst.(3) CiE(2) COCOON(2) Developments in Language Theor...(2) Discrete Applied Mathematics(2) Inf. Comput.(2) ISAAC(2) More (+10 of total 27)
Authors
Christian Glaßer(79) Alan L. Selman(30) Liyu Zhang(21) Stephen D. Travers(18) Christian Reitwießner(16) Aduri Pavan(13) Heinz Schmitz(11) Samik Sengupta(10) Klaus W. Wagner(8) Maximilian Witek(8) Elmar Böhler(6) Victor L. Selivanov(6) Lane A. Hemaspaandra(4) Matthias Waldherr(4) Bernhard Schwarz(3) Christian Glasser(3) More (+10 of total 28)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 82 publication records. Showing 82 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek Structural Complexity of Multiobjective NP Search Problems. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Victor L. Selivanov The shrinking property for NP and coNP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Stephen D. Travers The fault tolerance of NP-hard problems. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Maximilian Witek Applications of Discrepancy Theory in Multiobjective Approximation Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers Unions of Disjoint NP-Complete Sets. Search on Bibsonomy COCOON The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Maximilian Witek Applications of Discrepancy Theory in Multiobjective Approximation. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek Hardness and Approximability in Multi-Objective Optimization. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Maximilian Witek Balanced Combinations of Solutions in Multi-Objective Optimization Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr Equivalence Problems for Circuits over Sets of Natural Numbers. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr Satisfiability of algebraic circuits over sets of natural numbers. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Glaßer Space-efficient informational redundancy. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek Approximability and Hardness in Multi-objective Optimization. Search on Bibsonomy CiE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Maximilian Witek Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang Non-mitotic sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang The Informational Content of Canonical Disjoint NP-Pairs. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Stephen D. Travers Machines that Can Output Empty Words. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Leaf languages, Gap theorems, Computational complexity, Polynomial-time hierarchy
1Christian Glaßer, Aduri Pavan, Stephen D. Travers The Fault Tolerance of NP-Hard Problems. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christian Glasser, Heinz Schmitz, Victor L. Selivanov Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Christian Glasser, Heinz Schmitz, Victor L. Selivanov Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Victor L. Selivanov The Shrinking Property for NP and coNP. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Christian Glaßer, Heinz Schmitz Languages of Dot-Depth 3/2. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Starfree regular languages, Concatenation hierarchies, Dot-depth hierarchy, Decidability
1Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner The complexity of unions of disjoint sets. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang Splitting NP-Complete Sets. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Heinz Schmitz Multiobjective Disk Cover Admits a PTAS. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glaßer Space-Efficient Informational Redundancy. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Victor L. Selivanov The Shrinking Property for NP and coNP. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glasser, Heinz Schmitz, Victor L. Selivanov Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang The Informational Content of Canonical Disjoint NP-Pairs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang Canonical disjoint NP-pairs of propositional proof systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang Autoreducibility, mitoticity, and immunity. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer Languages polylog-time reducible to dot-depth 1/2. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr Equivalence Problems for Circuits over Sets of Natural Numbers. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner The Complexity of Unions of Disjoint Sets. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang The Informational Content of Canonical Disjoint NP-Pairs. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang Non-mitotic Sets. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr Satisfiability of Algebraic Circuits over Sets of Natural Numbers. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang Non-Mitotic Sets. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner The Complexity of Unions of Disjoint Sets. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Elmar Böhler, Christian Glaßer, Daniel Meister Error-bounded probabilistic computations between MA and AM. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta Properties of NP-Complete Sets. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang Mitosis in Computational Complexity. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Stephen D. Travers Machines that Can Output Empty Words. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang Redundancy in Complete Sets. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Stephen D. Travers, Klaus W. Wagner Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Search on Bibsonomy Developments in Language Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. Search on Bibsonomy Essays in Memory of Shimon Even The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Stephen D. Travers Machines that can Output Empty Words Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang Redundancy in Complete Sets Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang Autoreducibility, Mitoticity, and Immunity Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Christian Glaßer, Stephen D. Travers, Klaus W. Wagner A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner Generation problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Samik Sengupta Reductions between disjoint NP-Pairs. Search on Bibsonomy Inf. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Steffen Reith, Heribert Vollmer The complexity of base station positioning in cellular networks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang Autoreducibility, Mitoticity, and Immunity. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang Canonical Disjoint NP-Pairs of Propositional Proof Systems. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Glaßer Polylog-Time Reductions Decrease Dot-Depth. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta Properties of NP-Complete Sets Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Christian Glaßer Counting with Counterfree Automata Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner Generation Problems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Liyu Zhang Canonical Disjoint NP-Pairs of Propositional Proof Systems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang Disjoint NP-Pairs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner Generation Problems. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta A Protocol for Serializing Unique Strategies. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta Properties of NP-Complete Sets. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Samik Sengupta Reductions between Disjoint NP-Pairs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Samik Sengupta Reductions between Disjoint NP-Pairs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Elmar Böhler, Christian Glaßer, Daniel Meister Small Bounded-Error Computations and Completeness Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang Disjoint NP-Pairs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Christian Glaßer, Gerd Wechsung Relativizing Function Classes. Search on Bibsonomy J. UCS The full citation details ... 2003 DBLP  BibTeX  RDF
1Elmar Böhler, Christian Glaßer, Daniel Meister Error-Bounded Probabilistic Computations between MA and AM. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang Disjoint NP-Pairs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Heinz Schmitz The Boolean Structure of Dot-Depth One. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2001 DBLP  BibTeX  RDF
1Christian Glaßer, Heinz Schmitz Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Search on Bibsonomy Developments in Language Theory The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer A polynomial-time approximation scheme for base station positioning in UMTS networks. Search on Bibsonomy DIAL-M The full citation details ... 2001 DBLP  DOI  BibTeX  RDF approximation algorithms, network design
1Christian Glaßer, Lane A. Hemaspaandra A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions Search on Bibsonomy CoRR The full citation details ... 2000 DBLP  BibTeX  RDF
1Christian Glaßer, Lane A. Hemaspaandra A Moment of Perfect Clarity I: The Parallel Census Technique Search on Bibsonomy CoRR The full citation details ... 2000 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Christian Glaßer A moment of perfect clarity I: the parallel census technique. Search on Bibsonomy SIGACT News The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Lane A. Hemaspaandra A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions. Search on Bibsonomy SIGACT News The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Steffen Reith, Heribert Vollmer The Complexity of Base Station Positioning in Cellular Networks. Search on Bibsonomy ICALP Satellite Workshops The full citation details ... 2000 DBLP  BibTeX  RDF
1Christian Glaßer, Heinz Schmitz Languages of Dot-Depth 3/2. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Heinz Schmitz Decidable Hierarchies of Starfree Languages. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #82 of 82 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.