Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth 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
Wireless Networks
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Dynamic session management for static and mobile users: a competitive on-line algorithmic approach
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
Theoretical Computer Science
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
Virtual Path Design in Service-Specific ATM Networks
Journal of Heuristics
IEEE Transactions on Parallel and Distributed Systems
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Reducing truth-telling online mechanisms to online optimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Home Model and Competitive Algorithms for Load Balancing in a Computing Cluster
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
High-bandwidth routing in dynamic peer-to-peer streaming
Proceedings of the ACM workshop on Advances in peer-to-peer multimedia streaming
CA-NFS: a congestion-aware network file system
FAST '09 Proccedings of the 7th conference on File and storage technologies
CA-NFS: A congestion-aware network file system
ACM Transactions on Storage (TOS)
An efficient signaling structure for ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
Balls-into-bins with nearly optimal load distribution
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.01 |