Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
On the performance of on-line algorithms for partition problems
Acta Cybernetica
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Lower bounds for on-line graph coloring
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
On-line choice of on-line algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Maximizing gross network product (GNP): resource management on the GII
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Online algorithms for selective multicast and maximal dense trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth 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 complexity of monotone set systems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Delayed information and action in on-line algorithms
Information and Computation
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload
IEEE Transactions on Parallel and Distributed Systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-first annual symposium on Principles of distributed computing
On Optimal Strategies for Cycle-Stealing in Networks of Workstations
IEEE Transactions on Computers
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Combining online algorithms for rejection and acceptance
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Admission control to minimize rejections and online set cover with repetitions
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A Parallel Computational Model for Heterogeneous Clusters
IEEE Transactions on Parallel and Distributed Systems
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Admission control to minimize rejections and online set cover with repetitions
ACM Transactions on Algorithms (TALG)
Static worksharing strategies for heterogeneous computers with unrecoverable failures
Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Approximating the online set multicover problems via randomized winnowing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The covert set-cover problem with application to network discovery
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Prioritizing constraint evaluation for efficient points-to analysis
CGO '11 Proceedings of the 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization
Discrete Applied Mathematics
Competitive strategy for on-line leasing of depreciable equipment
Mathematical and Computer Modelling: An International Journal
Approximation algorithms for online weighted rank function maximization under matroid constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |