92 citations · 105 across the 17 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 1 cited
A Framework for Algorithm Stability
Wouter Meulemans, Bettina Speckmann, Kevin Verbeek +1
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and…
cs.DS2016
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes
Bart M. P. Jansen, Jules J. H. M. Wulms
Garnero et al. [SIAM J. Discrete Math. 2015, 29(4):1864--1894] recently introduced a framework based on dynamic programming to make applications of the protrusion replacement techn…