@inproceedings{18be23821bf140558a42d24d94992f3a,

title = "Distributed disaster disclosure",

abstract = "Assume a set of distributed nodes which are equipped with a sensor device. When nodes sense an event, they want to know (the size of) the connected component consisting of nodes which have also sensed the event, in order to raise-if necessary-a disaster alarm. This paper presents distributed algorithms for this problem. Concretely, our algorithms aim at minimizing both the response time as well as the message complexity.",

author = "Bernard Mans and Stefan Schmid and Roger Wattenhofer",

year = "2008",

doi = "10.1007/978-3-540-69903-3_23",

language = "English",

isbn = "3540699007",

volume = "5124 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "246--257",

editor = "Joachim Gudmundsson",

booktitle = "Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings",

address = "United States",

note = "11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 ; Conference date: 02-07-2008 Through 04-07-2008",

}