73 citations · 634 across the 97 of their papers we have counts for
5 papers · 2 filters
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons
Michael T. Goodrich
We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where…
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics
David Eppstein, Michael T. Goodrich, Darren Strash +1
We present techniques for maintaining subgraph frequencies in a dynamic graph, using data structures that are parameterized in terms of h, the h-index of the graph. Our methods ext…
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
Michael T. Goodrich, Michael Mitzenmacher
Suppose a client, Alice, has outsourced her data to an external storage provider, Bob, because he has capacity for her massive data set, of size n, whereas her private storage is m…
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks
Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson
The round-trip distance function on a geographic network (such as a road network, flight network, or utility distribution grid) defines the "distance" from a single vertex to a pai…
Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry
Michael T. Goodrich
In this paper, we describe efficient MapReduce simulations of parallel algorithms specified in the BSP and PRAM models. We also provide some applications of these simulation result…