research
∙
01/12/2023
Distributed Self-Stabilizing MIS with Few States and Weak Communication
We study a simple random process that computes a maximal independent set...
share
research
∙
10/22/2020
Cluster-and-Conquer: When Randomness Meets Graph Locality
K-Nearest-Neighbors (KNN) graphs are central to many emblematic data min...
research
∙
06/03/2020
How to Spread a Rumor: Call Your Neighbors or Take a Walk?
We study the problem of randomized information dissemination in networks...
research
∙
04/03/2020
On the Search Efficiency of Parallel Lévy Walks on Z^2
Lévy walk is a popular movement model where an agent repeatedly samples ...
research
∙
02/11/2019