05528nam a22005895i 4500
978-3-540-27796-5
DE-He213
20141014114344.0
cr nn 008mamaa
121227s2004 gw | s |||| 0|eng d
9783540277965
978-3-540-27796-5
10.1007/b98251
doi
eng
QA76.9.A43
UMB
bicssc
COM051300
bisacsh
005.1
23
Královic̆, Ratislav.
editor.
Structural Information and Communication Complexity
[electronic resource] :
11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings /
edited by Ratislav Královic̆, Ondrej Sýkora.
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2004.
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2004.
X, 303 p.
online resource.
text
txt
rdacontent
computer
c
rdamedia
online resource
cr
rdacarrier
text file
PDF
rda
Lecture Notes in Computer Science,
0302-9743 ;
3104
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.
The Colloquium on Structural Information and Communication Complexity (SIROCCO) is an annual meeting focused on the relationship between comp- ing and communication. Over its 11 years of existence, SIROCCO has gained a considerable respect and has become an acknowledged forum bringing together specialists interested in the fundamental principles underlying all computing through communication. SIROCCO 2004 was the 11th in this series, held in Smolenice Castle, June 21–23,2004.PreviousSIROCCOcolloquiatookplaceinOttawa(1994),Olympia (1995), Siena (1996), Ascona (1997), Amal? (1998), Lacanau-Océan (1999), L’Aquila (2000), Val de Nuria (2001), Andros (2002), and Umeå(2003). The colloquium in 2004 was special in the respect that, for the ?rst time, the p- ceedings were published in the Lecture Notes in Computer Science series of Springer–Verlag. SIROCCO has alwaysencouragedhigh-quality researchfocused on the study of those factors which are signi?cant for the computability and the communi- tion complexity of problems,and onthe interplay betweenstructure, knowledge, and complexity. It covers topics as distributed computing, mobile computing, optical computing, parallel computing, communication complexity, information dissemination, routing protocols,distributed data-structures, models of com- nication, network topologies, high-speed interconnection networks, wireless n- works, sense of direction, structural properties, and topological awareness. The 56 contributions submitted to this year’s SIROCCO were subject to a thorough refereeing process and 26 high quality submissions were selected for publication. WethanktheProgramCommitteemembersfortheirprofoundandcarefulwork. Our gratitude extends to the numerous subreferees for their valuable refereeing. We also acknowledgethe e?ort of all authors who submitted their contributions.
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Computational complexity.
Algorithms.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Data Structures.
Computer Communication Networks.
Algorithms.
Sýkora, Ondrej.
editor.
SpringerLink (Online service)
Springer eBooks
Printed edition:
9783540222309
Lecture Notes in Computer Science,
0302-9743 ;
3104
http://dx.doi.org/10.1007/b98251
ZDB-2-SCS
ZDB-2-LNC
EB
5663
5663