ISBN: 9783540222309 - structural information and communication complexity: 11th international colloquium , sirocco 2004, smolenice castle, slowakia, june 21-23, 2004, ... (lecture notes in computer science, 3104) (14 resultados)

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condición: New.

Paperback or Softback. Condición: New. Structural Information and Communication Complexity: 11th International Colloquium, Sirocco 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Procee. Book.

Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

PF. Condición: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 320 pp. Englisch. …

Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 Switchin.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 320 pp. Englisch.…

Taschenbuch. Condición: Neu. Structural Information and Communication Complexity | 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings | Ratislav Královic (u. a.) | Taschenbuch | x | Englisch | 2004 | Springer | EAN 9783540222309 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.…