Conference paper
Strategic classification
Moritz Hardt, Nimrod Megiddo, et al.
ITCS 2016
Paper
An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
Abstract
A randomizing algorithm for the weighted Euclidean 1-center problem is presented. The algorithm is shown to run on any problem in O(nlogn) time with high probability. © 1986.
Related
Conference paper
Adaptive traitor tracing for large anonymous attack
Hongxia Jin, Jeffery Lotspiech, et al.
CCS 2008
Ching-Tien Ho, Rakesh Agrawal, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Nimrod Megiddo, Shinji Mizuno, et al.
Mathematical Programming, Series B