Publications related to When Stuck, Flip a Coin

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.

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

Efficient Algorithms for the Data Exchange Problem

Michael Christoph Gastpar, Sameer Pawar

In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...

Institute of Electrical and Electronics Engineers2016

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation

Ola Nils Anders Svensson, Lukas Polacek

The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [2012] ...

Assoc Computing Machinery2016

Decentralized consensus optimization with asynchrony and delays

Ali H. Sayed, Kun Yuan, Tianyu Wu

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network of agents, where the agents perform local computation and communicate with neighbors. We design the algorithm so that the agents can compute a ...

IEEE2016

On solving LPN using BKW and variants Implementation and Analysis

Serge Vaudenay, Sonia Mihaela Bogos, Florian Tramèr

The Learning Parity with Noise problem (LPN) is appealing in cryptography as it is considered to remain hard in the post-quantum world. It is also a good candidate for lightweight devices due to its simplicity. In this paper we provide a comprehensive anal ...

Springer2016

Observations on the LPN Solving Algorithm from Eurocrypt'16

Serge Vaudenay, Sonia Mihaela Bogos

In this note we re-evaluate the Eurocrypt’16 paper by Zhang et al. [9] in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algorithm from [9]. While this new algorithm claims to im ...

2016

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Bernard Moret, Mingfu Shao

A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when ge ...

Mary Ann Liebert, Inc2016

When Stuck, Flip a Coin

Graph Chatbot

Chat with Graph Search

Pattern formation with voluminous processes

Approximation algorithms for geometric dispersion

Collision-Free Pattern Formation

Efficient Algorithms for the Data Exchange Problem

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation

Decentralized consensus optimization with asynchrony and delays

On solving LPN using BKW and variants Implementation and Analysis

Observations on the LPN Solving Algorithm from Eurocrypt'16

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

A New Framework for Distributed Submodular Maximization

Approximation algorithms for geometric dispersion

A New Framework for Distributed Submodular Maximization

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Decentralized consensus optimization with asynchrony and delays

Collision-Free Pattern Formation

On solving LPN using BKW and variants Implementation and Analysis

Efficient Algorithms for the Data Exchange Problem

Pattern formation with voluminous processes

Observations on the LPN Solving Algorithm from Eurocrypt'16