Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...
Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Dona...