Tight bounds for online stable sorting. Gagie, T. & Nekrich, Y. J. Discrete Algorithms, 9(2):176-181, 2011.
Tight bounds for online stable sorting. [link]Link  Tight bounds for online stable sorting. [link]Paper  bibtex   
@article{journals/jda/GagieN11,
  added-at = {2021-07-25T00:00:00.000+0200},
  author = {Gagie, Travis and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/28ec61aa3e843703128c29985423b4144/dblp},
  ee = {https://doi.org/10.1016/j.jda.2011.01.003},
  interhash = {fc61306db9b824639a71d969c4c015dd},
  intrahash = {8ec61aa3e843703128c29985423b4144},
  journal = {J. Discrete Algorithms},
  keywords = {dblp},
  number = 2,
  pages = {176-181},
  timestamp = {2024-04-08T20:30:20.000+0200},
  title = {Tight bounds for online stable sorting.},
  url = {http://dblp.uni-trier.de/db/journals/jda/jda9.html#GagieN11},
  volume = 9,
  year = 2011
}

Downloads: 0