« Back to Record
Iacono, J. (2001). Alternatives to splay trees with O(log n) worst-case access times. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA (pp. 516-522) ACM/SIAM.
Citation APA
Permalink
Permalink
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326029



