%0 Conference Paper %1 conf/focs/LinialS83 %A Linial, Nathan %A Saks, Michael E. %B FOCS %D 1983 %I IEEE Computer Society %K dblp %P 473-475 %T Information Bounds Are Good for Search Problems on Ordered Data Structures %U http://dblp.uni-trier.de/db/conf/focs/focs83.html#LinialS83 %@ 0-8186-0508-1

@inproceedings{conf/focs/LinialS83, added-at = {2023-03-23T00:00:00.000+0100}, author = {Linial, Nathan and Saks, Michael E.}, biburl = {https://www.bibsonomy.org/bibtex/2ad48c89c3923a8f8f840e1c297483037/dblp}, booktitle = {FOCS}, crossref = {conf/focs/FOCS24}, ee = {https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.27}, interhash = {aa3877f42fbb1aabf512f293f8c33f6a}, intrahash = {ad48c89c3923a8f8f840e1c297483037}, isbn = {0-8186-0508-1}, keywords = {dblp}, pages = {473-475}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T10:20:31.000+0200}, title = {Information Bounds Are Good for Search Problems on Ordered Data Structures}, url = {http://dblp.uni-trier.de/db/conf/focs/focs83.html#LinialS83}, year = 1983 }