Publication

A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms

Related publications (33)

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.

Integration of BIP into Connectivity Factory: Implementation

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

Coordinating component behaviour and, in particular, concurrent access to resources is among the key difficulties of building large concurrent systems. To address this, developers must be able to manipulate high-level concepts, such as Finite State Machine ...

2013

Arabic Entity Graph Extraction Using Morphology, Finite State Machines, and Graph Transformations

Hamza Harkous

Research on automatic recognition of named entities from Arabic text uses techniques that work well for the Latin based languages such as local grammars, statistical learning models, pattern matching, and rule-based techniques. These techniques boost their ...

2012

Definitive Consensus for Distributed Data Inference

Leonidas Georgopoulos

Inference from data is of key importance in many applications of informatics. The current trend in performing such a task of inference from data is to utilise machine learning algorithms. Moreover, in many applications that it is either required or is pref ...

EPFL2011

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{NP}

-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an in- creasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural ex- tension of the random phone-call ...

Springer2010

Distributed average consensus for wireless sensor networks

Florence Bénézit

Wireless sensor networks have emerged a few years ago, enabling large scale sensing at low cost. There are many interesting problems related to this new sensing tool: designing robust and small hardware, defining adapted routing protocols, minimizing the e ...

EPFL2009

Kinetics of the Bose-Einstein condensation of microcavity polaritons - art. no. 689213

Vincenzo Savona, Davide Sarchi

We adopt a kinetic theory of polariton non-equilibrium Bose-Einstein condensation, to describe the formation of off-diagonal long-range order. The theory accounts properly for the dominant role of quantum fluctuations in the condensate. In realistic situat ...

SPIE-INT SOC OPTICAL ENGINEERING, PO BOX 10, BELLINGHAM, WA 98227-0010 USA2008

Algorithms for Interface Synthesis

Vasu Singh, Dirk Thilo Beyer

A temporal interface for a software component is a ﬁnite automaton that speciﬁes the legal sequences of calls to functions that are provided by the component. We compare and evaluate three different algorithms for automatically extracting temporal interfac ...

Springer2007

Long-range order in the Bose-Einstein condensation of polaritons

Vincenzo Savona, Davide Sarchi

We adopt a kinetic theory of polariton nonequilibrium Bose-Einstein condensation to describe the formation of off-diagonal long-range order. The theory accounts properly for the dominant role of quantum fluctuations in the condensate. In realistic situatio ...

2007

When Birds Die: Making Population Protocols Fault-tolerant

Rachid Guerraoui, Eric Ruppert

In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise interactions. The ability of such systems to compute functions on a multiset ...

2006

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{NP}

-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010