%0 Conference Paper %1 conf/stoc/AnderssonT00 %A Andersson, Arne %A Thorup, Mikkel %B STOC %D 2000 %E Yao, F. Frances %E Luks, Eugene M. %I ACM %K dblp %P 335-342 %T Tight(er) worst-case bounds on dynamic searching and priority queues. %U http://dblp.uni-trier.de/db/conf/stoc/stoc2000.html#AnderssonT00 %@ 1-58113-184-4

@inproceedings{conf/stoc/AnderssonT00, added-at = {2018-11-06T00:00:00.000+0100}, author = {Andersson, Arne and Thorup, Mikkel}, biburl = {https://www.bibsonomy.org/bibtex/20e6800a2a279eb574fb3d6f9c4293b8d/dblp}, booktitle = {STOC}, crossref = {conf/stoc/2000}, editor = {Yao, F. Frances and Luks, Eugene M.}, ee = {https://doi.org/10.1145/335305.335344}, interhash = {ad5ce4515cae36816bc47396f0c2ca92}, intrahash = {0e6800a2a279eb574fb3d6f9c4293b8d}, isbn = {1-58113-184-4}, keywords = {dblp}, pages = {335-342}, publisher = {ACM}, timestamp = {2018-11-07T16:09:27.000+0100}, title = {Tight(er) worst-case bounds on dynamic searching and priority queues.}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2000.html#AnderssonT00}, year = 2000 }