Scheduling against an adversarial network
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of applications of a hash function on a single key.