Dr. Jörg Vogel

Jörg Vogel Jörg Vogel Image: Jörg Vogel


Address:
Friedrich Schiller University Jena
Institute of Computer Science
Ernst-Abbe-Platz 2
Room: 3314
07743 Jena
Germany

E-Mail: joerg.vogel@uni-jena.de

Tel.: +49 (0)3641 9-46311
Fax: +49 (0)3641 9-46322

Research Areas

Automata Theory, Languages, and Complexity

Publications: Journals/Proceedings​

  • J. Rothe, H. Spakowski, and J. Vogel:
    Exact Complexity of the Winner Problem for Young Elections;
    Theory Computing Systems 36: 375-386 (2003)
  • R. Beigel, L.A. Hemaspaandra, H. Hempel, and J. Vogel:
    Optimal Series-Parallel Trade-os for Reducing a Function to Its Own Graph;
    Information and Computation 173: 123-131 (2002)
  • J. Rothe, H. Spakowski, and J. Vogel:
    Exact Complexity of Exact-Four-Colorability and for the Winner Problem for Young Elections;
    Proceedings of the 2nd IFIP International Conference on Theoretical Compu- ter Science: Kluwer Academic, 310-322 (2002)
  • H. Spakowski, and J. Vogel:
    The Complexity of Kemeny's roting system;
    Proceedings of the 5th Argentinian Workshop on Theoretical Computer Science: 157-168 (2001)
  • H. Spakowski, and J. Vogel:
    Theta2-Comleteness: a classical approach for new results;
    Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'00):
    Lectures Notes in Computer Science 1974, 348-360, (2000)
  • P. Jancar, F. Mráz, M. Plátek, and J. Vogel:
    On Monotonic Automata with a Restart Operation;
    Journal of Automata, Languages and Combinatorics 4, No 4: 287-311 (1999)
  • H. Spakowski, and J. Vogel:
    The Operators maxCh and minCh on the Polynomial Hierarchy;
    Proceedings of the 12th International Conference Fundamentals of Computing Theory (FCT'99):
    Lectures Notes in Computer Science 1684, 524-535 (1999)
  • P. Jancar, F. Mráz, M. Plátek, and J. Vogel:
    Dierent Types of Monotonicity of Restarting Automata;
    Proceedings of 18th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'98):
    Lectures Notes in Computer Science 1530, 343-354 (1998)
  • P. Jancar, F. Mráz, M. Plátek, and J. Vogel:
    Monotonic Rewriting Automata with a Restart Operation;
    Proceedings of 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'97):
    Lectures Notes in Computer Science 1338, 505-512 (1997)
  • P. Jancar, F. Mráz, M. Plátek, and J. Vogel:
    On Restarting Automata with Rewriting;
    G. Paun, A. Salomaa (Eds.): New Trends in Formal Language: Control, Cooperation, Combinatorics:
    Lectures Notes in Computer Science 1218, 119-136 (1997)
  • P. Jancar, F. Mráz, M. Plátek, M. Procházka, and J. Vogel:
    Deleting Automata with a Restart Operation;
    Proceedings of the Third International Conference Developments in Language Theory (DLT'97):
    Aristotle University of Thessaloniki, 191-201 (1997)
  • F. Mráz, M. Plátek, and J. Vogel:
    Restarting Automata with Rewriting;
    Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'96):
    Lectures Notes in Computer Science 1175, 401-408 (1996)
  • P. Jancar, F. Mráz, M. Plátek, M. Procházka, and J. Vogel:
    Restarting Automata, Marcus Grammars and Context-Free-Languages;
    Proceedings of the Second International Conference
    Developments in Language Theory (DLT'95): World Scientic, 102-111 (1996)

Publications: Technical reports/submitted papers​

  • P. Jancar, F. Mráz, M. Plátek, and J. Vogel:
    Monotonicity of Restarting Automata;
    Jenaer Schriften zur Mathematik und Informatik Math/Inf/18/03, December 2003; submitted
  • E. Hemaspaandra, H. Spakowski, and J. Vogel:
    The Complexity of Kemeny Elections;
    Jenaer Schriften zur Mathematik und Informatik Math/Inf/14/03, October 2003; submitted
  • H. Spakowski, and J. Vogel:
    Toward a Theory of Completeness for Parallel Access to NP;
    Jenaer Schriften zur Mathematik und Informatik Math/Inf/00/19, July 2000
  • H. Spakowski, and J. Vogel:
    The Complexity of Voting Schemes - a Method for Proving Completeness for Parallel Access to NP;
    Jenaer Schriften zur Mathematik und Informatik, Math/Inf/00/16, June 2000
  • L. Hemaspaandra, H. Hempel, and J. Vogel:
    Optimal Separations for Parallel versus Sequential Self-Checking:
    Parallelism can Exponentially Increase Self-Checking Cost University of Rochester, TR 691, Mai 1998
  • Jörg Vogel und Klaus Wagner (Hrsg.):
    Komplexität, Graphen und Automaten;
    Sammelband mit wissenschaftlichen Beiträgen: Gerd Wechsung zum 60. Geburtstag am 12. Februar 1999