32 citations · 76 across the 27 of their papers we have counts for
4 papers · 1 filter
The Secretary Problem with Independent Sampling
José Correa, Andrés Cristi, Laurent Feuilloley +2
In the secretary problem we are faced with an online sequence of elements with values. Upon seeing an element we have to make an irrevocable take-it-or-leave-it decision. The goal…
Local Certification of Graphs with Bounded Genus
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre +3
Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed interactive protocols, as i…
Compact Distributed Certification of Planar Graphs
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport +3
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a \emph{distributed interactive proof} for planarity (i.e., for certifying that a network is planar)…
Bibliography of distributed approximation beyond bounded degree
Laurent Feuilloley
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there…