@INPROCEEDINGS{Geissmann2018IP,
  author = {Barbara Geissmann},
  title = {{L}ongest {I}ncreasing {S}ubsequence {U}nder {P}ersistent {C}omparison
	{E}rrors},
  booktitle = {Approximation and Online Algorithms - 16th International Workshop,
	WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
	Papers},
  year = {2018},
  editor = {Leah Epstein and Thomas Erlebach},
  volume = {11312},
  series = {Lecture Notes in Computer Science},
  pages = {259--276},
  publisher = {Springer},
  doi = {10.1007/978-3-030-04693-4\_16}
}

{"_id":"Hqx7HQzPr3yZsqFNv","bibbaseid":"geissmann-longestincreasingsubsequenceunderpersistentcomparisonerrors-2018","author_short":["Geissmann, B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Barbara"],"propositions":[],"lastnames":["Geissmann"],"suffixes":[]}],"title":"Longest Increasing Subsequence Under Persistent Comparison Errors","booktitle":"Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers","year":"2018","editor":[{"firstnames":["Leah"],"propositions":[],"lastnames":["Epstein"],"suffixes":[]},{"firstnames":["Thomas"],"propositions":[],"lastnames":["Erlebach"],"suffixes":[]}],"volume":"11312","series":"Lecture Notes in Computer Science","pages":"259–276","publisher":"Springer","doi":"10.1007/978-3-030-04693-4_16","bibtex":"@INPROCEEDINGS{Geissmann2018IP,\n author = {Barbara Geissmann},\n title = {{L}ongest {I}ncreasing {S}ubsequence {U}nder {P}ersistent {C}omparison\n\t{E}rrors},\n booktitle = {Approximation and Online Algorithms - 16th International Workshop,\n\tWAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected\n\tPapers},\n year = {2018},\n editor = {Leah Epstein and Thomas Erlebach},\n volume = {11312},\n series = {Lecture Notes in Computer Science},\n pages = {259--276},\n publisher = {Springer},\n doi = {10.1007/978-3-030-04693-4\\_16}\n}\n\n","author_short":["Geissmann, B."],"editor_short":["Epstein, L.","Erlebach, T."],"key":"Geissmann2018IP","id":"Geissmann2018IP","bibbaseid":"geissmann-longestincreasingsubsequenceunderpersistentcomparisonerrors-2018","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://polybox.ethz.ch/index.php/s/wa4X7mAfU4Cgo3p/download","dataSources":["R7QLFCx79AQPLx6QS"],"keywords":[],"search_terms":["longest","increasing","subsequence","under","persistent","comparison","errors","geissmann"],"title":"Longest Increasing Subsequence Under Persistent Comparison Errors","year":2018}