Publication

Mesoscopic self-assembly: A shift to complexity

Publications associées (35)

FANOK: Knockoffs in Linear Time

We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large-scale feature selection problems. Identifying the knockoff distribution requires solving a large-scale semidefinite progra ...

SIAM PUBLICATIONS2021

Soft matter probed by nonlinear scattering: self-assembly, interfaces, hydration, and long-range order

Jan Dedic

All organisms are made to a large extent of soft matter - macromolecules such as proteins and polysaccharides, or assemblies of small molecules such as lipids embedded in an aqueous environment. Understanding the role of order in soft matter presents a cha ...

EPFL2020

LaMBERT: Light and Multigranular BERT

Ljupche Milosheski

Pre-training complex language models is essential for the success of the recent methods such as BERT or OpenAI GPT. Their size makes not only the pre-training phase, but also consecutive applications to be computationally expensive. BERT-like models excel ...

2020

String Matching: Communication, Circuits, and Learning

Mika Tapani Göös

String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on th ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2019

On the complexity of linearizability

Jad Hamza

It was previously shown that the problem of verifying whether a finite concurrent system is linearizable can be done with an EXPSPACE complexity. However, the best known lower bound is PSPACE-hardness, and can be obtained using a reduction from control-sta ...

SPRINGER WIEN2019

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

ePrint2018

DESIA: A General Framework for Designing Interlocking Assemblies

Mark Pauly, Peng Song

Interlocking assemblies have a long history in the design of puzzles, furniture, architecture, and other complex geometric structures. The key defining property of interlocking assemblies is that all component parts are immobilized by their geometric arran ...

ASSOC COMPUTING MACHINERY2018

DESIA: A General Framework for Designing Interlocking Assemblies

Mark Pauly, Peng Song

ASSOC COMPUTING MACHINERY2018

High-speed photothermal off-resonance atomic force microscopy reveals assembly routes of centriolar scaffold protein SAS-6

Pierre Gönczy, Georg Fantner, Adrian Pascal Nievergelt, Niccolo Banterle, Santiago Harald Andany

The self-assembly of protein complexes is at the core of many fundamental biological processes1, ranging from the polymerization of cytoskeletal elements, such as microtubules2, to viral capsid formation and organelle assembly3. To reach a comprehensive un ...

2018

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.

Connectez-vous pour utiliser Chat avec Graph Search