softselect.bib

@article{BFPRT73,
 author = {Blum, Manuel and Floyd, Robert W. and Pratt, Vaughan and Rivest, Ronald L. and Tarjan, Robert E.},
 title = {Time bounds for selection},
 journal = {J. Comput. Syst. Sci.},
 volume = {7},
 issue = {4},
 month = {August},
 year = {1973},
 issn = {0022-0000},
 pages = {448--461},
 numpages = {14},
 url = {http://dx.doi.org/10.1016/S0022-0000(73)80033-9},
 doi = {http://dx.doi.org/10.1016/S0022-0000(73)80033-9},
 acmid = {1740109},
 publisher = {Academic Press, Inc.},
 address = {Orlando, FL, USA},
}
@article{Ch00,
 author = {Chazelle, Bernard},
 title = {The soft heap: an approximate priority queue with optimal error rate},
 journal = {J. ACM},
 volume = {47},
 issue = {6},
 month = {November},
 year = {2000},
 issn = {0004-5411},
 pages = {1012--1027},
 numpages = {16},
 url = {http://doi.acm.org/10.1145/355541.355554},
 doi = {http://doi.acm.org/10.1145/355541.355554},
 acmid = {355554},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {amoritization, heap, priority queue, soft heap},
}
@inproceedings{KZ09,
 author = {Kaplan, Haim and Zwick, Uri},
 title = {A simpler implementation and analysis of Chazelle's soft heaps},
 booktitle = {Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '09},
 year = {2009},
 location = {New York, New York},
 pages = {477--485},
 numpages = {9},
 url = {http://portal.acm.org/citation.cfm?id=1496770.1496823},
 acmid = {1496823},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 
@article{Ho61,
 author = {Hoare, C. A. R.},
 title = {Algorithm 65: find},
 journal = {Commun. ACM},
 volume = {4},
 issue = {7},
 month = {July},
 year = {1961},
 issn = {0001-0782},
 pages = {321--322},
 numpages = {2},
 url = {http://doi.acm.org/10.1145/366622.366647},
 doi = {http://doi.acm.org/10.1145/366622.366647},
 acmid = {366647},
 publisher = {ACM},
 address = {New York, NY, USA},
}