Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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)
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
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
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
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
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Routing and Admission Control in General Topology Networks
Routing and Admission Control in General Topology Networks
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Combining fairness with throughput: online routing with multiple objectives
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Admission Control to Minimize Rejections
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint resource conserving and load distributing approaches for routing of survivable connections
Computer Communications
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
Bridging the tenant-provider gap in cloud services
Proceedings of the Third ACM Symposium on Cloud Computing
| Hi-index | 0.00 |