Locally computable enumerations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1279, Issue , 1997, Pages 51-66

  Mazurkiewicz, Antoni ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

Algorithms; Distributed systems; Graphs; Local computations

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS;

DISTRIBUTED SYSTEMS; FINITE GRAPHS; GRAPHS; LOCAL COMPUTATION; LOCAL RULES;

GRAPH THEORY;

EID: 21744440375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036171     Document Type: Conference Paper

References (12)

1. D. Angluin, Global and local properties in networks of processors, Proc. 12th Symposium on the Theory of Computing (1980) 82-93
2. B. Coureelle and Y. Métivier, Coverings and minors: application to local computations on graphs, Europ. J. of Combinatorics 15 (1994) 127-138.
3. E.W. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (1965) 569.
4. H. Garcia-Molina, Election in a distributed computing system, IEEE Trans. Comp. 31 (1982) 48-59
5. R.E, Johnson and F.B. Schneider, Symmetry and similarity in distributed systems, Proc. 4th Conference on Principles of Distributed Computing, (1985) 13-22
6. G. Le Lann, Distributed systems - towards a formal approach, in: B. Gilchrist, ed., Information Processing 77 (IFIP) (North-Holland, Amsterdam, 1977) 155-160
7. I. Litovsky and Y. Métivier, Graph rewriting systems as a tool to design and to prove graph and network algorithms, Internal Rept. 9070, LaBRI, Université de Bordeaux I (1990)
8. I. Litovsky, Y. Métivier and W. Zielonka, The power and limitations of local computations an graphs and networks, Lecture Notes in Comp. Sci. 657 (1993) 333-345.
9. A. Mazurkiewicz, Solvability of the asynchronous ranking problem, Inform. Process. Lett. 28 (1988) 221-224.
10. A. Mazurkiewicz, Distributed Enumeration, Inform. Process. Lett, (in print).
11. Y. Métivier, A. Muscholl and P.-A. Wacrenier, About the local detection of termination of local computations in graphs, Working paper of French-German project PROCOPE, (1997).
12. M. Raynal, Distributed Algorithms and Protocols (J. Wiley & Sons, New York) (1988)