| 2026 | ESA | Virtual-Memory Powersort. | Finn Moltmann, Tamio-Vesa Nakajima, Sebastian Wild |
| 2025 | BTW | Adaptive sorting for large keys, strings, and database rows. | Marius Kuhrt, Bernhard Seeger, Sebastian Wild, Goetz Graefe |
| 2025 | MFCS | Lazy B-Trees. | Casper Moldrup Rysgaard, Sebastian Wild |
| 2025 | WG | Succinct Preferential-Attachment Graphs. | Ziad Ismaili Alaoui, Namrata, Sebastian Wild |
| 2024 | DCC | Towards Optimal Grammars for RNA Structures. | Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong |
| 2024 | ESA | An Optimal Randomized Algorithm for Finding the Saddlepoint. | Justin Dallant, Frederik Haagensen, Riko Jacob, Lszl Kozma, Sebastian Wild |
| 2024 | FUN | Polyamorous Scheduling. | Leszek Gasieniec, Benjamin Smith, Sebastian Wild |
| 2023 | ALENEX | Multiway Powersort. | William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild |
| 2023 | DCC | RNA secondary structures: from ab initio prediction to better compression, and back. | Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong |
| 2023 | ESA | Funnelselect: Cache-Oblivious Multiple Selection. | Gerth Stlting Brodal, Sebastian Wild |
| 2022 | ALENEX | Towards the 5/6-Density Conjecture of Pinwheel Scheduling. | Leszek Gasieniec, Benjamin Smith, Sebastian Wild |
| 2022 | STOC | Randomized communication and implicit graph representations. | Nathaniel Harms, Sebastian Wild, Viktor Zamaraev |
| 2021 | ESA | Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. | J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild |
| 2020 | FOCS | Lazy Search Trees. | Bryce Sandlund, Sebastian Wild |
| 2020 | ISAAC | Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. | Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu |
| 2019 | WADS | Efficient Second-Order Shape-Constrained Function Fitting. | David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild |
| 2018 | AofA | Average Cost of QuickXsort with Pivot Sampling. | Sebastian Wild |
| 2018 | ESA | Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. | J. Ian Munro, Sebastian Wild |
| 2013 | ALENEX | Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. | Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube |
| 2012 | ESA | Average Case Analysis of Java 7's Dual Pivot Quicksort. | Sebastian Wild, Markus E. Nebel |