It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
In this paper, we propose a viewer for huge point-sampled models by combining out-of-core technologies with view-dependent level-of-detail (LOD) control. This viewer is designed o...
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applic...
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...