73 citations · 634 across the 97 of their papers we have counts for
5 papers · 2 filters
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…
Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes
Michael T. Goodrich, Paweł Pszona
The problem of finding an electric vehicle route that optimizes both driving time and energy consumption can be modeled as a bicriterion path problem. Unfortunately, the problem of…
Data-Oblivious Graph Algorithms in Outsourced External Memory
Michael T. Goodrich, Joseph A. Simons
Motivated by privacy preservation for outsourced data, data-oblivious external memory is a computational framework where a client performs computations on data stored at a semi-tru…
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
David Eppstein, Michael T. Goodrich, Michael Mitzenmacher +1
We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of after the insertion of items into a table…
Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time
Michael T. Goodrich
We describe and analyze Zig-zag Sort--a deterministic data-oblivious sorting algorithm running in O(n log n) time that is arguably simpler than previously known algorithms with sim…