Exploiting Locality: Approximating Sorting Buffers

Reuven Bar-Yehuda, Jonathan Laserson. Exploiting Locality: Approximating Sorting Buffers. In Thomas Erlebach, Giuseppe Persiano, editors, Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers. Volume 3879 of Lecture Notes in Computer Science, pages 69-81, Springer, 2005. [doi]

@inproceedings{Bar-YehudaL05,
  title = {Exploiting Locality: Approximating Sorting Buffers},
  author = {Reuven Bar-Yehuda and Jonathan Laserson},
  year = {2005},
  doi = {10.1007/11671411_6},
  url = {http://dx.doi.org/10.1007/11671411_6},
  researchr = {https://researchr.org/publication/Bar-YehudaL05},
  cites = {0},
  citedby = {0},
  pages = {69-81},
  booktitle = {Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers},
  editor = {Thomas Erlebach and Giuseppe Persiano},
  volume = {3879},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-32207-8},
}