English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Self-Adjusting Binary Search Trees: What Makes Them Tick?

MPS-Authors
/persons/resource/persons44225

Chalermsook,  Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons101864

Goswami,  Mayank
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K., & Saranurak, T. (2015). Self-Adjusting Binary Search Trees: What Makes Them Tick? In N. Bansal, & I. Finocchi (Eds.), Algorithms -- ESA 2015 (pp. 300-312). Berlin: Springer. doi:10.1007/978-3-662-48350-3_26.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0028-667A-C
Abstract
There is no abstract available