25 citations · 47 across the 6 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018★ 1 cited
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data
Juan Jose Besa, William E. Devanny, David Eppstein +2
We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneou…
cs.DS2018
Optimally Sorting Evolving Data
Juan Jose Besa, William E. Devanny, David Eppstein +2
We give optimal sorting algorithms in the evolving data framework, where an algorithm's input data is changing while the algorithm is executing. In this framework, instead of produ…