Distributed Disaster Disclosure

DOI10.1007/978-3-540-69903-3_23zbMATH Open1155.68566OpenAlexW2150170876MaRDI QIDQ3512463FDOQ3512463

Authors: Bernard Mans, Stefan Schmid, Roger Wattenhofer 

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_23

Recommendations

• Event Extent Estimation
• Distributed algorithms for sensor networks
• Efficient threshold detection in a distributed environment (extended abstract)
• Efficient decentralized algorithms for the distributed trigger counting problem
• Topology broadcast algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Introduction to algorithms
• Distributed Computing: A Locality-Sensitive Approach
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Distributed MST for constant diameter graphs
• Title not available (Why is that?)
• Veracity radius, capturing the locality of distributed computations
• A faster distributed protocol for constructing a minimum spanning tree
• Fast network decomposition

Cited In (1)

• Efficient decentralized algorithms for the distributed trigger counting problem

This page was built for publication: Distributed Disaster Disclosure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512463)