5 citations · 15 across the 23 of their papers we have counts for
4 papers · 2 filters
Recognizing Hereditary Properties in the Presence of Byzantine Nodes
David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport
Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set …
Local Certification of Some Geometric Intersection Graph Classes
Benjamín Jauregui, Pedro Montealegre, Diego Ramírez-Romero +1
In the context of distributed certification, the recognition of graph classes has started to be intensively studied. For instance, different results related to the recognition of p…
Distributed Certification for Classes of Dense Graphs
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre +2
A proof-labeling scheme (PLS) for a boolean predicate on labeled graphs is a mechanism used for certifying the legality with respect to of global network states in a distri…
Energy-Efficient Distributed Algorithms for Synchronous Networks
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport +1
We study the design of energy-efficient algorithms for the LOCAL and CONGEST models. Specifically, as a measure of complexity, we consider the maximum, taken over all the edges, or…