default search action
BibTeX records: Jochen Messner
@article{DBLP:journals/toct/GurjarKMT17, author = {Rohit Gurjar and Arpita Korwar and Jochen Messner and Thomas Thierauf}, title = {Exact Perfect Matching in Complete Graphs}, journal = {{ACM} Trans. Comput. Theory}, volume = {9}, number = {2}, pages = {8:1--8:20}, year = {2017}, url = {https://doi.org/10.1145/3041402}, doi = {10.1145/3041402}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/GurjarKMT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/GurjarKMST16, author = {Rohit Gurjar and Arpita Korwar and Jochen Messner and Simon Straub and Thomas Thierauf}, title = {Planarizing Gadgets for Perfect Matching Do Not Exist}, journal = {{ACM} Trans. Comput. Theory}, volume = {8}, number = {4}, pages = {14:1--14:15}, year = {2016}, url = {https://doi.org/10.1145/2934310}, doi = {10.1145/2934310}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/GurjarKMST16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FennerGMST15, author = {Stephen A. Fenner and Daniel Grier and Jochen Messner and Luke Schaeffer and Thomas Thierauf}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {689--699}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_58}, doi = {10.1007/978-3-662-48971-0\_58}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FennerGMST15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FennerGMST15, author = {Stephen A. Fenner and Daniel Grier and Jochen Messner and Luke Schaeffer and Thomas Thierauf}, title = {Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-021}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/021}, eprinttype = {ECCC}, eprint = {TR15-021}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FennerGMST15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GurjarKMT13, author = {Rohit Gurjar and Arpita Korwar and Jochen Messner and Thomas Thierauf}, title = {Exact Perfect Matching in Complete Graphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-112}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/112}, eprinttype = {ECCC}, eprint = {TR13-112}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GurjarKMT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MessnerT12, author = {Jochen Messner and Thomas Thierauf}, title = {A Kolmogorov complexity proof of the Lov{\'{a}}sz Local Lemma for satisfiability}, journal = {Theor. Comput. Sci.}, volume = {461}, pages = {55--64}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.005}, doi = {10.1016/J.TCS.2012.06.005}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MessnerT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GurjarKMST12, author = {Rohit Gurjar and Arpita Korwar and Jochen Messner and Simon Straub and Thomas Thierauf}, editor = {Branislav Rovan and Vladimiro Sassone and Peter Widmayer}, title = {Planarizing Gadgets for Perfect Matching Do Not Exist}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7464}, pages = {478--490}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32589-2\_43}, doi = {10.1007/978-3-642-32589-2\_43}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GurjarKMST12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/MessnerT11, author = {Jochen Messner and Thomas Thierauf}, editor = {Bin Fu and Ding{-}Zhu Du}, title = {A Kolmogorov Complexity Proof of the Lov{\'{a}}sz Local Lemma for Satisfiability}, booktitle = {Computing and Combinatorics - 17th Annual International Conference, {COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6842}, pages = {168--179}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22685-4\_15}, doi = {10.1007/978-3-642-22685-4\_15}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/MessnerT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GurjarKMST11, author = {Rohit Gurjar and Arpita Korwar and Jochen Messner and Simon Straub and Thomas Thierauf}, title = {Planarizing Gadgets for Perfect Matching do not Exist}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-148}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/148}, eprinttype = {ECCC}, eprint = {TR11-148}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GurjarKMST11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MessnerT11, author = {Jochen Messner and Thomas Thierauf}, title = {A Kolmogorov Complexity Proof of the Lov{\'{a}}sz Local Lemma for Satisfiability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-018}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/018}, eprinttype = {ECCC}, eprint = {TR11-018}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MessnerT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BeyersdorffKM09, author = {Olaf Beyersdorff and Johannes K{\"{o}}bler and Jochen Messner}, title = {Nondeterministic functions and the existence of optimal proof systems}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {38-40}, pages = {3839--3855}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.05.021}, doi = {10.1016/J.TCS.2009.05.021}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BeyersdorffKM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/EstebanGM04, author = {Juan Luis Esteban and Nicola Galesi and Jochen Messner}, title = {On the complexity of resolution with bounded conjunctions}, journal = {Theor. Comput. Sci.}, volume = {321}, number = {2-3}, pages = {347--370}, year = {2004}, url = {https://doi.org/10.1016/j.tcs.2004.04.004}, doi = {10.1016/J.TCS.2004.04.004}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/EstebanGM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/KoblerMT03, author = {Johannes K{\"{o}}bler and Jochen Messner and Jacobo Tor{\'{a}}n}, title = {Optimal proof systems imply complete sets for promise classes}, journal = {Inf. Comput.}, volume = {184}, number = {1}, pages = {71--92}, year = {2003}, url = {https://doi.org/10.1016/S0890-5401(03)00058-0}, doi = {10.1016/S0890-5401(03)00058-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/KoblerMT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EstebanGM02, author = {Juan Luis Esteban and Nicola Galesi and Jochen Messner}, editor = {Peter Widmayer and Francisco Triguero Ruiz and Rafael Morales Bueno and Matthew Hennessy and Stephan J. Eidenbenz and Ricardo Conejo}, title = {On the Complexity of Resolution with Bounded Conjunctions}, booktitle = {Automata, Languages and Programming, 29th International Colloquium, {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2380}, pages = {220--231}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45465-9\_20}, doi = {10.1007/3-540-45465-9\_20}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/EstebanGM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Messner02, author = {Jochen Messner}, editor = {Krzysztof Diks and Wojciech Rytter}, title = {On the Structure of the Simulation Order of Proof Systems}, booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2420}, pages = {581--592}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45687-2\_48}, doi = {10.1007/3-540-45687-2\_48}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Messner02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:books/daglib/0008240, author = {Jochen Messner}, title = {On the simulation order of proof systems}, school = {University of Ulm, Germany}, year = {2001}, url = {https://d-nb.info/96535959X}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0008240.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/KoblerM00, author = {Johannes K{\"{o}}bler and Jochen Messner}, editor = {Sanjiv Kapoor and Sanjiva Prasad}, title = {Is the Standard Proof System for {SAT} P-Optimal?}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1974}, pages = {361--372}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44450-5\_29}, doi = {10.1007/3-540-44450-5\_29}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/KoblerM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pdpta/KranzlmullerMS99, author = {Dieter Kranzlm{\"{u}}ller and Jochen Messner and Christian Schaubschl{\"{a}}ger}, editor = {Hamid R. Arabnia}, title = {"Good Enough" Testing of Nondeterministic Parallel Programs}, booktitle = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, {PDPTA} 1999, June 28 - July 1, 1999, Las Vegas, Nevada, {USA}}, pages = {641--646}, publisher = {{CSREA} Press}, year = {1999}, timestamp = {Tue, 30 Jul 2024 10:34:32 +0200}, biburl = {https://dblp.org/rec/conf/pdpta/KranzlmullerMS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Messner99, author = {Jochen Me{\ss}ner}, editor = {Christoph Meinel and Sophie Tison}, title = {On Optimal Algorithms and Optimal Proof Systems}, booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1563}, pages = {541--550}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-49116-3\_51}, doi = {10.1007/3-540-49116-3\_51}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Messner99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KoblerM98, author = {Johannes K{\"{o}}bler and Jochen Messner}, title = {Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets}, booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998}, pages = {132--140}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/CCC.1998.694599}, doi = {10.1109/CCC.1998.694599}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/KoblerM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MessnerT98, author = {Jochen Me{\ss}ner and Jacobo Tor{\'{a}}n}, editor = {Michel Morvan and Christoph Meinel and Daniel Krob}, title = {Optimal Proof Systems for Propositional Logic and Complete Sets}, booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1373}, pages = {477--487}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0028583}, doi = {10.1007/BFB0028583}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MessnerT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Messner97, author = {Jochen Me{\ss}ner}, editor = {R{\"{u}}diger Reischuk and Michel Morvan}, title = {Pattern Matching in Trace Monoids (Extended Abstract)}, booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1200}, pages = {571--582}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0023490}, doi = {10.1007/BFB0023490}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Messner97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-026, author = {Jochen Me{\ss}ner and Jacobo Tor{\'{a}}n}, title = {Optimal proof systems for Propositional Logic and complete sets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-026}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-026/index.html}, eprinttype = {ECCC}, eprint = {TR97-026}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-026.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.