Parallel continuous randomized load balancing (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Recovery time of dynamic allocation processes
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Simple competitive request scheduling strategies
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Randomized and adversarial load balancing
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Infinite parallel job allocation (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Balls and Bins with Deletions
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Analyzing an Infinite Parallel Job Allocation Process
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Cuckoo hashing: further analysis
Information Processing Letters
Optimizing result prefetching in web search engines with segmented indices
ACM Transactions on Internet Technology (TOIT)
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimizing result prefetching in web search engines with segmented indices
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Effects of internet path selection on video-QoE
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
Hi-index | 0.00 |
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual are capacities. Our approach leads to an O(min(n/sup 2/3/, m/sup 1/2/)m log(n/sup 2//m) log U) ...