BibTeX records: Jochen Messner

download as .bib file

@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   = {{TOCT}},
  volume    = {9},
  number    = {2},
  pages     = {8:1--8:20},
  year      = {2017},
  url       = {https://doi.org/10.1145/3041402},
  doi       = {10.1145/3041402},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/toct/GurjarKMT17},
  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   = {{TOCT}},
  volume    = {8},
  number    = {4},
  pages     = {14:1--14:15},
  year      = {2016},
  url       = {https://doi.org/10.1145/2934310},
  doi       = {10.1145/2934310},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/toct/GurjarKMST16},
  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},
  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},
  pages     = {689--699},
  year      = {2015},
  crossref  = {DBLP:conf/isaac/2015},
  url       = {https://doi.org/10.1007/978-3-662-48971-0\_58},
  doi       = {10.1007/978-3-662-48971-0\_58},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/FennerGMST15},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {21},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/021},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/FennerGMST15},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {112},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/112},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GurjarKMT13},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/MessnerT12},
  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},
  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},
  pages     = {478--490},
  year      = {2012},
  crossref  = {DBLP:conf/mfcs/2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2\_43},
  doi       = {10.1007/978-3-642-32589-2\_43},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/GurjarKMST12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MessnerT11,
  author    = {Jochen Messner and
               Thomas Thierauf},
  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},
  pages     = {168--179},
  year      = {2011},
  crossref  = {DBLP:conf/cocoon/2011},
  url       = {https://doi.org/10.1007/978-3-642-22685-4\_15},
  doi       = {10.1007/978-3-642-22685-4\_15},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/MessnerT11},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {18},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/018},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/MessnerT11},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {148},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/148},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GurjarKMST11},
  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, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/BeyersdorffKM09},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/EstebanGM04},
  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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iandc/KoblerMT03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EstebanGM02,
  author    = {Juan Luis Esteban and
               Nicola Galesi and
               Jochen Messner},
  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},
  pages     = {220--231},
  year      = {2002},
  crossref  = {DBLP:conf/icalp/2002},
  url       = {https://doi.org/10.1007/3-540-45465-9\_20},
  doi       = {10.1007/3-540-45465-9\_20},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/EstebanGM02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Messner02,
  author    = {Jochen Messner},
  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},
  pages     = {581--592},
  year      = {2002},
  crossref  = {DBLP:conf/mfcs/2002},
  url       = {https://doi.org/10.1007/3-540-45687-2\_48},
  doi       = {10.1007/3-540-45687-2\_48},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/Messner02},
  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       = {http://d-nb.info/96535959X},
  timestamp = {Wed, 18 Jan 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/books/daglib/0008240},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KoblerM00,
  author    = {Johannes K{\"{o}}bler and
               Jochen Messner},
  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.},
  pages     = {361--372},
  year      = {2000},
  crossref  = {DBLP:conf/fsttcs/2000},
  url       = {https://doi.org/10.1007/3-540-44450-5\_29},
  doi       = {10.1007/3-540-44450-5\_29},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/KoblerM00},
  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},
  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 - Junlly
               1, 1999, Las Vegas, Nevada, {USA}},
  pages     = {641--646},
  year      = {1999},
  crossref  = {DBLP:conf/pdpta/1999},
  timestamp = {Tue, 20 Apr 2004 14:47:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pdpta/KranzlmullerMS99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Messner99,
  author    = {Jochen Me{\ss}ner},
  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},
  pages     = {541--550},
  year      = {1999},
  crossref  = {DBLP:conf/stacs/1999},
  url       = {https://doi.org/10.1007/3-540-49116-3\_51},
  doi       = {10.1007/3-540-49116-3\_51},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/Messner99},
  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},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694599},
  doi       = {10.1109/CCC.1998.694599},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/KoblerM98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MessnerT98,
  author    = {Jochen Me{\ss}ner and
               Jacobo Tor{\'{a}}n},
  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},
  pages     = {477--487},
  year      = {1998},
  crossref  = {DBLP:conf/stacs/1998},
  url       = {https://doi.org/10.1007/BFb0028583},
  doi       = {10.1007/BFb0028583},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/MessnerT98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Messner97,
  author    = {Jochen Me{\ss}ner},
  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},
  pages     = {571--582},
  year      = {1997},
  crossref  = {DBLP:conf/stacs/1997},
  url       = {https://doi.org/10.1007/BFb0023490},
  doi       = {10.1007/BFb0023490},
  timestamp = {Mon, 22 May 2017 17:11:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/Messner97},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {4},
  number    = {26},
  year      = {1997},
  url       = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-026/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR97-026},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2015,
  editor    = {Khaled M. Elbassioni and
               Kazuhisa Makino},
  title     = {Algorithms and Computation - 26th International Symposium, {ISAAC}
               2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9472},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-48971-0},
  doi       = {10.1007/978-3-662-48971-0},
  isbn      = {978-3-662-48970-3},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2012,
  editor    = {Branislav Rovan and
               Vladimiro Sassone and
               Peter Widmayer},
  title     = {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},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2},
  doi       = {10.1007/978-3-642-32589-2},
  isbn      = {978-3-642-32588-5},
  timestamp = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2011,
  editor    = {Bin Fu and
               Ding{-}Zhu Du},
  title     = {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},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22685-4},
  doi       = {10.1007/978-3-642-22685-4},
  isbn      = {978-3-642-22684-7},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2002,
  editor    = {Peter Widmayer and
               Francisco Triguero Ruiz and
               Rafael Morales Bueno and
               Matthew Hennessy and
               Stephan Eidenbenz and
               Ricardo Conejo},
  title     = {Automata, Languages and Programming, 29th International Colloquium,
               {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2380},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45465-9},
  doi       = {10.1007/3-540-45465-9},
  isbn      = {3-540-43864-5},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2002,
  editor    = {Krzysztof Diks and
               Wojciech Rytter},
  title     = {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},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45687-2},
  doi       = {10.1007/3-540-45687-2},
  isbn      = {3-540-44040-2},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2000,
  editor    = {Sanjiv Kapoor and
               Sanjiva Prasad},
  title     = {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},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44450-5},
  doi       = {10.1007/3-540-44450-5},
  isbn      = {3-540-41413-4},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/pdpta/1999,
  editor    = {Hamid R. Arabnia},
  title     = {Proceedings of the International Conference on Parallel and Distributed
               Processing Techniques and Applications, {PDPTA} 1999, June 28 - Junlly
               1, 1999, Las Vegas, Nevada, {USA}},
  publisher = {{CSREA} Press},
  year      = {1999},
  isbn      = {1-892512-15-7},
  timestamp = {Tue, 20 Apr 2004 14:47:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pdpta/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1999,
  editor    = {Christoph Meinel and
               Sophie Tison},
  title     = {{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},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-49116-3},
  doi       = {10.1007/3-540-49116-3},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/1998,
  title     = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5641},
  isbn      = {0-8186-8395-3},
  timestamp = {Fri, 13 May 2016 10:33:02 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1998,
  editor    = {Michel Morvan and
               Christoph Meinel and
               Daniel Krob},
  title     = {{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},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0028542},
  doi       = {10.1007/BFb0028542},
  isbn      = {3-540-64230-7},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1997,
  editor    = {R{\"{u}}diger Reischuk and
               Michel Morvan},
  title     = {{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},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0023443},
  doi       = {10.1007/BFb0023443},
  isbn      = {3-540-62616-6},
  timestamp = {Mon, 22 May 2017 17:11:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1997},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier