Optimistic sorting and information theoretic complexity
P. McIlroy. SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, page 467--474. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (1993)
%0 Conference Paper
%1 313859
%A McIlroy, Peter
%B SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
%C Philadelphia, PA, USA
%D 1993
%I Society for Industrial and Applied Mathematics
%K 2010 kde seminar sortingalgorithm timsort
%P 467--474
%T Optimistic sorting and information theoretic complexity
%@ 0-89871-313-7
@inproceedings{313859,
added-at = {2010-06-19T22:24:15.000+0200},
address = {Philadelphia, PA, USA},
author = {McIlroy, Peter},
biburl = {https://www.bibsonomy.org/bibtex/2bc2773f73803c190e1952ad7671d8a50/kw},
booktitle = {SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms},
interhash = {7d15c87bd366d03c3ce3e67b0983dfc7},
intrahash = {bc2773f73803c190e1952ad7671d8a50},
isbn = {0-89871-313-7},
keywords = {2010 kde seminar sortingalgorithm timsort},
location = {Austin, Texas, United States},
pages = {467--474},
publisher = {Society for Industrial and Applied Mathematics},
timestamp = {2010-06-19T22:24:15.000+0200},
title = {Optimistic sorting and information theoretic complexity},
year = 1993
}
