Amr Elmasry, Michael L. Fredman. Adaptive Sorting and the Information Theoretic Lower Bound. In Helmut Alt, Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Volume 2607 of Lecture Notes in Computer Science, pages 654-662, Springer, 2003. [doi]
@inproceedings{ElmasryF03,
title = {Adaptive Sorting and the Information Theoretic Lower Bound},
author = {Amr Elmasry and Michael L. Fredman},
year = {2003},
url = {http://link.springer.de/link/service/series/0558/bibs/2607/26070654.htm},
researchr = {https://researchr.org/publication/ElmasryF03},
cites = {0},
citedby = {0},
pages = {654-662},
booktitle = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
editor = {Helmut Alt and Michel Habib},
volume = {2607},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00623-0},
}