Amortized efficiency of list update and paging rules
Communications of the ACM
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second 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
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line Resource Management with Applications to Routing and Scheduling
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On-Line Routing in All-Optical Networks
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On-line Competive Algorithms for Call Admission in Optical Networks
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Efficient on-line communication in cellular networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive Analysis of On-line Randomized Call Control in Cellular Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Admission Control to Minimize Rejections
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Online Call Admission in Optical Networks with Larger Demands
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
Journal of Scheduling - Special issue: On-line algorithm part I
Journal of Experimental Algorithmics (JEA)
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Deterministic online optical call admission revisited
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |