default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJochen Messner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j6]Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. ACM Trans. Comput. Theory 9(2): 8:1-8:20 (2017)- 2016
- [j5]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. ACM Trans. Comput. Theory 8(4): 14:1-14:15 (2016) - 2015
- [c11]Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. ISAAC 2015: 689-699 - [i5]Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [i4]Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j4]Jochen Messner, Thomas Thierauf:
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability. Theor. Comput. Sci. 461: 55-64 (2012) - [c10]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. MFCS 2012: 478-490 - 2011
- [c9]Jochen Messner, Thomas Thierauf:
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. COCOON 2011: 168-179 - [i3]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching do not Exist. Electron. Colloquium Comput. Complex. TR11 (2011) - [i2]Jochen Messner, Thomas Thierauf:
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2009
- [j3]Olaf Beyersdorff
, Johannes Köbler, Jochen Messner:
Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410(38-40): 3839-3855 (2009) - 2004
- [j2]Juan Luis Esteban, Nicola Galesi, Jochen Messner:
On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004) - 2003
- [j1]Johannes Köbler, Jochen Messner, Jacobo Torán:
Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184(1): 71-92 (2003) - 2002
- [c8]Juan Luis Esteban, Nicola Galesi, Jochen Messner:
On the Complexity of Resolution with Bounded Conjunctions. ICALP 2002: 220-231 - [c7]Jochen Messner:
On the Structure of the Simulation Order of Proof Systems. MFCS 2002: 581-592 - 2001
- [b1]Jochen Messner:
On the simulation order of proof systems. University of Ulm, Germany, 2001, pp. I-II, 1-110 - 2000
- [c6]Johannes Köbler, Jochen Messner:
Is the Standard Proof System for SAT P-Optimal? FSTTCS 2000: 361-372
1990 – 1999
- 1999
- [c5]Dieter Kranzlmüller, Jochen Messner, Christian Schaubschläger:
"Good Enough" Testing of Nondeterministic Parallel Programs. PDPTA 1999: 641-646 - [c4]Jochen Meßner:
On Optimal Algorithms and Optimal Proof Systems. STACS 1999: 541-550 - 1998
- [c3]Johannes Köbler, Jochen Messner:
Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. CCC 1998: 132-140 - [c2]Jochen Meßner, Jacobo Torán:
Optimal Proof Systems for Propositional Logic and Complete Sets. STACS 1998: 477-487 - 1997
- [c1]Jochen Meßner:
Pattern Matching in Trace Monoids (Extended Abstract). STACS 1997: 571-582 - [i1]Jochen Meßner, Jacobo Torán:
Optimal proof systems for Propositional Logic and complete sets. Electron. Colloquium Comput. Complex. TR97 (1997)
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-04-24 22:59 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:
