Jochen Messner

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Pattern matching in trace monoids (extended abstract) Lecture Notes in Computer Science	2022-11-09	Paper
Exact perfect matching in complete graphs ACM Transactions on Computation Theory	2019-12-06	Paper
Planarizing gadgets for perfect matching do not exist ACM Transactions on Computation Theory	2019-12-06	Paper
Game values and computational complexity: an analysis via black-white combinatorial games Algorithms and Computation	2016-01-11	Paper
A Kolmogorov complexity proof of the Lovász local lemma for satisfiability Theoretical Computer Science	2012-11-27	Paper
Planarizing Gadgets for Perfect Matching Do Not Exist Mathematical Foundations of Computer Science 2012	2012-09-25	Paper
A Kolmogorov complexity proof of the Lovász local lemma for satisfiability Lecture Notes in Computer Science	2011-08-17	Paper
Nondeterministic functions and the existence of optimal proof systems Theoretical Computer Science	2009-09-10	Paper
On the complexity of resolution with bounded conjunctions Theoretical Computer Science	2004-11-12	Paper
scientific article; zbMATH DE number 2086624 (Why is no real title available?)	2004-08-11	Paper
scientific article; zbMATH DE number 2080216 (Why is no real title available?)	2004-08-04	Paper
Optimal proof systems imply complete sets for promise classes Information and Computation	2003-07-29	Paper
scientific article; zbMATH DE number 1929970 (Why is no real title available?)	2003-06-18	Paper
scientific article; zbMATH DE number 1335888 (Why is no real title available?)	2000-05-04	Paper
scientific article; zbMATH DE number 1304339 (Why is no real title available?)	1999-11-16	Paper
scientific article; zbMATH DE number 1136087 (Why is no real title available?)	1998-07-20	Paper

Research outcomes over time

This page was built for person: Jochen Messner