All Stories

  1. Randomized Communication and Implicit Graph Representations

    Article • TheoretiCS, October 2025, Centre pour la Communication Scientifique Directe (CCSD)

    Sebastian Wild

  2. Towards Optimal Grammars for RNA Structures

    Article • March 2024, Institute of Electrical & Electronics Engineers (IEEE)

    Sebastian Wild

  3. Finding the saddlepoint faster than sorting

    Article • January 2024, Society for Industrial & Applied Mathematics (SIAM)

    Sebastian Wild

  4. A House Divided: Cooperation, Polarization, and the Power of Reputation

    Article • July 2023, Springer Science + Business Media

    Sebastian Wild

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

    Article • March 2023, Institute of Electrical & Electronics Engineers (IEEE)

    Sebastian Wild

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

    Article • Mathematical Programming, February 2023, Springer Science + Business Media

    Sebastian Wild

  7. Succinct Permutation Graphs

    Article • Algorithmica, September 2022, Springer Science + Business Media

    Sebastian Wild

  8. Randomized communication and implicit graph representations

    Article • June 2022, ACM (Association for Computing Machinery)

    Sebastian Wild

  9. Lazy Search Trees

    Article • November 2020, Institute of Electrical & Electronics Engineers (IEEE)

    Sebastian Wild

  10. QuickXsort: A Fast Sorting Scheme in Theory and Practice

    Article • Algorithmica, October 2019, Springer Science + Business Media

    Sebastian Wild

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

    Article • January 2019, Society for Industrial & Applied Mathematics (SIAM)

    Sebastian Wild

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

    Article • January 2019, Society for Industrial & Applied Mathematics (SIAM)

    Sebastian Wild

  13. Efficient Second-Order Shape-Constrained Function Fitting

    Article • January 2019, Springer Science + Business Media

    Sebastian Wild

  14. Why is Quicksort with two or more pivots faster than standard Quicksort?

    Article • it - Information Technology, June 2018, De Gruyter

    Sebastian Wild

  15. Entwurf und Analyse von Algorithmen

    Article • January 2018, Springer Science + Business Media

    Sebastian Wild

  16. Quicksort Is Optimal For Many Equal Keys

    Article • January 2018, Society for Industrial & Applied Mathematics (SIAM)

    Sebastian Wild

  17. How can you cut as large pieces of the same length from a given set of sticks?

    Article • Algorithmica, November 2017, Springer Science + Business Media

    Sebastian Wild

  18. The most comprehensive analysis of Java's dual-pivot quicksort

    Article • Algorithmica, August 2015, Springer Science + Business Media

    Sebastian Wild

  19. Average Case and Distributional Analysis of Dual-Pivot Quicksort

    Article • ACM Transactions on Algorithms, January 2015, ACM (Association for Computing Machinery)

    Sebastian Wild

  20. Analysis of Branch Misses in Quicksort

    Article • December 2014, Society for Industrial & Applied Mathematics (SIAM)

    Sebastian Wild

  21. Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm

    Article • Algorithmica, November 2014, Springer Science + Business Media

    Sebastian Wild

  22. JAGUC — A SOFTWARE PACKAGE FOR ENVIRONMENTAL DIVERSITY ANALYSES

    Article • Journal of Bioinformatics and Computational Biology, December 2011, World Scientific Pub Co Pte Lt

    Sebastian Wild