Stone Age Distributed Computing

6 February 2012

Roger Wattenhofer

Papers citing "Stone Age Distributed Computing"

38 / 38 papers shown

Title
Fast and Robust Information Spreading in the Noisy PULL Model Niccolo DÁrchivio Amos Korman Emanuele Natale Robin Vacus 31 0 0 04 Nov 2024
GraphFSA: A Finite State Automaton Framework for Algorithmic Learning on Graphs Florian Grötschla Joël Mathys Christoffer Raun Roger Wattenhofer 29 1 0 20 Aug 2024
On the Power of Graphical Reconfigurable Circuits Y. Emek Yuval Gil Noga Harlev 25 1 0 20 Aug 2024
Self-Stabilizing MIS Computation in the Beeping Model George Giakkoupis Volker Turau Isabella Ziccardi 29 0 0 07 May 2024
The Hardness of Local Certification of Finite-State Dynamics Diego Maldonado Pedro Montealegre Martín Ríos-Wilson 13 0 0 19 Dec 2023
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison Stéphane Devismes D. Ilcinkas C. Johnen Frédéric Mazoit 19 0 0 31 Jul 2023
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments Stéphane Devismes D. Ilcinkas C. Johnen Frédéric Mazoit 18 4 0 13 Jul 2023
A Distributed Palette Sparsification Theorem Maxime Flin M. Ghaffari Magnús M. Halldórsson Fabian Kuhn Alexandre Nolin MoE 24 7 0 16 Jan 2023
Distributed Self-Stabilizing MIS with Few States and Weak Communication George Giakkoupis Isabella Ziccardi 11 5 0 12 Jan 2023
DT+GNN: A Fully Explainable Graph Neural Network using Decision Trees Peter Müller Lukas Faber Karolis Martinkus Roger Wattenhofer 43 8 0 26 May 2022
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems Joshua J. Daymude Andréa W. Richa Christian Scheideler 14 3 0 17 Nov 2021
Public Communication can Facilitate Low-Risk Coordination under Surveillance Amos Korman P. Crescenzi 14 0 0 05 May 2021
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks Y. Emek Eyal Keren 17 15 0 25 Feb 2021
A Classification of Weak Asynchronous Models of Distributed Computing Javier Esparza Fabian Reiter 6 2 0 07 Jul 2020
Distributed Voting in Beep Model Benyamin Ghojogh Saber Salehkaleybar 13 4 0 22 Oct 2019
On Bioelectric Algorithms: A Novel Application of Theoretical Computer Science to Core Problems in Developmental Biology Seth Gilbert J. Maguire Calvin C. Newport 11 1 0 26 Sep 2018
Selecting a Leader in a Network of Finite State Machines Y. Afek Y. Emek Noa Kolikant 11 4 0 15 May 2018
Some Problems in Compact Message Passing Armando Castañeda Jonas Lefevre Computer Science 15 0 0 08 Mar 2018
Limits for Rumor Spreading in stochastic populations Lucas Boczkowski O. Feinerman Amos Korman Emanuele Natale 8 12 0 20 Dec 2017
Dynamic Networks of Finite State Machines Y. Emek Jara Uitto 14 12 0 12 Jun 2017
Distributed Dominating Set Approximations beyond Planar Graphs S. A. Amiri Stefan Schmid S. Siebertz 14 27 0 25 May 2017
Constant Space and Non-Constant Time in Distributed Computing Tuomo Lempiäinen Jukka Suomela 13 0 0 10 May 2017
The ANTS problem O. Feinerman Amos Korman 30 28 0 10 Jan 2017
Naming a Channel with Beeps Bogdan S. Chlebus G. D. Marco Muhammed Talo 20 21 0 15 Aug 2016
Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis Arnaud Casteigts Yves Métivier J. Robson A. Zemmari 29 5 0 11 Jul 2016
Counting in One-Hop Beeping Networks Arnaud Casteigts Yves Métivier J. Robson A. Zemmari 21 12 0 31 May 2016
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits Lucas Boczkowski Amos Korman Emanuele Natale 12 30 0 14 Feb 2016
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs S. A. Amiri Stefan Schmid S. Siebertz 14 0 0 09 Feb 2016
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring P. Jeavons A. Scott Lei Xu 13 18 0 17 Jan 2016
The Computational Power of Beeps Seth Gilbert Calvin C. Newport 23 32 0 16 Aug 2015
On Distributed Computing with Beeps Yves Métivier J. Robson A. Zemmari 24 10 0 09 Jul 2015
Ability to Count Is Worth $Θ(Δ)$ Rounds Tuomo Lempiainen 27 1 0 09 May 2015
Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States Dan Alistarh Rati Gelashvili 18 0 0 19 Feb 2015
Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication Christoph Lenzen Nancy A. Lynch Calvin C. Newport Tsvetomira Radeva 38 36 0 07 May 2014
Breathe before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication O. Feinerman Bernhard Haeupler Amos Korman 45 48 0 14 Nov 2013
Ants: Mobile Finite State Machines Y. Emek T. Langner Jara Uitto Roger Wattenhofer 30 6 0 13 Nov 2013
Beeping a Maximal Independent Set Y. Afek N. Alon Z. Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn 71 114 0 01 Jun 2012
Weak Models of Distributed Computing, with Connections to Modal Logic L. Hella Matti Järvisalo Antti Kuusisto Juhana Laurinharju Tuomo Lempiäinen Kerkko Luosto Jukka Suomela Jonni Virtema 76 66 0 09 May 2012