default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Wild
Person information
- affiliation: University of Liverpool, UK
- affiliation (former): University of Waterloo, Canada
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Raphael Reitzig, Sebastian Wild
:
A simple and fast linear-time algorithm for divisor methods of apportionment. Math. Program. 203(1): 187-205 (2024)- [c23]Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong:
Towards Optimal Grammars for RNA Structures. DCC 2024: 332-341 - [c22]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. ESA 2024: 44:1-44:12 - [c21]Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Polyamorous Scheduling. FUN 2024: 15:1-15:18 - [c20]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. SOSA 2024: 168-178 - [c19]Gerth Stølting Brodal, Sebastian Wild:
Deterministic Cache-Oblivious Funnelselect. SWAT 2024: 17:1-17:12 - [e1]Cécile Mailler, Sebastian Wild:
35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2024, June 17-21, 2024, University of Bath, UK. LIPIcs 302, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-329-4 [contents] - [i31]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR abs/2401.06512 (2024) - [i30]Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong:
Towards Optimal Grammars for RNA Structures. CoRR abs/2401.16623 (2024) - [i29]Gerth Stølting Brodal, Sebastian Wild:
Deterministic Cache-Oblivious Funnelselect. CoRR abs/2402.17631 (2024) - [i28]Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Polyamorous Scheduling. CoRR abs/2403.00465 (2024) - 2023
- [j8]Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev:
Succinct Permutation Graphs. Algorithmica 85(2): 509-543 (2023) - [c18]William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild:
Multiway Powersort. ALENEX 2023: 190-200 - [c17]Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong:
RNA secondary structures: from ab initio prediction to better compression, and back. DCC 2023: 278-287 - [c16]Gerth Stølting Brodal, Sebastian Wild:
Funnelselect: Cache-Oblivious Multiple Selection. ESA 2023: 25:1-25:17 - [i27]Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong:
RNA secondary structures: from ab initio prediction to better compression, and back. CoRR abs/2302.11669 (2023) - [i26]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. CoRR abs/2310.16801 (2023) - 2022
- [c15]Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. ALENEX 2022: 91-103 - [c14]Nathaniel Harms, Sebastian Wild, Viktor Zamaraev:
Randomized communication and implicit graph representations. STOC 2022: 1220-1233 - [i25]William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild:
Multiway Powersort. CoRR abs/2209.06909 (2022) - 2021
- [c13]Travis Gagie, Sebastian Wild:
Succinct Euler-Tour Trees. CCCG 2021: 368-376 - [c12]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: 70:1-70:18 - [i24]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 abs/2104.13457 (2021) - [i23]Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. CoRR abs/2111.01784 (2021) - [i22]Nathaniel Harms, Sebastian Wild, Viktor Zamaraev:
Randomized Communication and the Implicit Graph Conjecture. CoRR abs/2111.03639 (2021) - 2020
- [j7]Stefan Edelkamp, Armin Weiß, Sebastian Wild:
QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica 82(3): 509-588 (2020) - [c11]Bryce Sandlund, Sebastian Wild:
Lazy Search Trees. FOCS 2020: 704-715 - [c10]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: 25:1-25:18 - [i21]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 abs/2005.07644 (2020) - [i20]Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev:
Succinct Permutation Graphs. CoRR abs/2010.04108 (2020) - [i19]Bryce Sandlund, Sebastian Wild:
Lazy Search Trees. CoRR abs/2010.08840 (2020)
2010 – 2019
- 2019
- [c9]Conrado Martínez, Markus Nebel, Sebastian Wild:
Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO 2019: 54-66 - [c8]Markus E. Nebel, Elisabeth Neumann, Sebastian Wild:
Median-of-k Jumplists and Dangling-Min BSTs. ANALCO 2019: 74-86 - [c7]David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild:
Efficient Second-Order Shape-Constrained Function Fitting. WADS 2019: 395-408 - [i18]J. Ian Munro, Sebastian Wild:
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR abs/1903.02533 (2019) - [i17]David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild:
Efficient Second-Order Shape-Constrained Function Fitting. CoRR abs/1905.02149 (2019) - [i16]J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang:
Dynamic Optimality Refuted - For Tournament Heaps. CoRR abs/1908.00563 (2019) - 2018
- [j6]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): 3365-3396 (2018) - [j5]Sebastian Wild:
Dual-pivot and beyond: The potential of multiway partitioning in quicksort. it Inf. Technol. 60(3): 173-177 (2018) - [c6]Sebastian Wild:
Quicksort Is Optimal For Many Equal Keys. ANALCO 2018: 8-22 - [c5]Sebastian Wild:
Average Cost of QuickXsort with Pivot Sampling. AofA 2018: 36:1-36:19 - [c4]J. Ian Munro, Sebastian Wild:
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA 2018: 63:1-63:16 - [i15]Sebastian Wild:
Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort. CoRR abs/1803.05948 (2018) - [i14]J. Ian Munro, Sebastian Wild:
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR abs/1805.04154 (2018) - [i13]Conrado Martínez, Markus Nebel, Sebastian Wild:
Sesquickselect: One and a half pivots for cache-efficient selection. CoRR abs/1810.12322 (2018) - [i12]Stefan Edelkamp, Armin Weiß, Sebastian Wild:
QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR abs/1811.01259 (2018) - 2016
- [b1]Sebastian Wild:
Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential. Kaiserslautern University, Germany, 2016 - [j4]Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica 74(1): 485-506 (2016) - [j3]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): 632-683 (2016) - [p1]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: 319-328 - [i11]Sebastian Wild:
Sorting Discrete i.i.d. Inputs: Quicksort is Optimal. CoRR abs/1608.04906 (2016) - [i10]Markus E. Nebel, Elisabeth Neumann, Sebastian Wild:
Median-of-k Jumplists. CoRR abs/1609.08513 (2016) - 2015
- [j2]Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms 11(3): 22:1-22:42 (2015) - [c3]Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. ANALCO 2015: 114-128 - [i9]Raphael Reitzig, Sebastian Wild:
Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts. CoRR abs/1502.04048 (2015) - [i8]Sebastian Wild, Raphael Reitzig:
A Simple and Fast Linear-Time Algorithm for Proportional Apportionment. CoRR abs/1504.06475 (2015) - [i7]Sebastian Wild:
Why Is Dual-Pivot Quicksort Fast? CoRR abs/1511.01138 (2015) - 2014
- [i6]Markus E. Nebel, Sebastian Wild:
Pivot Sampling in Java 7's Dual-Pivot Quicksort. CoRR abs/1403.6602 (2014) - [i5]Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. CoRR abs/1411.2059 (2014) - [i4]Sebastian Wild, Markus E. Nebel, Conrado Martínez:
Analysis of Pivot Sampling in Dual-Pivot Quicksort. CoRR abs/1412.0193 (2014) - 2013
- [c2]Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube:
Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. ALENEX 2013: 55-69 - [i3]Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort. CoRR abs/1304.0988 (2013) - [i2]Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR abs/1306.3819 (2013) - [i1]Sebastian Wild, Markus E. Nebel:
Average Case Analysis of Java 7's Dual Pivot Quicksort. CoRR abs/1310.7409 (2013) - 2012
- [c1]Sebastian Wild, Markus E. Nebel:
Average Case Analysis of Java 7's Dual Pivot Quicksort. ESA 2012: 825-836 - 2011
- [j1]Markus E. Nebel, Sebastian Wild, Michael Holzhauser, Lars Huettenberger, Raphael Reitzig, Matthias Sperber, Thorsten Stoeck:
Jaguc - a Software package for Environmental Diversity Analyses. J. Bioinform. Comput. Biol. 9(6): 749-773 (2011)
Coauthor Index
aka: Markus Nebel
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
