
The Secretary Problem with Independent Sampling
In the secretary problem we are faced with an online sequence of element...
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

Bibliography of distributed approximation on structurally sparse graph classes
This document is an informal bibliography of the papers dealing with dis...
read it

Introduction to local certification
Local certification is an concept that has been defined and studied rece...
read it

Note on distributed certification of minimum spanning trees
A distributed proof (also known as local certification, or prooflabelin...
read it

Silent MST approximation for tiny memory
In network distributed computing, minimum spanning tree (MST) is one of ...
read it

Memory Lower Bounds for SelfStabilization
In the context of selfstabilization, a silent algorithm guarantees that...
read it

Lower bounds for text indexing with mismatches and differences
In this paper we study lower bounds for the fundamental problem of text ...
read it

Graph classes and forbidden patterns on three vertices
This paper deals with graph classes characterization and recognition. A ...
read it

Local verification of global proofs
In this work we study the cost of local and global proofs on distributed...
read it

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