Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
This 10-minute conference talk by Claude Gravel from Toronto Metropolitan University explores the complete derandomization of treaps, a probabilistic data structure. Presented at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) at the Fields Institute on May 5, 2025. Discover advanced algorithmic techniques that eliminate randomness from treap implementations while maintaining their performance characteristics.
