Recurring Comparison Faults: Sorting and Finding the Minimum. Geissmann, B., Mihalák, M., & Widmayer, P. In Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, pages 227–239, 2015. Paper doi bibtex @INPROCEEDINGS{GeissmannMW2015IP,
author = {Barbara Geissmann and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer},
title = {{R}ecurring {C}omparison {F}aults: {S}orting and {F}inding the {M}inimum},
booktitle = {Fundamentals of Computation Theory - 20th International Symposium,
{FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings},
year = {2015},
pages = {227--239},
bibsource = {dblp computer science bibliography, http://dblp.org},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/fct/GeissmannMW15},
crossref = {DBLP:conf/fct/2015},
doi = {10.1007/978-3-319-22177-9_18},
timestamp = {Tue, 04 Aug 2015 13:15:04 +0200},
url = {http://dx.doi.org/10.1007/978-3-319-22177-9_18}
}
Downloads: 0
{"_id":"woDjXj9ZFCQijapcD","bibbaseid":"geissmann-mihalk-widmayer-recurringcomparisonfaultssortingandfindingtheminimum-2015","author_short":["Geissmann, B.","Mihalák, M.","Widmayer, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Barbara"],"propositions":[],"lastnames":["Geissmann"],"suffixes":[]},{"firstnames":["Matús"],"propositions":[],"lastnames":["Mihalák"],"suffixes":[]},{"firstnames":["Peter"],"propositions":[],"lastnames":["Widmayer"],"suffixes":[]}],"title":"Recurring Comparison Faults: Sorting and Finding the Minimum","booktitle":"Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings","year":"2015","pages":"227–239","bibsource":"dblp computer science bibliography, http://dblp.org","biburl":"http://dblp.uni-trier.de/rec/bib/conf/fct/GeissmannMW15","crossref":"DBLP:conf/fct/2015","doi":"10.1007/978-3-319-22177-9_18","timestamp":"Tue, 04 Aug 2015 13:15:04 +0200","url":"http://dx.doi.org/10.1007/978-3-319-22177-9_18","bibtex":"@INPROCEEDINGS{GeissmannMW2015IP,\n author = {Barbara Geissmann and Mat{\\'{u}}s Mihal{\\'{a}}k and Peter Widmayer},\n title = {{R}ecurring {C}omparison {F}aults: {S}orting and {F}inding the {M}inimum},\n booktitle = {Fundamentals of Computation Theory - 20th International Symposium,\n\t{FCT} 2015, Gda{\\'{n}}sk, Poland, August 17-19, 2015, Proceedings},\n year = {2015},\n pages = {227--239},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n biburl = {http://dblp.uni-trier.de/rec/bib/conf/fct/GeissmannMW15},\n crossref = {DBLP:conf/fct/2015},\n doi = {10.1007/978-3-319-22177-9_18},\n timestamp = {Tue, 04 Aug 2015 13:15:04 +0200},\n url = {http://dx.doi.org/10.1007/978-3-319-22177-9_18}\n}\n\n","author_short":["Geissmann, B.","Mihalák, M.","Widmayer, P."],"key":"GeissmannMW2015IP","id":"GeissmannMW2015IP","bibbaseid":"geissmann-mihalk-widmayer-recurringcomparisonfaultssortingandfindingtheminimum-2015","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/978-3-319-22177-9_18"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://polybox.ethz.ch/index.php/s/wa4X7mAfU4Cgo3p/download","dataSources":["R7QLFCx79AQPLx6QS"],"keywords":[],"search_terms":["recurring","comparison","faults","sorting","finding","minimum","geissmann","mihalák","widmayer"],"title":"Recurring Comparison Faults: Sorting and Finding the Minimum","year":2015}