Structure, information and communication complexity : proceedings of the 1st Colloquium on Structural Information and Communication Complexity, Carleton University, Ottawa, Canada /

Bibliographic Details
Call Number:Libro Electrónico
Corporate Author: Colloquium on Structural Information and Communication Complexity Carleton University
Other Authors: Flocchini, Paola (Editor), Mans, Bernard (Editor), Santoro, N. (Nicola), 1951- (Editor)
Format: Electronic Conference Proceeding eBook
Language:Inglés
Published: Ottawa : Carleton University Press, [1995]
Series:International informatics series ; 1.
Subjects:
Electronic data processing > Distributed processing > Congresses.
Computer networks > Congresses.
Traitement réparti > Congrès.
Ordinateurs, Réseaux d' > Congrès.
Réseaux d'ordinateurs > Congrès.
COMPUTERS > Computer Literacy.
COMPUTERS > Computer Science.
COMPUTERS > Data Processing.
COMPUTERS > Hardware > General.
COMPUTERS > Information Technology.
COMPUTERS > Machine Theory.
COMPUTERS > Reference.
SCIENCE > General.
Computer networks.
Electronic data processing > Distributed processing.
Conference papers and proceedings.
Online Access:Texto completo
Table of Contents:
  • ""Cover""; ""Cover""; ""Title""; ""Title""; ""Copyright""; ""Copyright""; ""Table of Contents""; ""Table of Contents""; ""Preface ""; ""Preface ""; ""Sense of Direction: Formal Definitions and Properties ""; ""Sense of Direction: Formal Definitions and Properties ""; ""Trade-off Between Computational Power and Common Knowledge in Anonymous Rings ""
  • ""Trade-off Between Computational Power and Common Knowledge in Anonymous Rings """"Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling""; ""Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling""; ""Labeled versus Unlabeled Distributed Cayley Networks ""; ""Labeled versus Unlabeled Distributed Cayley Networks ""
  • ""Classifying Anonymous Networks: When Can Two Networks Compute the Same Vector-Valued Functions? """"Classifying Anonymous Networks: When Can Two Networks Compute the Same Vector-Valued Functions? ""; ""Compact Routing Methods: A Survey ""; ""Compact Routing Methods: A Survey ""; ""Interval Labeling Scheme for Chordal Rings ""; ""Interval Labeling Scheme for Chordal Rings ""
  • ""Fault-Tolerant Compact Routing Based on Reduced Structural Information in Wormhole-Switching Based Networks """"Fault-Tolerant Compact Routing Based on Reduced Structural Information in Wormhole-Switching Based Networks ""; ""The Buffer Potential of a Network ""
  • ""The Buffer Potential of a Network """"Path Layout in ATM Networks ""; ""Path Layout in ATM Networks ""

Similar Items