1 option
Structural Information and Communication Complexity : 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings / edited by Ratislav Královic, Ondrej Sykora.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 3104.
- Lecture Notes in Computer Science, 0302-9743 ; 3104
- Language:
- English
- Subjects (All):
- Computer networks.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Data structures (Computer science).
- Computer Communication Networks.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Local Subjects:
- Computer Communication Networks.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Algorithms.
- Physical Description:
- 1 online resource (X, 303 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-27796-5
- 9783540277965
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.