default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Vogel 0001
Person information
- affiliation: Friedrich Schiller University Jena, Institute of Computer Science
Other persons with the same name
- Jörg Vogel 0002
![[0000-0003-2220-1404]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2220-1404")
— Julius Maximilian University of Würzburg, Institute for Molecular Infection Biology, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j9]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Monotonicity of Restarting Automata. J. Autom. Lang. Comb. 12(3): 355-371 (2007)- [j8]Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König:
Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1). LOG IN 27(146/147): 53-59 (2007) - [j7]Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König:
Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2). LOG IN 27(148): 81-89 (2007) - 2005
- [j6]Edith Hemaspaandra, Holger Spakowski, Jörg Vogel:
The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005) - 2003
- [j5]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. Theory Comput. Syst. 36(4): 375-386 (2003) - 2002
- [j4]Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel:
Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. Inf. Comput. 173(2): 123-131 (2002) - [c10]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. IFIP TCS 2002: 310-322 - 2001
- [i1]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. CoRR cs.CC/0112021 (2001) - 2000
- [c9]Holger Spakowski, Jörg Vogel:
Theta2p-Completeness: A Classical Approach for New Results. FSTTCS 2000: 348-360
1990 – 1999
- 1999
- [j3]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4(4): 287-311 (1999) - [c8]Holger Spakowski, Jörg Vogel:
The Operators minCh and maxCh on the Polynomial Hierarchy. FCT 1999: 524-535 - 1998
- [c7]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Different Types of Monotonicity for Restarting Automata. FSTTCS 1998: 343-354 - 1997
- [c6]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Restarting Automata with Rewriting. New Trends in Formal Languages 1997: 119-136 - [c5]Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel:
Deleting Automata with a Restart Operation. Developments in Language Theory 1997: 191-202 - [c4]Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel:
Monotonic Rewriting Automata with a Restart Operation. SOFSEM 1997: 505-512 - 1996
- [c3]Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata with Rewriting. SOFSEM 1996: 401-408 - 1995
- [c2]Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel:
Restarting Automata, Marcus Grammars and Context-Free Languages. Developments in Language Theory 1995: 102-111 - [c1]Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Restarting Automata. FCT 1995: 283-292
1980 – 1989
- 1985
- [j2]Michal P. Chytil, Martin Plátek, Jörg Vogel:
A note on the Chomsky hierarchy. Bull. EATCS 27: 23-29 (1985) - [j1]Jörg Vogel, Klaus W. Wagner:
Two-Way Automata with More than one Storage Medium. Theor. Comput. Sci. 39: 267-280 (1985) - 1984
- [b1]Jörg Vogel:
Zum Berechnungsvermögen von Automaten mit Checking-Stack-Bändern. University of Jena, Germany, 1984
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
