Sebastian Wild

79 papers A* 2A 9B 6C 2Misc 2Journal 47Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Partition-based Simple Heaps. CoRR Gerth Stølting Brodal, John Iacono, Casper Moldrup Rysgaard, Sebastian Wild
2026	J	`jnl`	Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs. CoRR Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata, Sebastian Wild
2026	—	`conf`	Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space. SOSA Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild
2025	A	`ed.`	33rd Annual European Symposium on Algorithms, ESA 2025, Warsaw, Poland, September 15-17, 2025 ESA Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman
2025	Misc	`conf`	Adaptive sorting for large keys, strings, and database rows. BTW Marius Kuhrt, Bernhard Seeger, Sebastian Wild, Goetz Graefe
2025	B	`conf`	Lazy B-Trees. MFCS Casper Moldrup Rysgaard, Sebastian Wild
2025	J	`jnl`	Lazy B-Trees. CoRR Casper Moldrup Rysgaard, Sebastian Wild
2025	J	`jnl`	Randomized Communication and Implicit Graph Representations. TheoretiCS Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
2025	—	`conf`	Simple approximation algorithms for Polyamorous Scheduling. SOSA Yuriy Biktairov, Leszek Gasieniec, Wanchote Po Jiamjitrak, Namrata, Benjamin Smith, Sebastian Wild
2025	J	`jnl`	Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space. CoRR Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild
2025	J	`jnl`	Succinct Preferential Attachment Graphs. CoRR Ziad Ismaili Alaoui, Namrata, Sebastian Wild
2025	B	`conf`	Succinct Preferential-Attachment Graphs. WG Ziad Ismaili Alaoui, Namrata, Sebastian Wild
2024	C	`ed.`	35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, University of Bath, UK, June 17-21, 2024 AofA Cécile Mailler, Sebastian Wild
2024	J	`jnl`	A simple and fast linear-time algorithm for divisor methods of apportionment. Math. Program. Raphael Reitzig, Sebastian Wild
2024	A	`conf`	An Optimal Randomized Algorithm for Finding the Saddlepoint. ESA Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024	J	`jnl`	An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024	—	`conf`	Deterministic Cache-Oblivious Funnelselect. SWAT Gerth Stølting Brodal, Sebastian Wild
2024	J	`jnl`	Deterministic Cache-Oblivious Funnelselect. CoRR Gerth Stølting Brodal, Sebastian Wild
2024	—	`conf`	Finding the saddlepoint faster than sorting. SOSA Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024	Misc	`conf`	Polyamorous Scheduling. FUN Leszek Gasieniec, Benjamin Smith, Sebastian Wild
2024	J	`jnl`	Polyamorous Scheduling. CoRR Leszek Gasieniec, Benjamin Smith, Sebastian Wild
2024	J	`jnl`	Simple approximation algorithms for Polyamorous Scheduling. CoRR Yuriy Biktairov, Leszek Gasieniec, Wanchote Po Jiamjitrak, Namrata, Benjamin Smith, Sebastian Wild
2024	B	`conf`	Towards Optimal Grammars for RNA Structures. DCC Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
2024	J	`jnl`	Towards Optimal Grammars for RNA Structures. CoRR Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
2023	J	`jnl`	Finding the saddlepoint faster than sorting. CoRR Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2023	A	`conf`	Funnelselect: Cache-Oblivious Multiple Selection. ESA Gerth Stølting Brodal, Sebastian Wild
2023	A	`conf`	Multiway Powersort. ALENEX William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild
2023	B	`conf`	RNA secondary structures: from ab initio prediction to better compression, and back. DCC Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
2023	J	`jnl`	RNA secondary structures: from ab initio prediction to better compression, and back. CoRR Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
2023	J	`jnl`	Succinct Permutation Graphs. Algorithmica Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
2022	J	`jnl`	Multiway Powersort. CoRR William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild
2022	A*	`conf`	Randomized communication and implicit graph representations. STOC Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
2022	A	`conf`	Towards the 5/6-Density Conjecture of Pinwheel Scheduling. ALENEX Leszek Gasieniec, Benjamin Smith, Sebastian Wild
2021	A	`conf`	Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
2021	J	`jnl`	Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. CoRR J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
2021	J	`jnl`	Randomized Communication and the Implicit Graph Conjecture. CoRR Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
2021	—	`conf`	Succinct Euler-Tour Trees. CCCG Travis Gagie, Sebastian Wild
2021	J	`jnl`	Towards the 5/6-Density Conjecture of Pinwheel Scheduling. CoRR Leszek Gasieniec, Benjamin Smith, Sebastian Wild
2020	J	`jnl`	Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	B	`conf`	Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	A*	`conf`	Lazy Search Trees. FOCS Bryce Sandlund, Sebastian Wild
2020	J	`jnl`	Lazy Search Trees. CoRR Bryce Sandlund, Sebastian Wild
2020	J	`jnl`	QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica Stefan Edelkamp, Armin Weiß, Sebastian Wild
2020	J	`jnl`	Succinct Permutation Graphs. CoRR Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
2019	J	`jnl`	Dynamic Optimality Refuted - For Tournament Heaps. CoRR J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
2019	B	`conf`	Efficient Second-Order Shape-Constrained Function Fitting. WADS David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild
2019	J	`jnl`	Efficient Second-Order Shape-Constrained Function Fitting. CoRR David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild
2019	J	`jnl`	Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR J. Ian Munro, Sebastian Wild
2019	—	`conf`	Median-of-k Jumplists and Dangling-Min BSTs. ANALCO Markus E. Nebel, Elisabeth Neumann, Sebastian Wild
2019	—	`conf`	Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO Conrado Martínez, Markus Nebel, Sebastian Wild
2018	C	`conf`	Average Cost of QuickXsort with Pivot Sampling. AofA Sebastian Wild
2018	J	`jnl`	Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks. Algorithmica Raphael Reitzig, Sebastian Wild
2018	J	`jnl`	Dual-pivot and beyond: The potential of multiway partitioning in quicksort. it Inf. Technol. Sebastian Wild
2018	A	`conf`	Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA J. Ian Munro, Sebastian Wild
2018	J	`jnl`	Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR J. Ian Munro, Sebastian Wild
2018	J	`jnl`	Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort. CoRR Sebastian Wild
2018	J	`jnl`	QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR Stefan Edelkamp, Armin Weiß, Sebastian Wild
2018	—	`conf`	Quicksort Is Optimal For Many Equal Keys. ANALCO Sebastian Wild
2018	J	`jnl`	Sesquickselect: One and a half pivots for cache-efficient selection. CoRR Conrado Martínez, Markus Nebel, Sebastian Wild
2016	J	`jnl`	Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica Markus E. Nebel, Sebastian Wild, Conrado Martínez
2016	J	`jnl`	Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
2016	—	`—`	Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential Sebastian Wild
2016	J	`jnl`	Median-of-k Jumplists. CoRR Markus E. Nebel, Elisabeth Neumann, Sebastian Wild
2016	—	`ch.`	Quicksort mit zwei Pivots und mehr: Eine mathematische Analyse von Mehrwege-Partitionierungsverfahren und der Frage, wie Quicksort dadurch schneller wird. Ausgezeichnete Informatikdissertationen Sebastian Wild
2016	J	`jnl`	Sorting Discrete i.i.d. Inputs: Quicksort is Optimal. CoRR Sebastian Wild
2015	J	`jnl`	A Simple and Fast Linear-Time Algorithm for Proportional Apportionment. CoRR Sebastian Wild, Raphael Reitzig
2015	—	`conf`	Analysis of Branch Misses in Quicksort. ANALCO Conrado Martínez, Markus E. Nebel, Sebastian Wild
2015	J	`jnl`	Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms Sebastian Wild, Markus E. Nebel, Ralph Neininger
2015	J	`jnl`	Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts. CoRR Raphael Reitzig, Sebastian Wild
2015	J	`jnl`	Why Is Dual-Pivot Quicksort Fast? CoRR Sebastian Wild
2014	J	`jnl`	Analysis of Branch Misses in Quicksort. CoRR Conrado Martínez, Markus E. Nebel, Sebastian Wild
2014	J	`jnl`	Analysis of Pivot Sampling in Dual-Pivot Quicksort. CoRR Sebastian Wild, Markus E. Nebel, Conrado Martínez
2014	J	`jnl`	Pivot Sampling in Java 7's Dual-Pivot Quicksort. CoRR Markus E. Nebel, Sebastian Wild
2013	J	`jnl`	Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
2013	J	`jnl`	Average Case Analysis of Java 7's Dual Pivot Quicksort. CoRR Sebastian Wild, Markus E. Nebel
2013	J	`jnl`	Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort CoRR Sebastian Wild, Markus E. Nebel, Ralph Neininger
2013	A	`conf`	Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. ALENEX Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube
2012	A	`conf`	Average Case Analysis of Java 7's Dual Pivot Quicksort. ESA Sebastian Wild, Markus E. Nebel
2011	J	`jnl`	Jaguc - a Software package for Environmental Diversity Analyses. J. Bioinform. Comput. Biol. Markus E. Nebel, Sebastian Wild, Michael Holzhauser, Lars Huettenberger, Raphael Reitzig, Matthias Sperber, Thorsten Stoeck