Structure, Information and Communication Complexity: Proceedings of the 1st Colloquium on Structural Information and Communication Complexity, Carleton University, Ottawa, CanadaMcGill-Queen's Press - MQUP, 1995 - 166 lappuses 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. |
No grāmatas satura
1.–5. rezultāts no 17.
10. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
21. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
22. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
31. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
32. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Preface | 7 |
P Ferragina A Monti A Roncato Pisa | 35 |
Lavault ParisNord | 49 |
E Kranakis D Krizanc Carleton | 68 |
N Norris S Cruz | 83 |
J van Leeuwen R Tan Utrecht | 99 |
J Vounckx J Deconinck R Lauwereins J A Peperstraete Leuven | 125 |
K Diks Hull E Kranakis Carleton A Malinowsky A Pelc Hull | 149 |
Bieži izmantoti vārdi un frāzes
1-Single Scheme abelian groups anonymous networks anonymous ring assume Aut(NG automorphism Boolean functions Bruijn and Kautz canonical set Carleton University Cayley graph Cayley networks chordal rings chords coding function communication complexity compact routing Computer Science consider coset coset representative covering map cyclic permutations decoding function defined Definition denote Distributed Algorithms Distributed Computing dynamic cost links e₁ edge symmetry exists a 1-Single failure rectangle fault-tolerant Figure function f given graph G group G Hence hypercubes idempotent injured area input configuration interval tables invariant under cyclic isomorphism k₁ Kautz networks Kranakis Krizanc layout leader election Leeuwen Lemma mesh message complexity minimal symmetries n-Hypercube network topologies node O(N log orientation path representation Proof protocol routing algorithm routing tables Santoro Sense of Direction shortest path stretch factor structural information switches synchronous Theorem tree u₁ vertex vertices