A Rupestrian Algorithm

Di Luna, Giuseppe A.; Flocchini, Paola; Prencipe, Giuseppe; Santoro, Nicola; Viglietta, Giovanni

doi:10.4230/LIPIcs.FUN.2016.14

Document

A Rupestrian Algorithm

Authors Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta

Part of: Volume: 8th International Conference on Fun with Algorithms (FUN 2016)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Fun with Algorithms (FUN)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2016-06-02

PDF

File

PDF

LIPIcs.FUN.2016.14.pdf

Filesize: 0.93 MB
20 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FUN.2016.14
URN: urn:nbn:de:0030-drops-58751

Subject Classification

Keywords

mobile finite-state machines
self-healing distributed algorithms

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

Deciphering recently discovered cave paintings by the Astracinca, an egalitarian leaderless society flourishing in the 3rd millennium BCE, we present and analyze their shamanic ritual for forming new colonies. This ritual can actually be used by systems of anonymous mobile finite-state computational entities located and operating in a grid to solve the line recovery problem, a task that has both self-assembly and flocking requirements. The protocol is totally decentralized, fully concurrent, provably correct, and time optimal.

Cite As Get BibTex

Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Giovanni Viglietta. A Rupestrian Algorithm. In 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 49, pp. 14:1-14:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/LIPIcs.FUN.2016.14

Author Details

Giuseppe A. Di Luna

Paola Flocchini

Giuseppe Prencipe

Nicola Santoro

Giovanni Viglietta

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail