Publication

Using Three States for Binary Consensus on Complete Graphs

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Using Three States for Binary Consensus on Complete Graphs

Graph Chatbot

Chat with Graph Search

A full characterization of invariant embeddability of unimodular planar graphs

Metastability of the Potts Ferromagnet on Random Regular Graphs

Brain Fingerprinting Using Fmri Spectral Signatures On High-Resolution Cortical Graphs

Frequent asymmetric migrations suppress natural selection in spatially structured populations

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Acceleration of graph pattern mining and applications to financial crime

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation