The Combinatorics of Resource Sharing-Reference-Cited by-同舟云学术

The Combinatorics of Resource Sharing

Published:2002 Issue: Volume: Page:27-52
ISSN:1384-6485
Container-title:Applied Optimization
language:
Short-container-title:

Author:

Barbosa Valmir C.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4757-3609-0_2

Reference25 articles.

1. V. C. Barbosa. Concurrency in Systems with Neighborhood Constraints. PhD thesis, Computer Science Department, University of California, Los Angeles, CA, 1986.

2. V. C. Barbosa. An Introduction to Distributed Algorithms. The MIT Press, Cambridge, MA, 1996.

3. V. C. Barbosa and M. R. F. Benevides. A graph-theoretic characterization of AND-OR deadlocks. Technical Report COPPE-ES-472/98, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, July 1998.

4. V. C. Barbosa, M. R. F. Benevides, and F. M. G. França. Sharing resources at nonuniform access rates. Theory of Computing Systems, 34:13–26, 2001.

5. V. C. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhoodconstrained systems. ACM Trans. on Programming Languages and Systems, 11:562–584, 1989.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deadlock resolution in wait-for graphs by vertex/arc deletion;Journal of Combinatorial Optimization;2018-03-21

2. Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem;Lecture Notes in Computer Science;2018

3. And/or-convexity: a graph convexity based on processes and deadlock models;Annals of Operations Research;2017-10-03

4. Deletion Graph Problems Based on Deadlock Resolution;Anais do II Encontro de Teoria da Computação (ETC 2017);2017-07-02

5. Deletion Graph Problems Based on Deadlock Resolution;Lecture Notes in Computer Science;2017