Chasing the Weakest System Model for Implementing Omega and Consensus

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.

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

The rapid development of wearable biomedical systems now enables real-time monitoring of electroencephalography (EEG) signals. Acquisition of these signals relies on electrodes. These systems must meet the design challenge of selecting an optimal set of el ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

The optical domain presents potential avenues for enhancing both computing and communication due to its inherent properties of bandwidth, parallelism, and energy efficiency. This research focuses on harnessing 3-Dimensional (3D) diffractive optics for nove ...

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

State-of-the-art face recognition models are computationally expensive for mobile applications. Training lightweight face recognition models also requires large identity-labeled datasets, raising privacy and ethical concerns. Generating synthetic datasets ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

We prove an N2-o(1) lower bound on the randomized communication complexity of finding an epsilon-approximate Nash equilibrium (for constant epsilon > 0) in a two-player N x N game. ...

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

Coherent field propagation is an essential computational tool in optics with applications ranging from computational optics and optical design to iterative field reconstructions. An improvement in the computational speed of current propagation methods is t ...

By the addition of entropic regularization, multimarginal optimal transport problems can be trans-formed into tensor scaling problems, which can be solved numerically using the multimarginal Sinkhorn algorithm. The main computational bottleneck of this alg ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

The Collision problem is to decide whether a given list of numbers (x_1,…,x_n) ∈ [n]ⁿ is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n^Ω(1) randomised communication lower bound for the natural two-party version of Collision where Ali ...

We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ̅L ...

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

In the domains of machine learning, data science and signal processing, graph or network data, is becoming increasingly popular. It represents a large portion of the data in computer, transportation systems, energy networks, social, biological, and other s ...

In the last decade, deep neural networks have achieved tremendous success in many fields of machine learning. However, they are shown vulnerable against adversarial attacks: well-designed, yet imperceptible, perturbations can make the state-of-the-art deep ...

Chasing the Weakest System Model for Implementing Omega and Consensus

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

FETCH: A Fast and Efficient Technique for Channel Selection in EEG Wearable Systems

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

3D diffractive optics for linear interconnects and nonlinear processing

Graph generative deep learning models with an application to circuit topologies

Knowledge Distillation for Face Recognition Using Synthetic Data With Dynamic Latent Sampling

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

Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Scalable angular spectrum propagation

Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems\ast

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Communication Complexity of Collision

Unambiguous DNFs and Alon-Saks-Seymour

Proofs, Circuits, and Communication

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Lower Bounds for Unambiguous Automata via Communication Complexity

Symmetry in design and decoding of polar-like codes

Quantization for Distributed Processing and Learning of Structured Data

Towards Verifiable, Generalizable and Efficient Robust Deep Neural Networks