APA (7th ed.) Citation

Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2022). A nearly optimal randomized algorithm for explorable heap selection.

Chicago Style (17th ed.) Citation

Borst, Sander, Daniel Dadush, Sophie Huiberts, and Danish Kashaev. A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. 2022.

MLA (9th ed.) Citation

Borst, Sander, et al. A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. 2022.