Jaguc - a Software package for Environmental Diversity Analyses. - Markus E. Nebel; Sebastian Wild; Michael Holzhauser; Lars Huettenberger; Raphael Reitzig; Matthias Sperber; Thorsten Stoeck (J. Bioinform. Comput. Biol., 2011)

Average Case Analysis of Java 7's Dual Pivot Quicksort. - Sebastian Wild; Markus E. Nebel (ESA, 2012)

Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. - Sebastian Wild; Markus E. Nebel; Raphael Reitzig; Ulrich Laube (ALENEX, 2013)

Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort - Sebastian Wild; Markus E. Nebel; Ralph Neininger (CoRR, 2013)

Pivot Sampling in Java 7's Dual-Pivot Quicksort. - Markus E. Nebel; Sebastian Wild (CoRR, 2014)

Analysis of Pivot Sampling in Dual-Pivot Quicksort. - Sebastian Wild; Markus E. Nebel; Conrado Martínez (CoRR, 2014)

Analysis of Branch Misses in Quicksort. - Conrado Martínez; Markus E. Nebel; Sebastian Wild (ANALCO, 2015)

Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts. - Raphael Reitzig; Sebastian Wild (CoRR, 2015)

Why Is Dual-Pivot Quicksort Fast? - Sebastian Wild (CoRR, 2015)

A Simple and Fast Linear-Time Algorithm for Proportional Apportionment. - Sebastian Wild; Raphael Reitzig (CoRR, 2015)

Average Case and Distributional Analysis of Dual-Pivot Quicksort. - Sebastian Wild; Markus E. Nebel; Ralph Neininger (ACM Trans. Algorithms, 2015)

Quicksort mit zwei Pivots und mehr: Eine mathematische Analyse von Mehrwege-Partitionierungsverfahren und der Frage, wie Quicksort dadurch schneller wird. - Sebastian Wild (Ausgezeichnete Informatikdissertationen, 2016)

Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. - Markus E. Nebel; Sebastian Wild; Conrado Martínez (Algorithmica, 2016)

Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. - Sebastian Wild; Markus E. Nebel; Hosam M. Mahmoud (Algorithmica, 2016)

Median-of-k Jumplists. - Markus E. Nebel; Elisabeth Neumann; Sebastian Wild (CoRR, 2016)

Sorting Discrete i.i.d. Inputs: Quicksort is Optimal. - Sebastian Wild (CoRR, 2016)

Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential - Sebastian Wild (2016)

Quicksort Is Optimal For Many Equal Keys. - Sebastian Wild (ANALCO, 2018)

Average Cost of QuickXsort with Pivot Sampling. - Sebastian Wild (AofA, 2018)

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. - J. Ian Munro; Sebastian Wild (ESA, 2018)

Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks. - Raphael Reitzig; Sebastian Wild (Algorithmica, 2018)

Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort. - Sebastian Wild (CoRR, 2018)

Dual-pivot and beyond: The potential of multiway partitioning in quicksort. - Sebastian Wild (it Inf. Technol., 2018)

Sesquickselect: One and a half pivots for cache-efficient selection. - Conrado Martínez; Markus Nebel; Sebastian Wild (ANALCO, 2019)

Median-of-k Jumplists and Dangling-Min BSTs. - Markus E. Nebel; Elisabeth Neumann; Sebastian Wild (ANALCO, 2019)

Efficient Second-Order Shape-Constrained Function Fitting. - David Durfee; Yu Gao 001; Anup B. Rao; Sebastian Wild (WADS, 2019)

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. - J. Ian Munro; Sebastian Wild (CoRR, 2019)

Dynamic Optimality Refuted - For Tournament Heaps. - J. Ian Munro; Richard Peng; Sebastian Wild; Lingyi Zhang (CoRR, 2019)

Lazy Search Trees. - Bryce Sandlund; Sebastian Wild (FOCS, 2020)

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. - Meng He 001; J. Ian Munro; Yakov Nekrich; Sebastian Wild; Kaiyu Wu (ISAAC, 2020)

QuickXsort: A Fast Sorting Scheme in Theory and Practice. - Stefan Edelkamp; Armin Weiß; Sebastian Wild (Algorithmica, 2020)

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. - Meng He 001; J. Ian Munro; Yakov Nekrich; Sebastian Wild; Kaiyu Wu (CoRR, 2020)

Succinct Euler-Tour Trees. - Travis Gagie; Sebastian Wild (CCCG, 2021)

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 (ESA, 2021)

Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. - J. Ian Munro; Patrick K. Nicholson; Louisa Seelbach Benkner; Sebastian Wild (CoRR, 2021)

Randomized Communication and the Implicit Graph Conjecture. - Nathaniel Harms; Sebastian Wild; Viktor Zamaraev (CoRR, 2021)

Towards the 5/6-Density Conjecture of Pinwheel Scheduling. - Leszek Gasieniec; Benjamin Smith; Sebastian Wild (ALENEX, 2022)

Randomized communication and implicit graph representations. - Nathaniel Harms; Sebastian Wild; Viktor Zamaraev (STOC, 2022)

Multiway Powersort. - William Cawley Gelling; Markus E. Nebel; Benjamin Smith; Sebastian Wild (ALENEX, 2023)

RNA secondary structures: from ab initio prediction to better compression, and back. - Evarista Onokpasa; Sebastian Wild; Prudence W. H. Wong (DCC, 2023)

Funnelselect: Cache-Oblivious Multiple Selection. - Gerth Stølting Brodal; Sebastian Wild (ESA, 2023)

Succinct Permutation Graphs. - Konstantinos Tsakalidis; Sebastian Wild; Viktor Zamaraev (Algorithmica, 2023)

Towards Optimal Grammars for RNA Structures. - Evarista Onokpasa; Sebastian Wild; Prudence W. H. Wong (DCC, 2024)

An Optimal Randomized Algorithm for Finding the Saddlepoint. - Justin Dallant; Frederik Haagensen; Riko Jacob; László Kozma 002; Sebastian Wild (ESA, 2024)

Polyamorous Scheduling. - Leszek Gasieniec; Benjamin Smith; Sebastian Wild (FUN, 2024)

Finding the saddlepoint faster than sorting. - Justin Dallant; Frederik Haagensen; Riko Jacob; László Kozma 002; Sebastian Wild (SOSA, 2024)

Deterministic Cache-Oblivious Funnelselect. - Gerth Stølting Brodal; Sebastian Wild (SWAT, 2024)

A simple and fast linear-time algorithm for divisor methods of apportionment. - Raphael Reitzig; Sebastian Wild (Math. Program., 2024)

Adaptive sorting for large keys, strings, and database rows. - Marius Kuhrt; Bernhard Seeger; Sebastian Wild; Goetz Graefe (BTW, 2025)

Lazy B-Trees. - Casper Moldrup Rysgaard; Sebastian Wild (MFCS, 2025)

Simple approximation algorithms for Polyamorous Scheduling. - Yuriy Biktairov; Leszek Gasieniec; Wanchote Po Jiamjitrak; Namrata; Benjamin Smith; Sebastian Wild (SOSA, 2025)

Succinct Preferential Attachment Graphs. - Ziad Ismaili Alaoui; Namrata; Sebastian Wild (CoRR, 2025)