4 papers
Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard
Zeyuan Hu, C. Gregory Plaxton
In recent work on course allocation, RodrÃguez and Manlove consider the complexity of finding a stable assignment under four notions of stability, including two coalitional notion…
Computer-Orchestrated Design of Algorithms: From Join Specification to Implementation
Zeyuan Hu
Equipping query processing systems with provable theoretical guarantees has been a central focus at the intersection of database theory and systems in recent years. However, the di…
Constant-Approximate and Constant-Strategyproof Two-Facility Location
Elijah Journey Fullerton, Zeyuan Hu, C. Gregory Plaxton
We study deterministic mechanisms for the two-facility location problem. Given the reported locations of n agents on the real line, such a mechanism specifies where to build the tw…
TreeTracker Join: Simple, Optimal, Fast
Zeyuan Hu, Yisu Remy Wang, Daniel P. Miranker
We present a novel linear-time acyclic join algorithm, TreeTracker Join (TTJ). The algorithm can be understood as the pipelined binary hash join with a simple twist: upon a hash lo…