Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Multi-finger binary search trees. (English) Zbl 07561409 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 55, 26 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{P. Chalermsook} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 55, 26 p. (2018; Zbl 07561409) Full Text: DOI arXiv
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Self-adjusting binary search trees: what makes them tick? (English) Zbl 1466.68032 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 300-312 (2015). MSC: 68P05 68R05 68W05 PDFBibTeX XMLCite \textit{P. Chalermsook} et al., Lect. Notes Comput. Sci. 9294, 300--312 (2015; Zbl 1466.68032) Full Text: DOI arXiv
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Greedy is an almost optimal deque. (English) Zbl 1444.68056 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 152-165 (2015). MSC: 68P05 PDFBibTeX XMLCite \textit{P. Chalermsook} et al., Lect. Notes Comput. Sci. 9214, 152--165 (2015; Zbl 1444.68056) Full Text: DOI arXiv
Chalermsook, Parinya; Goswami, Mayank; Kozma, Laszlo; Mehlhorn, Kurt; Saranurak, Thatchaphol Pattern-avoiding access in binary search trees. arXiv:1507.06953 Preprint, arXiv:1507.06953 [cs.DS] (2015). BibTeX Cite \textit{P. Chalermsook} et al., ``Pattern-avoiding access in binary search trees'', Preprint, arXiv:1507.06953 [cs.DS] (2015) Full Text: arXiv OA License