Structural Information and Communication Complexity
Editat de Thomas Moscibroda, Adele A. Rescignoen Limba Engleză Paperback – 13 noi 2013
Preț: 324.63 lei
Preț vechi: 405.79 lei
-20% Nou
Puncte Express: 487
Preț estimativ în valută:
57.45€ • 66.99$ • 50.44£
57.45€ • 66.99$ • 50.44£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319035772
ISBN-10: 3319035770
Pagini: 368
Ilustrații: X, 362 p. 53 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:2013
Editura: Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319035770
Pagini: 368
Ilustrații: X, 362 p. 53 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:2013
Editura: Springer
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
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.