73 citations · 634 across the 97 of their papers we have counts for
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017
Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters
Michael T. Goodrich
We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t sets involved in the query, w is the number…
cs.DS2017
Defining Equitable Geographic Districts in Road Networks via Stable Matching
David Eppstein, Michael Goodrich, Doruk Korkmaz +1
We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, wh…
cs.DS2017★ 2 cited
Algorithms for Stable Matching and Clustering in a Grid
David Eppstein, Michael T. Goodrich, Nil Mamano
We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stab…