Sebastian Wild

According to our database, Sebastian Wild authored at least 48 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A simple and fast linear-time algorithm for divisor methods of apportionment.

Raphael Reitzig, Sebastian Wild

Math. Program., January, 2024

Deterministic Cache-Oblivious Funnelselect.

Gerth Stølting Brodal, Sebastian Wild

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Finding the saddlepoint faster than sorting.

Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Polyamorous Scheduling.

Leszek Gasieniec, Benjamin Smith, Sebastian Wild

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

An Optimal Randomized Algorithm for Finding the Saddlepoint.

Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Towards Optimal Grammars for RNA Structures.

Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong

Proceedings of the Data Compression Conference, 2024

2023

Succinct Permutation Graphs.

Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev

Algorithmica, February, 2023

Funnelselect: Cache-Oblivious Multiple Selection.

Gerth Stølting Brodal, Sebastian Wild

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

RNA secondary structures: from ab initio prediction to better compression, and back.

Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong

Proceedings of the Data Compression Conference, 2023

Multiway Powersort.

William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

Randomized communication and implicit graph representations.

Nathaniel Harms, Sebastian Wild, Viktor Zamaraev

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Towards the 5/6-Density Conjecture of Pinwheel Scheduling.

Leszek Gasieniec, Benjamin Smith, Sebastian Wild

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Randomized Communication and the Implicit Graph Conjecture.

Nathaniel Harms, Sebastian Wild, Viktor Zamaraev

CoRR, 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

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

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Succinct Euler-Tour Trees.

Travis Gagie, Sebastian Wild

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs.

Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu

CoRR, 2020

QuickXsort: A Fast Sorting Scheme in Theory and Practice.

Stefan Edelkamp, Armin Weiß, Sebastian Wild

Algorithmica, 2020

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.

Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Lazy Search Trees.

Bryce Sandlund, Sebastian Wild

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Dynamic Optimality Refuted - For Tournament Heaps.

J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang

CoRR, 2019

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space.

J. Ian Munro, Sebastian Wild

CoRR, 2019

Efficient Second-Order Shape-Constrained Function Fitting.

David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Median-of-k Jumplists and Dangling-Min BSTs.

Markus E. Nebel, Elisabeth Neumann, Sebastian Wild

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

Sesquickselect: One and a half pivots for cache-efficient selection.

Conrado Martínez, Markus Nebel, Sebastian Wild

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

Dual-pivot and beyond: The potential of multiway partitioning in quicksort.

Sebastian Wild

it Inf. Technol., 2018

Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort.

Sebastian Wild

CoRR, 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

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.

J. Ian Munro, Sebastian Wild

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Average Cost of QuickXsort with Pivot Sampling.

Sebastian Wild

Proceedings of the 29th International Conference on Probabilistic, 2018

Quicksort Is Optimal For Many Equal Keys.

Sebastian Wild

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2016

Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential

Sebastian Wild

PhD thesis, 2016

Sorting Discrete i.i.d. Inputs: Quicksort is Optimal.

Sebastian Wild

CoRR, 2016

Median-of-k Jumplists.

Markus E. Nebel, Elisabeth Neumann, Sebastian Wild

CoRR, 2016

Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm.

Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud

Algorithmica, 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

Quicksort mit zwei Pivots und mehr: Eine mathematische Analyse von Mehrwege-Partitionierungsverfahren und der Frage, wie Quicksort dadurch schneller wird.

Sebastian Wild

Proceedings of the Ausgezeichnete Informatikdissertationen 2016, 2016

2015

Average Case and Distributional Analysis of Dual-Pivot Quicksort.

Sebastian Wild, Markus E. Nebel, Ralph Neininger

ACM Trans. Algorithms, 2015

A Simple and Fast Linear-Time Algorithm for Proportional Apportionment.

Sebastian Wild, Raphael Reitzig

CoRR, 2015

Why Is Dual-Pivot Quicksort Fast?

Sebastian Wild

CoRR, 2015

Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts.

Raphael Reitzig, Sebastian Wild

CoRR, 2015

Analysis of Branch Misses in Quicksort.

Conrado Martínez, Markus E. Nebel, Sebastian Wild

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

Analysis of Pivot Sampling in Dual-Pivot Quicksort.

Sebastian Wild, Markus E. Nebel, Conrado Martínez

CoRR, 2014

Pivot Sampling in Java 7's Dual-Pivot Quicksort.

Markus E. Nebel, Sebastian Wild

CoRR, 2014

2013

Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort

Sebastian Wild, Markus E. Nebel, Ralph Neininger

CoRR, 2013

Engineering Java 7's Dual Pivot Quicksort Using MaLiJan.

Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube

Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012

Average Case Analysis of Java 7's Dual Pivot Quicksort.

Sebastian Wild, Markus E. Nebel

Proceedings of the Algorithms - ESA 2012, 2012

2011

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