Consider a dynamic network and a given distributed problem. At any point...
A popular way to define or characterize graph classes is via forbidden
s...
Given a network property or a data structure, a local certification is a...
Recoloring a graph is about finding a sequence of proper colorings of th...
Local certification consists in assigning labels (called certificates)
t...
It was noted already in the 90s that many classic graph classes, such as...
The graph model checking problem consists in testing whether an input gr...
One of the fundamental and most-studied algorithmic problems in distribu...
Local certification consists in assigning labels to the nodes of a netwo...
In the secretary problem we are faced with an online sequence of element...
Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for
aut...
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the exist...
This document is an informal bibliography of the papers dealing with
dis...
Local certification is an concept that has been defined and studied rece...
A distributed proof (also known as local certification, or proof-labelin...
In network distributed computing, minimum spanning tree (MST) is one of ...
In the context of self-stabilization, a silent algorithm guarantees
that...
In this paper we study lower bounds for the fundamental problem of text
...
This paper deals with graph classes characterization and recognition. A
...
In this work we study the cost of local and global proofs on distributed...
Distributed proofs are mechanisms enabling the nodes of a network to
col...