The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Data networks
A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
Efficient fault tolerant algorithms for resource allocation in distributed systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Proportionate progress: a notion of fairness in resource allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Resource Allocation Algorithms (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Scheduling with conflicts, and applications to traffic signal control
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Local and congestion-driven fairness algorithm in arbitrary topology networks
IEEE/ACM Transactions on Networking (TON)
Approximating max-min fair rates via distributed local scheduling with partial information
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
Subchannel allocation for the OFDMA-based femtocell system
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |