
On Extending Brandt's Speedup Theorem from LOCAL to RoundBased FullInformation Models
Given any task Π, Brandt's speedup theorem (PODC 2019) provides a mechan...
read it

The Topology of Randomized SymmetryBreaking Distributed Computing
Studying distributed computing through the lens of algebraic topology ha...
read it

PresentBiased Optimization
This paper explores the behavior of presentbiased agents, that is, agen...
read it

Local Certification of Graphs with Bounded Genus
Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for aut...
read it

Compact Distributed Certification of Planar Graphs
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the exist...
read it

The Topology of Local Computing in Networks
Modeling distributed computing in a way enabling the use of formal metho...
read it

Distributed Quantum Proofs for Replicated Data
The paper tackles the issue of checking that all copies of a large data ...
read it

Simple and Fast Distributed Computation of Betweenness Centrality
Betweenness centrality is a graph parameter that has been successfully a...
read it

Tradeoffs in Distributed Interactive Proofs
The study of interactive proofs in the context of distributed network co...
read it

A Topological Perspective on Distributed Network Algorithms
More than two decades ago, combinatorial topology was shown to be useful...
read it

Distributed Computing in the Asynchronous LOCAL model
The LOCAL model is among the main models for studying locality in the fr...
read it

Redundancy in Distributed Proofs
Distributed proofs are mechanisms enabling the nodes of a network to col...
read it
Pierre Fraigniaud
is this you? claim profile