25 citations · 47 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
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…
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
Juan José Besa Vial, William E. Devanny, David Eppstein +1
We study various versions of the problem of scheduling platoons of autonomous vehicles through an unregulated intersection, where an algorithm must schedule which platoons should w…
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj
We study parallel comparison-based algorithms for finding all equivalence classes of a set of elements, where sorting according to some total order is not possible. Such scenar…
ERGMs are Hard
Michael J. Bannister, William E. Devanny, David Eppstein
We investigate the computational complexity of the exponential random graph model (ERGM) commonly used in social network analysis. This model represents a probability distribution…
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
Michael J. Bannister, William E. Devanny, Michael T. Goodrich +2
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queri…