Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Can a maximum flow be computed in o(nm) time?
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Generating pseudo-random permutations and maximum flow algorithms
Information Processing Letters
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A faster deterministic maximum flow algorithm
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Bounding the power of preemption in randomized scheduling
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Allocating weighted jobs in parallel
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Algorithms for graphic polymatroids and parametric s-Sets
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Analyzing an Infinite Parallel Job Allocation Process
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 0.00 |