We stand with Ukraine

We stand with Ukraine

Sebastian Wild

Orcid: 0000-0002-6061-9177

Affiliations:

University of Liverpool, UK
University of Waterloo, Canada (former)

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.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2024

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

[BibT_eX]

[DOI]

Raphael Reitzig

,

Math. Program., January, 2024

Polyamorous Scheduling.

[BibT_eX]

[DOI]

Leszek Gasieniec

,

,

CoRR, 2024

Deterministic Cache-Oblivious Funnelselect.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

,

CoRR, 2024

Towards Optimal Grammars for RNA Structures.

[BibT_eX]

[DOI]

Evarista Onokpasa

,

,

Prudence W. H. Wong

CoRR, 2024

An Optimal Randomized Algorithm for Finding the Saddlepoint.

[BibT_eX]

[DOI]

,

Frederik Haagensen

,

,

,

CoRR, 2024

Finding the saddlepoint faster than sorting.

[BibT_eX]

[DOI]

,

Frederik Haagensen

,

,

,

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Succinct Permutation Graphs.

[BibT_eX]

[DOI]

Konstantinos Tsakalidis

,

,

Viktor Zamaraev

Algorithmica, February, 2023

Funnelselect: Cache-Oblivious Multiple Selection.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

,

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

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

[BibT_eX]

[DOI]

Evarista Onokpasa

,

,

Prudence W. H. Wong

Proceedings of the Data Compression Conference, 2023

Multiway Powersort.

[BibT_eX]

[DOI]

William Cawley Gelling

,

Markus E. Nebel

,

,

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

Randomized communication and implicit graph representations.

[BibT_eX]

[DOI]

Nathaniel Harms

,

,

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.

[BibT_eX]

[DOI]

Leszek Gasieniec

,

,

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Randomized Communication and the Implicit Graph Conjecture.

[BibT_eX]

[DOI]

Nathaniel Harms

,

,

Viktor Zamaraev

CoRR, 2021

Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures.

[BibT_eX]

[DOI]

,

Patrick K. Nicholson

,

Louisa Seelbach Benkner

,

CoRR, 2021

Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima.

[BibT_eX]

[DOI]

,

Patrick K. Nicholson

,

Louisa Seelbach Benkner

,

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

Succinct Euler-Tour Trees.

[BibT_eX]

,

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

2020

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

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2020

QuickXsort: A Fast Sorting Scheme in Theory and Practice.

[BibT_eX]

[DOI]

Stefan Edelkamp

,

,

Algorithmica, 2020

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

[BibT_eX]

[DOI]

,

,

,

,

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

Lazy Search Trees.

[BibT_eX]

[DOI]

,

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

2019

Dynamic Optimality Refuted - For Tournament Heaps.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2019

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

[BibT_eX]

[DOI]

,

CoRR, 2019

Efficient Second-Order Shape-Constrained Function Fitting.

[BibT_eX]

[DOI]

,

,

,

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

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

[BibT_eX]

[DOI]

Markus E. Nebel

,

Elisabeth Neumann

,

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

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

[BibT_eX]

[DOI]

Conrado Martínez

,

,

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

2018

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

[BibT_eX]

[DOI]

it Inf. Technol., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks.

[BibT_eX]

[DOI]

Raphael Reitzig

,

Algorithmica, 2018

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

[BibT_eX]

[DOI]

,

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

Average Cost of QuickXsort with Pivot Sampling.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

Quicksort Is Optimal For Many Equal Keys.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

PhD thesis, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Median-of-k Jumplists.

[BibT_eX]

[DOI]

Markus E. Nebel

,

Elisabeth Neumann

,

CoRR, 2016

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

[BibT_eX]

[DOI]

,

Markus E. Nebel

,

Hosam M. Mahmoud

Algorithmica, 2016

Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme.

[BibT_eX]

[DOI]

Markus E. Nebel

,

,

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.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2016, 2016

2015

Average Case and Distributional Analysis of Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

,

Markus E. Nebel

,

Ralph Neininger

ACM Trans. Algorithms, 2015

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

[BibT_eX]

[DOI]

,

Raphael Reitzig

CoRR, 2015

Why Is Dual-Pivot Quicksort Fast?

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Raphael Reitzig

,

CoRR, 2015

Analysis of Branch Misses in Quicksort.

[BibT_eX]

[DOI]

Conrado Martínez

,

Markus E. Nebel

,

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

2014

Analysis of Pivot Sampling in Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

,

Markus E. Nebel

,

Conrado Martínez

CoRR, 2014

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

[BibT_eX]

[DOI]

Markus E. Nebel

,

CoRR, 2014

2013

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

[BibT_eX]

[DOI]

,

Markus E. Nebel

,

Ralph Neininger

CoRR, 2013

Engineering Java 7's Dual Pivot Quicksort Using MaLiJan.

[BibT_eX]

[DOI]

,

Markus E. Nebel

,

Raphael Reitzig

,

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

2012

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

[BibT_eX]

[DOI]

,

Markus E. Nebel

Proceedings of the Algorithms - ESA 2012, 2012

2011

Jaguc - a Software package for Environmental Diversity Analyses.

[BibT_eX]

[DOI]

Markus E. Nebel

,

,

Michael Holzhauser

,

Lars Huettenberger

,

Raphael Reitzig

,

Matthias Sperber

,

Thorsten Stoeck

J. Bioinform. Comput. Biol., 2011

Loading...