Randomized Cup Game Algorithms against Strong Adversaries

von Bender, Michael A.
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)

Floors and Ceilings in Divide-and-Conquer Recurrences

von Kuszmaul, William
Veröffentlicht in SIAM Symposium on Simplicity in Algorithms (4. : 2021 : Online) Fourth Symposium on Simplicity in Algorithms (SOSA 2021) (2021)

Tight Bounds for Monotone Minimal Perfect Hashing

von Assadi, Sepehr
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 1 of 7 (2023)

Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs

von Kaler, Tim
Veröffentlicht in APOCS (1. : 2020 : Salt Lake City, Utah) Symposium on Algorithmic Principles of Computer Systems (APOCS20) (2021)

Tiny Pointers

von Bender, Michael A.
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 1 of 7 (2023)

Tight Bounds for Parallel Paging and Green Paging

von Agrawal, Kunal
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)