Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts

Meng He 0001, Richard Peng, Yinzhan Xu. Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. In Markus E. Nebel, Stephan G. Wagner, editors, Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018. pages 32-39, SIAM, 2018. [doi]

Abstract

Abstract is missing.