Lower bounds for sorting with few random accesses to external memory

Martin Grohe, Nicole Schweikardt. Lower bounds for sorting with few random accesses to external memory. In Chen Li, editor, Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA. pages 238-249, ACM, 2005. [doi]

@inproceedings{GroheS05,
  title = {Lower bounds for sorting with few random accesses to external memory},
  author = {Martin Grohe and Nicole Schweikardt},
  year = {2005},
  doi = {10.1145/1065167.1065197},
  url = {http://doi.acm.org/10.1145/1065167.1065197},
  researchr = {https://researchr.org/publication/GroheS05},
  cites = {0},
  citedby = {0},
  pages = {238-249},
  booktitle = {Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA},
  editor = {Chen Li},
  publisher = {ACM},
  isbn = {1-59593-062-0},
}