Structural information and communication complexity : 11th international colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004 : proceedings / Rastislav Královic̆, Ondrej Sýkora (eds.).
Material type:
TextPublisher number: 11012894Series: Serienbezeichnung | Lecture notes in computer science ; 3104.Publication details: Berlin ; New York : Springer, ©2004. Description: 1 online resource (x, 302 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 354027796X; 9783540277965; 6610307857; 9786610307852Subject(s): Electronic data processing -- Distributed processing -- Congresses | Computer networks -- Congresses | COMPUTERS -- Networking -- Vendor Specific | COMPUTERS -- Data Transmission Systems -- General | Computer networks | Electronic data processing -- Distributed processing | Communication complexity | SIROCCO | Structural informationGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Structural information and communication complexity.DDC classification: 004.6 LOC classification: QA76.9.D5 | C618 2004Other classification: 54.10 | SS 4800 | DAT 455f | DAT 517f | DAT 250f | MAT 050f Online resources: Click here to access online | Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
eBook
|
e-Library
Electronic Book@IST |
EBook | Available |
Includes bibliographical references and index.
This book constitutes the refereed proceedings of the 11th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2004, held in Smolenice Castle, Slowakia in June 2004. The 26 revised full papers presented were carefully reviewed and selected from 56 submissions. Among the topics addressed are WDM networks, optical networks, ad-hoc networking, computational graph theory, graph algorithms, radio networks, routing, shortest-path problems, searching, labelling, distributed algorithms, communication networks, approximation algorithms, wireless networks, scheduling, NP completeness, Byzantine environments.
Traffic Grooming in a Passive Star WDM Network -- The Price of Anarchy in All-Optical Networks -- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks -- Path Layout on Tree Networks: Bounds in Different Label Switching Models -- On Approximability of the Independent Set Problem for Low Degree Graphs -- Asynchronous Broadcast in Radio Networks -- Two-Hop Virtual Path Layout in Tori -- Robot Convergence via Center-of-Gravity Algorithms -- F-Chord: Improved Uniform Routing on Chord -- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor -- Improved Bounds for Optimal Black Hole Search with a Network Map -- Sparse Additive Spanners for Bounded Tree-Length Graphs -- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes -- Existence of Nash Equilibria in Selfish Routing Problems -- Mobile Agents Rendezvous When Tokens Fail -- Time Efficient Gossiping in Known Radio Networks -- Long-Lived Rambo: Trading Knowledge for Communication -- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach -- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks -- Perfect Token Distribution on Trees -- Approximation Algorithm for Hotlink Assignment in the Greedy Model -- Optimal Decision Strategies in Byzantine Environments -- Sharing the Cost of Multicast Transmissions in Wireless Networks -- NP-Completeness Results for All-Shortest-Path Interval Routing -- On-Line Scheduling of Parallel Jobs -- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.
English.