Swift Algorithms for Repeated Consensus

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms. This ...

Background. Latencies of motor evoked potentials (MEPs) can provide insights into the motor neuronal pathways activated by transcranial magnetic stimulation. Notwithstanding its clinical relevance, accurate, unbiased methods to automatize latency detection ...

The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...

The elliptic problem - div(mu del u) = f is considered, where mu > 0 is smooth but strongly varying. Anisotropic a posteriori error estimates are derived, the effectivity index being bounded above and below by two constants independent of the data f, mu, t ...

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...

We propose a variational quantum algorithm to study the real-time dynamics of quantum systems as a ground -state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the ...

We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in refined subdomains ...

This paper introduces a new method for solving the distributed AC power flow (PF) problem by further exploiting the problem formulation. We propose a new variant of the ALADIN algorithm devised specifically for this type of problem. This new variant is cha ...

Swift Algorithms for Repeated Consensus

Chattez avec Graph Search

Formula Normalizations in Verification

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

An automatized method to determine latencies of motor-evoked potentials under physiological and pathophysiological conditions

List Ordered Statistics Decoders for Polar Codes

HyperLogLog: Exponentially Bad in Adversarial Settings

Anisotropic Adaptive Finite Elements for an Elliptic Problem with Strongly Varying Diffusion Coefficient

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Efficient Preparation of Cyclic Quantum States

Practical Compilation of Quantum Programs

Variational dynamics as a ground-state problem on a quantum computer

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

Rapid Scalable Distributed Power Flow with Open-Source Implementation