The multiplicative version of azuma's inequality, with an application to contention analysis

W Kuszmaul, Q Qi - ar** a deterministic time-optimal leader election
F Dufoulon, J Burman, J Beauquier - … International Symposium on …, 2018 - drops.dagstuhl.de
The bee** model is an extremely restrictive broadcast communication model that relies
only on carrier sensing. In this model, we solve the leader election problem with an …

A journey through dynamic networks (with excursions)

A Casteigts - 2018 - hal.science
Résumé The journey recounted in this document spanned a period of about 10 years, from
the end of the PhD (2007) to current (early 2018). The rst ve years correspond to two …

Generalising the maximum independent set algorithm via Boolean networks

M Gadouleau, DC Kutner - ar** protocols for deterministic MIS and (Δ+ 1)-coloring in sparse graphs
J Beauquier, J Burman, F Dufoulon… - IEEE INFOCOM 2018 …, 2018 - ieeexplore.ieee.org
The bee** model is an extremely restrictive broadcast communication model that relies
only on carrier sensing. We consider two problems in this model:(Δ+ 1)-vertex coloring and …

Counting in one-hop bee** networks

A Casteigts, Y Métivier, JM Robson… - Theoretical Computer …, 2019 - Elsevier
We consider networks of processes which interact with beeps. In the basic model defined by
Cornejo and Kuhn [8], which we refer to as the BL variant, processes can choose in each …

Noisy bee** networks

Y Ashkenazi, R Gelles, A Leshem - Information and Computation, 2022 - Elsevier
Bee** networks consist of exceedingly simple computational devices whose
communication is based on beeps and silence. In this work, we introduce noisy bee** …

Bee** shortest paths via hypergraph bipartite decomposition

F Dufoulon, Y Emek, R Gelles - ar** networks
Y Ashkenazi, R Gelles, A Leshem - … of the 39th Symposium on Principles …, 2020 - dl.acm.org
We introduce noisy bee** networks, where nodes have limited communication
capabilities, namely, they can only emit energy or sense the channel for energy …