The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Heribert Vollmer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Heribert Vollmer
    Relations Among Parallel and Sequential Computation Models. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1996, pp:23-32 [Conf]
  2. Heribert Vollmer, Klaus W. Wagner
    Measure One Results in Computational Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:285-312 [Conf]
  3. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:260-269 [Conf]
  4. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
    Nondeterministic NC1 Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:12-21 [Conf]
  5. Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
    On the Power of Polynomial Time Bit-Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:200-207 [Conf]
  6. Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
    On the Power of Number-Theoretic Operations with Respect to Counting. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:299-314 [Conf]
  7. Heribert Vollmer, Klaus W. Wagner
    On Operators of Higher Types. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:174-184 [Conf]
  8. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:412-426 [Conf]
  9. Matthias Galota, Heribert Vollmer
    A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:355-368 [Conf]
  10. Heribert Vollmer
    The Gap-Language-Technique Revisited. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:389-399 [Conf]
  11. 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]
  12. Thomas Schwentick, Denis Thérien, Heribert Vollmer
    Partially-Ordered Two-Way Automata: A New Characterization of DA. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:239-250 [Conf]
  13. Heribert Vollmer
    Complexity Theory Made Easy. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:95-110 [Conf]
  14. Heribert Vollmer
    A Generalized Quantifier Concept in Computational Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ESSLLI, 1997, pp:99-123 [Conf]
  15. Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
    Arithmetic Circuits and Polynomial Replacement Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:164-175 [Conf]
  16. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
    On Type-2 Probabilistic Quantifiers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:369-380 [Conf]
  17. 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]
  18. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
    The Many Faces of a Translation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:890-901 [Conf]
  19. Timo Peichl, Heribert Vollmer
    Finite Automata with Generalized Acceptance Criteria. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:605-614 [Conf]
  20. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
    The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:71-82 [Conf]
  21. Todd Ebert, Heribert Vollmer
    On the Autoreducibility of Random Sequences. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:333-342 [Conf]
  22. Steffen Reith, Heribert Vollmer
    Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:640-649 [Conf]
  23. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  24. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:30-45 [Conf]
  25. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    The Complexity of Boolean Constraint Isomorphism. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:164-175 [Conf]
  26. Sven Kosub, Heinz Schmitz, Heribert Vollmer
    Uniformly Defining Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:607-617 [Conf]
  27. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:444-454 [Conf]
  28. Heribert Vollmer
    On Different Reducibility Notions for Function Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:449-460 [Conf]
  29. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
    Probabilistic Type-2 Operators and "Almost"-Classes. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:3, pp:265-289 [Journal]
  30. Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
    Characterizing Small Depth and Small Space Classes by Operators of Higher Type. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
  31. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  32. Elmar Boöler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  33. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    The Complexity of Boolean Constraint Isomorphism [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  34. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The descriptive complexity approach to LOGCFL [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  35. Heribert Vollmer
    A Generalized Quantifier Concept in Computational Complexity Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  36. Steffen Reith, Heribert Vollmer
    The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  37. 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]
  38. Timo Peichl, Heribert Vollmer
    Finite Automata with Generalized Acceptance Criteria. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:179-192 [Journal]
  39. Todd Ebert, Wolfgang Merkle, Heribert Vollmer
    On the Autoreducibility of Random Sequences [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:056, pp:- [Journal]
  40. Matthias Galota, Heribert Vollmer
    Functions Computable in Polynomial Space [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:018, pp:- [Journal]
  41. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
    The Complexity of Satisfiability Problems: Refining Schaefer's Theorem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:100, pp:- [Journal]
  42. Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
    Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:024, pp:- [Journal]
  43. Hans-Jörg Burtschick, Heribert Vollmer
    Lindstroem Quantifiers and Leaf Language Definability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:5, pp:- [Journal]
  44. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
    Probabilistic Type-2 Operators and ``Almost''-Classes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:35, pp:- [Journal]
  45. Steffen Reith, Heribert Vollmer
    The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:22, pp:- [Journal]
  46. Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
    Characterizing Small Depth and Small Space Classes by Operators of Higher Types [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:57, pp:- [Journal]
  47. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The Descriptive Complexity Approach to LOGCFL [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:59, pp:- [Journal]
  48. Matthias Galota, Heribert Vollmer
    Functions computable in polynomial space. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:198, n:1, pp:56-70 [Journal]
  49. Steffen Reith, Heribert Vollmer
    Optimal satisfiability for propositional calculi and constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:1-19 [Journal]
  50. Heribert Vollmer, Klaus W. Wagner
    Complexity Classes of Optimization Functions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:2, pp:198-219 [Journal]
  51. Hans-Jörg Burtschick, Heribert Vollmer
    Lindström Quantifiers and Leaf Language Definability. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:3, pp:277-294 [Journal]
  52. Sven Kosub, Heinz Schmitz, Heribert Vollmer
    Uniform Characterizations of Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:4, pp:525-551 [Journal]
  53. Heribert Vollmer, Klaus W. Wagner
    The Complexity of Finding Middle Elements. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:4, pp:293-307 [Journal]
  54. Heribert Vollmer
    Was leistet die Komplexitätstheorie für die Praxis? [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1999, v:22, n:5, pp:317-327 [Journal]
  55. Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
    Bases for Boolean co-clones. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:2, pp:59-66 [Journal]
  56. Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
    A note on closure properties of logspace MOD classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:91-93 [Journal]
  57. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
    Nondeterministic NC1 Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:2, pp:200-212 [Journal]
  58. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:629-652 [Journal]
  59. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
    The many faces of a translation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:163-179 [Journal]
  60. Matthias Galota, Sven Kosub, Heribert Vollmer
    Generic separations and leaf languages. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:4, pp:353-362 [Journal]
  61. K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
    The Chain Method to Separate Counting Classes. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:1, pp:93-108 [Journal]
  62. Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
    On Balanced Versus Unbalanced Computation Trees. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:411-421 [Journal]
  63. Todd Ebert, Wolfgang Merkle, Heribert Vollmer
    On the Autoreducibility of Random Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1542-1569 [Journal]
  64. Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
    Arithmetic Circuits and Polynomial Replacement Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1513-1531 [Journal]
  65. Friedrich Steimann, Heribert Vollmer
    Exploiting practical limitations of UML diagrams for model validation and execution. [Citation Graph (0, 0)][DBLP]
    Software and System Modeling, 2006, v:5, n:1, pp:26-47 [Journal]
  66. Kenneth W. Regan, Heribert Vollmer
    Gap-Languages and Log-Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:188, n:1-2, pp:101-116 [Journal]
  67. Heribert Vollmer
    Relating Polynomial Time to Constant Depth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:1, pp:159-170 [Journal]
  68. Heribert Vollmer, Klaus W. Wagner
    Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:245-258 [Journal]
  69. Heribert Vollmer
    Computational Complexity of Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:748-757 [Conf]
  70. Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
    The Complexity of Generalized Satisfiability for Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:48-62 [Conf]

  71. Extensional Uniformity for Boolean Circuits. [Citation Graph (, )][DBLP]


  72. Complexity Results for Modal Dependence Logic. [Citation Graph (, )][DBLP]


  73. 06401 Abstracts Collection - Complexity of Constraints. [Citation Graph (, )][DBLP]


  74. 06401 Executive Summary - Complexity of Constraints. [Citation Graph (, )][DBLP]


  75. 06451 Executive Summary -- Circuits, Logic, and Games . [Citation Graph (, )][DBLP]


  76. 06451 Abstracts Collection -- Circuits, Logic, and Games . [Citation Graph (, )][DBLP]


  77. Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. [Citation Graph (, )][DBLP]


  78. Counting Classes and the Fine Structure between NC1 and L. [Citation Graph (, )][DBLP]


  79. The Complexity of Reasoning for Fragments of Default Logic. [Citation Graph (, )][DBLP]


  80. Proof Complexity of Propositional Default Logic. [Citation Graph (, )][DBLP]


  81. Model Checking CTL is Almost Always Inherently Sequential. [Citation Graph (, )][DBLP]


  82. On Second-Order Monadic Groupoidal Quantifiers. [Citation Graph (, )][DBLP]


  83. The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments [Citation Graph (, )][DBLP]


  84. Extensional Uniformity for Boolean Circuits [Citation Graph (, )][DBLP]


  85. The Complexity of Reasoning for Fragments of Default Logic [Citation Graph (, )][DBLP]


  86. The Complexity of Propositional Implication [Citation Graph (, )][DBLP]


  87. The Complexity of Generalized Satisfiability for Linear Temporal Logic [Citation Graph (, )][DBLP]


  88. The Complexity of Reasoning for Fragments of Autoepistemic Logic [Citation Graph (, )][DBLP]


  89. The Complexity of Generalized Satisfiability for Linear Temporal Logic. [Citation Graph (, )][DBLP]


  90. The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. [Citation Graph (, )][DBLP]


  91. The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. [Citation Graph (, )][DBLP]


  92. The Complexity of Problems for Quantified Constraints. [Citation Graph (, )][DBLP]


  93. The Complexity of Satisfiability for Fragments of CTL and CTL*. [Citation Graph (, )][DBLP]


  94. The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. [Citation Graph (, )][DBLP]


Search in 0.207secs, Finished in 0.210secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002