Sebastian Wild

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 49

Top Topics

Randomized Algorithm

Graph Representations

Top Venues

Publications

Raphael Reitzig, Sebastian Wild
A simple and fast linear-time algorithm for divisor methods of apportionment. Math. Program. 203 (1) (2024)
Gerth Stølting Brodal, Sebastian Wild
Deterministic Cache-Oblivious Funnelselect. SWAT (2024)
Gerth Stølting Brodal, Sebastian Wild
Deterministic Cache-Oblivious Funnelselect. CoRR (2024)
Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
Towards Optimal Grammars for RNA Structures. CoRR (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. SOSA (2024)
Leszek Gasieniec, Benjamin Smith, Sebastian Wild
Polyamorous Scheduling. CoRR (2024)
Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
Towards Optimal Grammars for RNA Structures. DCC (2024)
Leszek Gasieniec, Benjamin Smith, Sebastian Wild
Polyamorous Scheduling. FUN (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. CoRR (2023)
Gerth Stølting Brodal, Sebastian Wild
Funnelselect: Cache-Oblivious Multiple Selection. ESA (2023)
Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
Succinct Permutation Graphs. Algorithmica 85 (2) (2023)
Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
RNA secondary structures: from ab initio prediction to better compression, and back. DCC (2023)
William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild
Multiway Powersort. ALENEX (2023)
Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
RNA secondary structures: from ab initio prediction to better compression, and back. CoRR (2023)
Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
Randomized communication and implicit graph representations. STOC (2022)
Leszek Gasieniec, Benjamin Smith, Sebastian Wild
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. ALENEX (2022)
William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild
Multiway Powersort. CoRR (2022)
Leszek Gasieniec, Benjamin Smith, Sebastian Wild
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. CoRR (2021)
Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
Randomized Communication and the Implicit Graph Conjecture. CoRR (2021)
J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. CoRR (2021)
Travis Gagie, Sebastian Wild
Succinct Euler-Tour Trees. CCCG (2021)
J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA (2021)
Bryce Sandlund, Sebastian Wild
Lazy Search Trees. FOCS (2020)
Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
Succinct Permutation Graphs. CoRR (2020)
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica 82 (3) (2020)
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC (2020)
Bryce Sandlund, Sebastian Wild
Lazy Search Trees. CoRR (2020)
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR (2020)
David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild
Efficient Second-Order Shape-Constrained Function Fitting. CoRR (2019)
Conrado Martínez, Markus Nebel, Sebastian Wild
Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO (2019)
Markus E. Nebel, Elisabeth Neumann, Sebastian Wild
Median-of-k Jumplists and Dangling-Min BSTs. ANALCO (2019)
David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild
Efficient Second-Order Shape-Constrained Function Fitting. WADS (2019)
J. Ian Munro, Sebastian Wild
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR (2019)
J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
Dynamic Optimality Refuted - For Tournament Heaps. CoRR (2019)
Sebastian Wild
Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort. CoRR (2018)
Sebastian Wild
Dual-pivot and beyond: The potential of multiway partitioning in quicksort. it Inf. Technol. 60 (3) (2018)
Conrado Martínez, Markus Nebel, Sebastian Wild
Sesquickselect: One and a half pivots for cache-efficient selection. CoRR (2018)
Sebastian Wild
Average Cost of QuickXsort with Pivot Sampling. AofA (2018)
J. Ian Munro, Sebastian Wild
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR (2018)
J. Ian Munro, Sebastian Wild
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA (2018)
Sebastian Wild
Quicksort Is Optimal For Many Equal Keys. ANALCO (2018)
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR (2018)
Raphael Reitzig, Sebastian Wild
Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks. Algorithmica 80 (11) (2018)
Sebastian Wild
Quicksort mit zwei Pivots und mehr: Eine mathematische Analyse von Mehrwege-Partitionierungsverfahren und der Frage, wie Quicksort dadurch schneller wird. Ausgezeichnete Informatikdissertationen (2016)
Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica 74 (1) (2016)
Markus E. Nebel, Sebastian Wild, Conrado Martínez
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica 75 (4) (2016)
Sebastian Wild
Sorting Discrete i.i.d. Inputs: Quicksort is Optimal. CoRR (2016)
Markus E. Nebel, Elisabeth Neumann, Sebastian Wild
Median-of-k Jumplists. CoRR (2016)
Sebastian Wild, Raphael Reitzig
A Simple and Fast Linear-Time Algorithm for Proportional Apportionment. CoRR (2015)
Conrado Martínez, Markus E. Nebel, Sebastian Wild
Analysis of Branch Misses in Quicksort. ANALCO (2015)
Raphael Reitzig, Sebastian Wild
Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts. CoRR (2015)
Sebastian Wild
Why Is Dual-Pivot Quicksort Fast? CoRR (2015)
Sebastian Wild, Markus E. Nebel, Ralph Neininger
Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms 11 (3) (2015)
Conrado Martínez, Markus E. Nebel, Sebastian Wild
Analysis of Branch Misses in Quicksort. CoRR (2014)
Sebastian Wild, Markus E. Nebel, Conrado Martínez
Analysis of Pivot Sampling in Dual-Pivot Quicksort. CoRR (2014)
Markus E. Nebel, Sebastian Wild
Pivot Sampling in Java 7's Dual-Pivot Quicksort. CoRR (2014)
Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR (2013)
Sebastian Wild, Markus E. Nebel
Average Case Analysis of Java 7's Dual Pivot Quicksort. CoRR (2013)
Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube
Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. ALENEX (2013)
Sebastian Wild, Markus E. Nebel, Ralph Neininger
Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort CoRR (2013)
Sebastian Wild, Markus E. Nebel
Average Case Analysis of Java 7's Dual Pivot Quicksort. ESA (2012)
Markus E. Nebel, Sebastian Wild, Michael Holzhauser, Lars Hüttenberger, Raphael Reitzig, Matthias Sperber, Thorsten Stoeck
Jaguc - a Software package for Environmental Diversity Analyses. J. Bioinform. Comput. Biol. 9 (6) (2011)