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.
Recurring Comparison Faults: Sorting and Finding the Minimum [link]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