menu
{ "item_title" : "Structural Information and Communication Complexity", "item_author" : [" Thomas Moscibroda", "Adele A. Rescigno "], "item_description" : "Distributed Community Detection in Dynamic Graphs.- Exploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring.- A Characterization of Dynamic Networks Where Consensus Is Solvable.- Self-adjusting Grid Networks to Minimize Expected Path Length.- On Advice Complexity of the k-server Problem under Sparse Metrics.- Connected Surveillance Game.- Non-Additive Two-Option Ski Rental.- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie.- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations.- Self-organizing Flows in Social Networks.- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters.- Influence Diffusion in Social Networks under Time Window Constraints.- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications.- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.- Maintaining Balanced Trees for Structured Distributed Streaming Systems.- Rendezvous of Two Robots with Constant Memory.- Pattern Formation by Mobile Robots with Limited Visibility.- Optimal Gathering of Oblivious Robots in Anonymous Graphs.- Probabilistic Connectivity Threshold for Directional Antenna Widths.- Broadcasting in Ad Hoc Multiple Access Channels.- Profit Maximization in Flex-Grid All-Optical Networks.- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies.- Optimal Buffer Management for 2-Frame Throughput Maximization.- Dynamically Maintaining Shortest Path Trees under Batches of Updates.- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems.- Steiner Problems with Limited Number of Branching Nodes.- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs.- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/903/577/3319035770_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Structural Information and Communication Complexity|Thomas Moscibroda

Structural Information and Communication Complexity : 20th International Colloquium, Sirocco 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Pape

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Distributed Community Detection in Dynamic Graphs.- Exploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring.- A Characterization of Dynamic Networks Where Consensus Is Solvable.- Self-adjusting Grid Networks to Minimize Expected Path Length.- On Advice Complexity of the k-server Problem under Sparse Metrics.- Connected Surveillance Game.- Non-Additive Two-Option Ski Rental.- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie.- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations.- Self-organizing Flows in Social Networks.- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters.- Influence Diffusion in Social Networks under Time Window Constraints.- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications.- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.- Maintaining Balanced Trees for Structured Distributed Streaming Systems.- Rendezvous of Two Robots with Constant Memory.- Pattern Formation by Mobile Robots with Limited Visibility.- Optimal Gathering of Oblivious Robots in Anonymous Graphs.- Probabilistic Connectivity Threshold for Directional Antenna Widths.- Broadcasting in Ad Hoc Multiple Access Channels.- Profit Maximization in Flex-Grid All-Optical Networks.- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies.- Optimal Buffer Management for 2-Frame Throughput Maximization.- Dynamically Maintaining Shortest Path Trees under Batches of Updates.- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems.- Steiner Problems with Limited Number of Branching Nodes.- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs.- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices.

This item is Non-Returnable

Details

  • ISBN-13: 9783319035772
  • ISBN-10: 3319035770
  • Publisher: Springer
  • Publish Date: November 2013
  • Dimensions: 9.21 x 6.14 x 0.77 inches
  • Shipping Weight: 1.14 pounds
  • Page Count: 362

Related Categories

You May Also Like...

    1

BAM Customer Reviews