Bilateral ranking negotiations

Fundamenta Informaticae

Volumn 60, Issue 1-4, 2004, Pages 1-16

  Mazurkiewicz, Antoni ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; GRAPH THEORY; KNOWLEDGE ACQUISITION; MATHEMATICAL TRANSFORMATIONS; NETWORK PROTOCOLS; PROBLEM SOLVING;

BILATERAL RANKING; NEGOTIATION PROTOCOLS; REFLEXIVE RELATIONS;

CONTRACTS;

EID: 2942702098     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (13)

1. ANGLUIN,D.: Local and global properties in networks of processors, in: Proc. of 12th Symp. on Theory of Computing (1980) 82-93
2. COURCELLE,B., MÉTIVIER, Y.: Coverings and Minors: application to local computations in graphs, in: Europ. Journal of Combinatorics 15 (1994) 127-138
3. DIJKSTRA,E. W.: Solution of a problem in concurrent programming control, Comm. of ACM 8 (1965) 569
4. FISHER,M.J., LYNCH,N.A., MERRITT,A.: Easy impossibility proofs for distributed consensus problems, in: Distributed Computing 1 (1986) 26-29
5. GODARD,E.:(Ph.D. dissertation) A characterization of families of graphs in which election is possible, in: Proc. of Foundations of Software Sci. and Comp. Structures, LNCS 2303 (2002) 159-171
6. GODARD,E., MÉTIVIER, Y., MUSCHOLL, A.: The power of local computations in graphs with initial knowledge, in: Proc. of Theory and Applications of Graph Transformations'98 1764 LNCS (2000) 71-84
7. LE LANN,G.: Distributed systems - towards a formal approach, in: Information Processing 77 (IFIP), Gilchrist B., (editor), North-Holland (Amsterdam), (1977) 155-160.
8. LITOVSKY,I., MÉTIVIER, Y., SOPENA,E.: Graph relabelling systems and distributed algorithms, in: H.Ehrig, H.-J.Kreowski, U.Montanari, and G.Rozenberg (eds) Handbook of graph grammars and computing by graph transformation 3, World Scientific (1999) 1-56
9. LITOVSKY,I., MÉTIVIER, Y., ZIELONKA, W.: On the recognition of families of graphs with local computations, in: Information & Computation 118 (1995) 110-119
10. MAZURKIEWICZ, A.: Solvability of the asynchronous ranking problem, in: Inf. Processing Letters 28 (1988) 221-224.
11. MAZURKIEWICZ,A.: Distributed enumeration, in: Inf. Processing Letters 61 (1997) 233-239
12. MAZURKIEWICZ,A.: Locally Computable enumerations, in: Proc. of XI Intern. Symposium FCT'97, Lecture Notes in Computer Science 1279 (1997) 51-66
13. MAZURKIEWICZ,A.: Distributed Ordering in Trees, to appear (2002)