4 papers
Parallel Joinable B-Trees in the Fork-Join I/O Model
Michael Goodrich, Yan Gu, Ryuto Kitagawa +1
Balanced search trees are widely used in computer science to efficiently maintain dynamic ordered data. To support efficient set operations (e.g., union, intersection, difference)…
Zip-Tries: Simple Dynamic Data Structures for Strings
David Eppstein, Ofek Gila, Michael T. Goodrich +1
In this paper, we introduce zip-tries, which are simple, dynamic, memory-efficient data structures for strings. Zip-tries support search and update operations for -length string…
Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
Michael T. Goodrich, Ryuto Kitagawa, Vinesh Sridhar
Ateniese, Goodrich, Lekakis, Papamanthou, Paraskevas, and Tamassia introduced the Accountable Storage protocol, which is a way for a client to outsource their data to a cloud stora…
Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
Michael T. Goodrich, Ryuto Kitagawa
In this paper, we present Ray-shooting Quickhull, which is a simple, randomized, outputsensitive version of the Quickhull algorithm for constructing the convex hull of a set of n p…