par Iacono, John
Référence 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, ACM/SIAM, page (516-522)
Publication Publié, 2001
Publication dans des actes
Titre:
  • Alternatives to splay trees with O(log n) worst-case access times
Auteur:Iacono, John
Informations sur la publication: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, ACM/SIAM, page (516-522)
Statut de publication:Publié, 2001
Sujet CREF:Théorie des algorithmes
Langue:Français