search result

Cover von Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space
Search for this author
Year: 2019
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von Nearly-Optimal Mergesorts

Nearly-Optimal Mergesorts

Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs
Year: 2018
Media group: LIPIcs
Cover von 33rd Annual European Symposium on Algorithms
ESA 2025, September 15-17, 2025, Warsaw, Poland
Search for this author
Year: 2025
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 351
Media group: LIPIcs
Cover von Quantitative Graded Semantics and Spectra of Behavioural Metrics

Quantitative Graded Semantics and Spectra of Behavioural Metrics

Year: 2025
Media group: LIPIcs
Cover von An Optimal Randomized Algorithm for Finding the Saddlepoint

An Optimal Randomized Algorithm for Finding the Saddlepoint

Year: 2024
Media group: LIPIcs
Cover von Funnelselect
Cache-Oblivious Multiple Selection : article in 31st Annual European Symposium on Algorithms (ESA 2023)
Search for this author
Year: 2023
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 274 : article
Media group: ARTICLE
Cover von Deterministic Cache-Oblivious Funnelselect
article in 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)
Search for this author
Year: 2024
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 294 : article
Media group: ARTICLE
Cover von Finding the saddlepoint faster than sorting
article in 2024 Symposium on Simplicity in Algorithms (SOSA)
Search for this author
Year: 2024
Publisher: Philadelphia, SIAM
Media group: ARTICLE
Cover von Deterministic Cache-Oblivious Funnelselect

Deterministic Cache-Oblivious Funnelselect

Year: 2024
Media group: LIPIcs
Cover von Polyamorous Scheduling

Polyamorous Scheduling

Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0