Document Open Access Logo

A Rupestrian Algorithm

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

Thumbnail PDF


  • Filesize: 0.93 MB
  • 20 pages

Document Identifiers

Author Details

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

Cite AsGet 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)


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.
  • mobile finite-state machines
  • self-healing distributed algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
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