Publications associées (301)

Simulating supercontinua from mixed and cascaded nonlinearities

Luis Guillermo Villanueva Torrijo, Victor Brasch, Furkan Ayhan, Tobias Herr, Thibault Voumard

Nonlinear optical frequency conversion is of fundamental importance in photonics and underpins countless of its applications: Sum- and difference-frequency generation in media with quadratic nonlinearity permits reaching otherwise inaccessible wavelength r ...
AIP Publishing2023

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

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Manuel José Ribeiro Vidigueira, Vincent Gramoli, Seth Gilbert

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 ...
2023

Synthetic Generation of Activity-related data

Quentin Philippe Bochud

The field of synthetic data is more and more present in our everyday life. The transportation domain is particularly interested in improving the methods for the generation of synthetic data in order to address the privacy and availability issue of real dat ...
2023

A finiteness result for p-adic families of Bianchi modular forms

Vlad Serban

We study p-adic families of cohomological automorphic forms for GL(2) over imaginary quadratic fields and prove that families interpolating a Zariski-dense set of classical cuspidal automorphic forms only occur under very restrictive conditions. We show ho ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Between digital and territorial turns: A forking path

Elena Cogato Lanza, Chiara Cavalieri

This chapter looks at the intertwined evolution of two different ideas throughout the past century: that of ‘territory’, that has been reshaped and redefined in the field of architecture and urbanism, and that of ‘digital’, that while becoming dominant, ha ...
Routledge2022

Gerstenhaber structure on Hochschild cohomology of the Fomin–Kirillov algebra on 3 generators

The goal of this article is to compute the Gerstenhaber bracket of the Hochschild cohomology of the Fomin–Kirillov algebra on three generators over a field of characteristic different from 2 and 3. This is in part based on a general method we introduce to ...
2022

On the Grothendieck-Serre conjecture for classical groups

Eva Bayer Fluckiger

We prove some new cases of the Grothendieck-Serre conjecture for classical groups. This is based on a new construction of the Gersten-Witt complex for Witt groups of Azumaya algebras with involution on regular semilocal rings, with explicit second residue ...
WILEY2022

Atomically engineered interfaces yield extraordinary electrostriction

Paul Muralt, Dragan Damjanovic, Ivano Eligio Castelli, Daesung Park

Electrostriction is a property of dielectric materials whereby an applied electric field induces a mechanical deformation proportional to the square of that field. The magnitude of the effect is usually minuscule (
2022

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Alessandro Chiesa, Siqi Liu

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. We present an IOP that simultaneously achieves the properties of zer ...
SPRINGER INTERNATIONAL PUBLISHING AG2022

Efficient protocols for oblivious linear function evaluation from ring-LWE

Juan Ramón Troncoso-Pastoriza

An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...
IOS PRESS2022

Graph Chatbot

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.