%0 Conference Paper %1 conf/fsttcs/AndersonKKL01 %A Anderson, Richard J. %A Kannan, Sampath %A Karloff, Howard J. %A Ladner, Richard E. %B FSTTCS %D 2001 %E Hariharan, Ramesh %E Mukund, Madhavan %E Vinay, V. %I Springer %K dblp %P 83-95 %T Thresholds and Optimal Binary Comparison Search Trees. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2001.html#AndersonKKL01 %V 2245 %@ 3-540-43002-4

@inproceedings{conf/fsttcs/AndersonKKL01, added-at = {2017-05-24T00:00:00.000+0200}, author = {Anderson, Richard J. and Kannan, Sampath and Karloff, Howard J. and Ladner, Richard E.}, biburl = {https://www.bibsonomy.org/bibtex/20951afb5d256310cc734989ba088b9a1/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2001}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V.}, ee = {https://doi.org/10.1007/3-540-45294-X_8}, interhash = {0d71992bed6112e8e14ba7baddc540df}, intrahash = {0951afb5d256310cc734989ba088b9a1}, isbn = {3-540-43002-4}, keywords = {dblp}, pages = {83-95}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:09:02.000+0200}, title = {Thresholds and Optimal Binary Comparison Search Trees.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2001.html#AndersonKKL01}, volume = 2245, year = 2001 }