Structure, Information and Communication Complexity: Proceedings of the 1st Colloquium on Structural Information and Communication Complexity, Carleton University, Ottawa, Canada
McGill-Queen's Press - MQUP, 1995 - Science - 166 pages
The ultimate goal of research in Distributed Computing is to understand the nature, properties and limits of computing in a system of autonomous communicating agents. To this end, it is crucial to identify those factors which are significant for the computability and the communication complexity of problems. A crucial role is played by those factors which can be termed Structural Information: its identification, characterization, analysis, and its impact on communication complexity is an important theoretical task which has immediate practical importance. The purpose of the Colloquia on Structural Information and Communication Complexity (SIROCCO) is to focus explicitly on the interaction between structural information and communication complexity. The Colloquia comprise position papers, presentations of current research, and group discussions. Series 1 contains papers presented at the 1st Colloquium on Structural Information and Communication Complexity, held in Ottawa, Canada. Series 2 contains papers presented at the 2nd Colloquium held in Olympia, Greece.
What people are saying - Write a review
We haven't found any reviews in the usual places.
P Ferragina A Monti A Roncato Pisa
E Kranakis D Krizanc Carleton
N Norris S Cruz
J van Leeuwen R Tan Utrecht
J Vounckx J Deconinck R Lauwereins J A Peperstraete Leuven
K Diks Hull E Kranakis Carleton A Malinowsky A Pelc Hull
abelian groups anonymous networks anonymous ring assume automorphism Boolean functions Bruijn and Kautz canonical set Carleton University Cayley graph chordal rings coding function communication complexity compact routing complete networks Computer Science consider construction coset coset representative covering map cyclic permutations decoding function defined Definition denote diameter Distributed Algorithms Distributed Computing dynamic cost links edge symmetry edge-label example failure rectangle fault-tolerant Figure functions computable given graph G group Q Hamiltonian cycle Hence hypercubes idempotent injured area input configuration interval routing schemes interval tables invariant under cyclic isomorphism Kautz networks Kranakis Krizanc layout leader election Leeuwen Lemma mesh message complexity minimal symmetries n-Hypercube network topologies node optimum orientation outgoing link pair path representation Proof protocol routing algorithm routing tables Santoro Sense of Direction sequence shortest path stretch factor structural information switches synchronous Theorem tree vertex vertices