Publication

Even Small Birds are Unique: Population Protocols with Identifiers

Related publications (35)

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.

Wing and tail morphing in birds and drones

Enrico Ajanic

To aid humans in civilian tasks, future drones will have to operate in large cities that abound with difficult flight conditions such as confined spaces, obstacles, and turbulent air. Such drones must cruise efficiently to cover vast distances fast and als ...

EPFL2023

Hardness Results for Consensus-Halving

Jie Zhang, Aris Filos Ratsikas

The Consensus-halving problem is the problem of dividing an object into two portions, such that each of n agents has equal valuation for the two portions. We study the epsilon-approximate version, which allows each agent to have an epsilon discrepancy on t ...

Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik2018

A New Framework for Distributed Submodular Maximization

Justin Dean Ward

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algo ...

Ieee2016

Towards Unconditional Tor-Like Anonymity

Christina Fragouli, László Czap, Iris Safaka

We design and evaluate a traffic anonymization protocol for wireless networks, aiming to protect against computationally powerful adversaries. Our protocol builds on recent key-generation techniques, that leverage intrinsic properties of the wireless toget ...

2015

On the Learning Behavior of Adaptive Networks - Part II: Performance Analysis

Ali H. Sayed

Part I of this paper examined the mean-square stability and convergence of the learning process of distributed strategies over graphs. The results identified conditions on the network topology, utilities, and data in order to ensure stability; the results ...

IEEE2015

Efficient Key Exchange for Wireless Multi-hop Networks

Christina Fragouli, László Czap, Iris Safaka

We present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protoc ...

2015

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Handan Kilinç Alper

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. We examine MFE scenarios where every participant has some item, and at the end of the protocol, either ever ...

Springer International Publishing2015

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Modeling Bird Flight Formations Using Diffusion Adaptation

Ali H. Sayed

Flocks of birds self-organize into V-formations when they need to travel long distances. It has been shown that this formation allows the birds to save energy, by taking advantage of the upwash generated by the neighboring birds. In this work we use a mode ...

IEEE2011

Approximate Capacity of a Class of Gaussian Interference-Relay Networks

Christina Fragouli, Suhas Diggavi

In this paper, we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows between different source-destination pairs. We focus on two-stage relay-interference networks where there are weak cr ...

Institute of Electrical and Electronics Engineers2011