research
∙
01/31/2023
Topological Characterization of Task Solvability in General Models of Computation
The famous asynchronous computability theorem (ACT) relates the existenc...
share
research
∙
04/22/2021
A Composable Glitch-Aware Delay Model
We introduce the Composable Involution Delay Model (CIDM) for fast and a...
research
∙
04/15/2021
Towards a Fast and Accurate Model of Intercontact Times for Epidemic Routing
We present an accurate user-encounter trace generator based on analytica...
research
∙
03/12/2021
Reaching Agreement in Competitive Microbial Systems
In this work, we consider distributed agreement tasks in microbial distr...
research
∙
06/15/2020
A Faithful Binary Circuit Model with Adversarial Noise
Accurate delay models are important for static and dynamic timing analys...
research
∙
03/22/2020
Distributed Computation with Continual Population Growth
Computing with synthetically modified bacteria is a vibrant and active f...
research
∙
08/07/2019
Byzantine Approximate Agreement on Graphs
Consider a distributed system with n processors out of which f can be By...
research
∙
07/13/2019
Efficient self-stabilizing leader election in population protocols
We consider the standard population protocol model, where (a priori) ind...
research
∙
05/23/2019
Topological Characterization of Consensus under General Message Adversaries
In this paper, we provide a rigorous characterization of consensus solva...
research
∙
01/21/2019
On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks
A nonsplit graph is a directed graph where each pair of nodes has a comm...
research
∙
05/13/2018