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.
Material type: TextSeries: Lecture Notes in Computer Science ; 3104Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004Description: X, 303 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540277965Subject(s): 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 | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK3257 |
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.
There are no comments on this title.