APA (7th ed.) Citation

Sadeh, Y., & Kaplan, H. (2023, March 5). Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. arXiv.org. https://doi.org/10.48550/arxiv.2301.03084

Chicago Style (17th ed.) Citation

Sadeh, Yaniv, and Haim Kaplan. "Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm." ArXiv.org 5 Mar. 2023. https://doi.org/10.48550/arxiv.2301.03084.

MLA (9th ed.) Citation

Sadeh, Yaniv, and Haim Kaplan. "Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm." ArXiv.org, 5 Mar. 2023, https://doi.org/10.48550/arxiv.2301.03084.