4 citations · 8 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Revisiting the Sparse Matrix Compression Problem
Vincent Jugé, Dominik Köppl, Vincent Limouzy +4
The sparse matrix compression problem asks for a one-dimensional representation of a binary matrix, formed by an integer array of row indices and a shift function f…
cs.DS2018
Adaptive Shivers Sort: An Alternative Sorting Algorithm
Vincent Jugé
We present one stable mergesort algorithm, called \Adaptive Shivers Sort, that exploits the existence of monotonic runs for sorting efficiently partially sorted data. We also prove…
cs.DS2018★ 1 cited
On the Worst-Case Complexity of TimSort
Nicolas Auger, Vincent Jugé, Cyril Nicaud +1
TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. In fact, there are two…