The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Improved algorithms for distributed resource allocation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
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
Guaranteeing fair service to persistent dependent tasks
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed Resource Allocation Algorithms (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Probabilistic analysis for scheduling with conflicts
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Online Scheduling of Parallel Communications with Individual Deadlines
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Multiagent Traffic Management: A Reservation-Based Intersection Control Mechanism
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
On equitable Δ-coloring of graphs with low average degree
Theoretical Computer Science - Graph colorings
Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Probabilistic analysis for scheduling with conflicts
Theoretical Computer Science
Improved upper bounds on the competitive ratio for online realtime scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Equitable colorings of Kronecker products of graphs
Discrete Applied Mathematics
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Computers and Operations Research
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science
Equitable colorings of Cartesian products of graphs
Discrete Applied Mathematics
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Improved bitwidth-aware variable packing
ACM Transactions on Architecture and Code Optimization (TACO)
Production scheduling of assembly fixtures in the aeronautical industry
Computers and Industrial Engineering
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
Discrete Applied Mathematics
| Hi-index | 0.00 |