Browse by People

Martínez, Conrado, Nebel, Markus E and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2014) Analysis of Branch Misses in Quicksort. In: 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO).

Nebel, Markus E, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Martinez, Conrado (2016) Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica: an international journal in computer science, 75 (4). pp. 632-683.

Wild, Sebastian ORCID: 0000-0002-6061-9177, Nebel, Markus E and Mahmoud, Hosam (2016) Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm. Algorithmica: an international journal in computer science, 74 (1). pp. 485-506.

Wild, Sebastian ORCID: 0000-0002-6061-9177 and Nebel, Markus E (2012) Average Case Analysis of Java 7's Dual Pivot Quicksort. .

Wild, Sebastian ORCID: 0000-0002-6061-9177, Nebel, Markus E and Neininger, Ralph (2015) Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Transactions on Algorithms, 11 (3). 3-.

Wild, Sebastian ORCID: 0000-0002-6061-9177 (2018) Average Cost of QuickXsort with Pivot Sampling. .

Reitzig, Raphael and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2018) Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks. Algorithmica: an international journal in computer science, 80 (11). pp. 3365-3396.

Wild, Sebastian ORCID: 0000-0002-6061-9177 (2018) Dual-pivot and beyond: The potential of multiway partitioning in quicksort. IT-INFORMATION TECHNOLOGY, 60 (3). pp. 173-177.

Durfee, David, Gao, Yu, Rao, Anup B and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2019) Efficient Second-Order Shape-Constrained Function Fitting. .

Wild, Sebastian ORCID: 0000-0002-6061-9177, Nebel, Markus, Reitzig, Raphael and Laube, Ulrich (2013) Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn. .

Munro, J Ian and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2019) Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. [Report]

Dallant, Justin, Haagensen, Frederik, Jacob, Riko, Kozma, László and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2023) Finding the saddlepoint faster than sorting. [Preprint]

Munro, J Ian, Nicholson, Patrick K, Benkner, Louisa Seelbach and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2021) Hypersuccinct Trees -- New universal tree source codes for optimal compressed tree data structures and range minima. In: 29th Annual European Symposium on Algorithms (ESA 2021).

Nebel, Markus E, Wild, Sebastian ORCID: 0000-0002-6061-9177, Holzhauser, Michael, Huettenberger, Lars, Reitzig, Raphael, Sperber, Matthias and Stoeck, Thorsten (2011) JAGUC - A SOFTWARE PACKAGE FOR ENVIRONMENTAL DIVERSITY ANALYSES. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 9 (6). pp. 749-773.

Sandlund, Bryce and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2021) Lazy Search Trees. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, 2020-11-16 - 2020-11-19, Virtual Conference.

Nebel, Markus E, Neumann, Elisabeth and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2016) Median-of-k Jumplists and Dangling-Min BSTs. .

Gelling, William Cawley, Nebel, Markus E, Smith, Benjamin and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2022) Multiway Powersort. [Preprint]

Munro, J Ian and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2018) Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. .

Nebel, Markus E and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2014) Pivot Sampling in Dual-Pivot Quicksort. .

Reitzig, Raphael and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2015) A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment. [Report]

Edelkamp, Stefan, Weiss, Armin and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2020) QuickXsort: A Fast Sorting Scheme in Theory and Practice. ALGORITHMICA, 82 (3). pp. 509-588.

Wild, Sebastian ORCID: 0000-0002-6061-9177 (2016) Quicksort Is Optimal For Many Equal Keys. .

Onokpasa, Evarista, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Wong, Prudence WH ORCID: 0000-0001-7935-7245 (2023) RNA secondary structures: from ab initio prediction to better compression, and back. [Preprint]

Onokpasa, Evarista, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Wong, Prudence WH ORCID: 0000-0001-7935-7245 (2023) RNA secondary structures: from ab initio prediction to better compression, and back. In: 2023 Data Compression Conference (DCC), 2023-3-21 - 2023-3-24.

Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2022) Randomized Communication and Implicit Graph Representations. In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.

Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2021) Randomized Communication and Implicit Graph Representations. .

Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor (2021) Randomized Communication and the Implicit Graph Conjecture. CoRR, abs/21.

Martínez, Conrado, Nebel, Markus and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2018) Sesquickselect: One and a half pivots for cache-efficient selection. .

Gagie, Travis and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2021) Succinct Euler-Tour Trees. In: 33rd Canadian Conference on Computational Geometry (CCCG 2021).

Tsakalidis, Konstantinos ORCID: 0000-0001-6470-9332, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2020) Succinct Permutation Graphs. [Report]

Tsakalidis, Konstantinos ORCID: 0000-0001-6470-9332, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141 (2023) Succinct Permutation Graphs. Algorithmica, 85 (2). pp. 509-543.

Gąsieniec, Leszek ORCID: 0000-0003-1809-9814, Smith, Benjamin and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2021) Towards the 5/6-Density Conjecture of Pinwheel Scheduling. In: ALENEX 2022, 2022-1-9 - 2022-1-10, Alexandria, VG, USA.

Gasieniec, Leszek, Smith, Benjamin and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2022) Towards the 5/6-Density Conjecture of Pinwheel Scheduling. .

Gasieniec, Leszek, Smith, Benjamin and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2021) Towards the 5/6-Density Conjecture of Pinwheel Scheduling. [Preprint]

Wild, Sebastian ORCID: 0000-0002-6061-9177 (2015) Why Is Dual-Pivot Quicksort Fast? .

Reitzig, Raphael and Wild, Sebastian ORCID: 0000-0002-6061-9177 (2023) A simple and fast linear-time algorithm for divisor methods of apportionment. Mathematical Programming.