Naively Sorting Evolving Data is Optimal and Robust
We study comparison sorting in the evolving data model, introduced by Anagnostopoulos,
Kumar, Mah-dian and Upfal (2011), where the true total order changes while the sorting …
Kumar, Mah-dian and Upfal (2011), where the true total order changes while the sorting …
Optimally sorting evolving data
JJ Besa, WE Devanny, D Eppstein… - arXiv preprint arXiv …, 2018 - arxiv.org
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 …
input data is changing while the algorithm is executing. In this framework, instead of …
Evolving Distributions Under Local Motion
A Acharya, DM Mount - arXiv preprint arXiv:2409.11779, 2024 - arxiv.org
Geometric data sets arising in modern applications are often very large and change
dynamically over time. A popular framework for dealing with such data sets is the evolving …
dynamically over time. A popular framework for dealing with such data sets is the evolving …
Quadratic time algorithms appear to be optimal for sorting evolving data
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 simultaneously …
maintains an approximation to the sorted order of a list of data items while simultaneously …
Optimization Problems in Directed Graph Visualization
JJ Besa Vial - 2019 - escholarship.org
Drawing digraphs presents unique challenges that do not occur when drawing undirected
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …
Quadratic time algorithms appear to be optimal for sorting evolving data
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 simultaneously …
maintains an approximation to the sorted order of a list of data items while simultaneously …
An Assortment of Sorts: Three Modern Variations on the Classic Sorting Problem
WE Devanny - 2017 - escholarship.org
Sorting is one of the most well studied algorithmic problems in Computer Science. It is a
fundamental building block in many other algorithms. In this dissertation, we consider …
fundamental building block in many other algorithms. In this dissertation, we consider …
[图书][B] Optimization Problems in Directed Graph Visualization
JJB Vial - 2019 - search.proquest.com
Drawing digraphs presents unique challenges that do not occur when drawing undirected
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …