Related publications (12)

A combinatorial proof of a sumset conjecture of Furstenberg

Florian Karl Richter

We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if logr/logs\log r / \log s is irrational and XX and YY are ×r\times r- and ×s\times s-invariant subsets of [0,1][0,1], respectively, then $\dim_\text{ ...
2021

Vector-Based 3D graphic statics (Part III): Designing with Combinatorial Equilibrium Modelling

Corentin Jean Dominique Fivet, Pierluigi D'Acunto

This paper presents an extension of the graphic-statics-based framework called Combinatorial Equilibrium Modelling (CEM). CEM allows for the generation of topologically and combinatorially different spatial equilibrium solutions in the early explorative de ...
IASS2016

Interference-Resilient Information Exchange

Rachid Guerraoui, Seth Gilbert

This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

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.