Conference paper
Adaptive traitor tracing for large anonymous attack
Hongxia Jin, Jeffery Lotspiech, et al.
CCS 2008
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
Edith Cohen, Nimrod Megiddo
Journal of the ACM (JACM)
Daniela Pucci De Farias, Nimrod Megiddo
NeurIPS 2003
Nimrod Megiddo
Mathematical Programming