20 citations · 97 across the 21 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015★ 4 cited
Why Is Dual-Pivot Quicksort Fast?
Sebastian Wild
I discuss the new dual-pivot Quicksort that is nowadays used to sort arrays of primitive types in Java. I sketch theoretical analyses of this algorithm that offer a possible, and i…
cs.DS2015
A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment
Raphael Reitzig, Sebastian Wild
Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many…
cs.DS2015★ 5 cited
Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts
Raphael Reitzig, Sebastian Wild
Given a set of n sticks of various (not necessarily different) lengths, what is the largest length so that we can cut k equally long pieces of this length from the given set of sti…