Amortized efficiency of list update and paging rules
Communications of the ACM
Provably good routing in graphs: regular arrays
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Scheduling parallel machines on-line
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
A dynamic distributed load balancing algorithm with provable good performance
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
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
Bounding the power of preemption in randomized scheduling
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Throughput-competitive admission control for continuous media databases
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Competitive dynamic bandwidth allocation
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A cost-benefit framework for online management of a metacomputing system
Proceedings of the first international conference on Information and computation economies
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh 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
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Ancient and new algorithms for load balancing in the Lp norm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Combining fairness with throughput: online routing with multiple objectives
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximate majorization and fair online load balancing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distributed admission control, scheduling, and routing with stale information
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive on-line scheduling of continuous-media streams
Journal of Computer and System Sciences
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On-line maximizing the number of items packed in variable-sized bins
Acta Cybernetica
Prompt partial path optimization in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
Decentralized utility-based sensor network design
Mobile Networks and Applications
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Fairness and load balancing in wireless LANs using association control
IEEE/ACM Transactions on Networking (TON)
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Proceedings of the 15th annual international conference on Mobile computing and networking
Online rescheduling of multiple picking agents for warehouse management
Robotics and Computer-Integrated Manufacturing
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
On-line routing for permanent virtual circuits
Computer Communications
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
Embedding paths into trees: VM placement to minimize congestion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Access-efficient Balanced Bloom Filters
Computer Communications
Distributed Online Algorithms for the Agent Migration Problem in WSNs
Mobile Networks and Applications
| Hi-index | 0.00 |