2 papers
cs.DS2026
A Refined Analysis of the Sequential Access Theorem for Splay Trees
Naonori Kakimura, Yoshihiko Terai
A splay tree is a self-adjusting binary search tree that allows access, insertion, and deletion to be performed in amortized time, where is the number of stored ele…
cs.GT2025
Computing Power Indices in Weighted Majority Games with Formal Power Series
Naonori Kakimura, Yoshihiko Terai
In this paper, we propose fast pseudo-polynomial-time algorithms for computing power indices in weighted majority games. We show that we can compute the Banzhaf index for all playe…