2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2024
Efficient top-down updates in AVL trees
Vincent Jugé
Since AVL trees were invented in 1962, two major open questions about rebalancing operations, which found positive answers in other balanced binary search trees, were left open: ca…
math.CO2016★ 2 cited
Abelian Ramsey Length and Asymptotic Lower Bounds
Vincent Jugé
This technical note aims at evaluating an asymptotic lower bound on abelian Ramsey lengths.