[DMANET] OPODIS 2014 - **Early Registration Deadline Extended** - Call for Participation

####################################################
OPODIS 2014 Call for Participation
18th Int. Conf. on the Principles of Distributed Systems (OPODIS)
16-19 December 2014
Cortina, Italy
http://opodis2014.dis.uniroma1.it/
####################################################

*** NOTE: Reduced early registration fees have been extended through November 22nd! ***

You are kindly invited to participate in the 18th International Conference on the Principles of Distributed Systems (OPODIS).OPODIS is an open forum for the exchange of state-of-the-art knowledge on distributed computing and distributed computer systems. All aspects of distributed systems are within the scope of OPODIS, including theory, specification, design, performance, and system building. OPODIS is traditionally strong in the theoretical aspects of distributed systems; furthermore, OPODIS is expanding its coverage to include the overlap between theoretical solutions and practical implementations, as well as experimentation and quantitative assessments.

The conference will take place in Cortina d'Ampezzo, Italy. Cortina d'Ampezzo, Italy's premier mountain resort, is exclusively positioned in the breathtaking UNESCO World Natural Heritage Dolomites, one of the most beautiful and unique alpine regions in the world. A Best of the Alps resort and a symbol of style, fashion and the Italian way of life, Cortina is the perfect destination for those who seek a truly special experience where natural beauty, culture, tradition, art, food and wine fuse together in pure joie de vivre. The spectacular scenery and full range of alpine sports and outdoor activities offered by this bustling mountain town, host to world-cups and international championships, attract nature lovers and sports enthusiasts during all seasons. OPODIS will be hosted at the Splendid Hotel Venezia located in the very hearth of Cortina.

For travel arrangements, please check
http://opodis2014.dis.uniroma1.it/venue.html

Online registration is available at
http://opodis2014.dis.uniroma1.it/registration.html

Contact us at opodis@dis.uniroma1.it
http://opodis2014.dis.uniroma1.it/


################
Program Highlights
################

INVITED TALK:
> Lorenzo Alvisi (University of Texas at Austin), "Salt: Combining ACID and BASE in a Distributed Database"

TUTORIALS
> Christian Cachin (IBM Zurich), "Integrity, Consistency, and Verification of Remote Computation"
> Yann Busnel (Crest - Ensai, Rennes & LINA - University of Nantes), "Distributed Large-Scale Data Stream Analysis"

TECHNICAL PROGRAM
> Presentations of 32 full research papers

WORKSHOP
> Second Workshop on Distributed Computing: Computability and Complexity

Further details on the program are available at
http://opodis2014.dis.uniroma1.it/program.html


##############
Accepted Papers
##############

Tomoko Izumi, Sayaka Kamei and Yukiko Yamauchi
Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots

Zohir Bouzid, Eli Gafni and Petr Kuznetsov
Strong Equivalence Relations for Iterated Models

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa
Loosely-stabilizing Leader Election on Arbitrary Graphs in Population Protocols

Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen and Yessin M. Neggaz
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case

Uri Abraham and Gal Amram
On the Mailbox Problem

Wojciech Wawrzyniak, Edyta Szynanska, Marcin Witkowski, Andrzej Czygrinow and Michal Hanckowiak
Distributed approximation of minimum k-dominating set in planar graphs.

Avery Miller and Andrzej Pelc
Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt

Pierre Sutra, Etienne Rivière and Pascal Felber
A Practical Distributed Universal Construction with Unknown Participants

Paola Flocchini, Giuseppe Prencipe, Nicola Santoro and Giovanni Viglietta
Solving the Uniform Circle Formation Problem

Rati Gelashvili, Mohsen Ghaffari, Jerry Li and Nir Shavit
On the Importance of Registers for Computability

Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy and Corentin Travers
Opinion Number of Set-Agreement

Michel Raynal, Julien Stainer and Gadi Taubenfeld
Distributed Universality

Panagiota Fatourou, Eleni Kanellou, Eleftherios Kosmas and Md Forhad Rabbi
WFR-TM: Knowledge of Past, Understanding of Future, and Perseverance in Present

Christian Cachin and Olga Ohrimenko
Verifying the Consistency of Remote Untrusted Services with Commutative Operations

Elli Androulaki, Christian Cachin, Dan Dobre and Marko Vukolic
Erasure-Coded Byzantine Storage with Separate Metadata

Bogdan S. Chlebus, Gianluca De Marco and Dariusz R. Kowalski
Scalable Wake-up of Multi-Channel Single-Hop Radio Networks

Ahmed Hassan, Roberto Palmieri and Binoy Ravindran
On Developing Optimistic Transactional Lazy Set

Alexandru Turcu, Sebastiano Peluso, Roberto Palmieri and Binoy Ravindran
Be General and Don't Give Up Consistency in Geo-Replicated Transactional Systems

Nhan Nguyen, Philippas Tsigas and Håkan Sundell
ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List

Tamas Lukovszki and Friedhelm Meyer auf der Heide
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots

Sandeep S Kulkarni, Murat Demirbas, Deepak Madeppa, Bharadwaj Avva and Marcelo Leone
Logical Physical Clocks and Consistent Snapshots in Globally Distributed Databases

Odorico Mendizabal, Parisa Jalili Marandi, Fernando Luís Dotti and Fernando Pedone
Recovery in Parallel State-Machine Replication

Dana Drachsler-Cohen and Erez Petrank
LCD: Local Combining on Demand

Kenneth Platz, Neeraj Mittal and S. Venkatesan
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization

Delbot François, Laforest Christian and Rovedakis Stephane
Self-stabilizing algorithms for connected vertex cover and clique decomposition problems

Henry Tan, Chris Wacek, Calvin Newport and Micah Sherr
A Disruption-Resistant MAC Layer for Multichannel Wireless Networks

Shay Kutten and Chhaya Trehan
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree

Zahra Aghazadeh and Philipp Woelfel
Space- and Time-Efficient Long-Lived Test-And-Set

Sisi Duan, Hein Meling, Sean Peisert and Haibin Zhang
BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration

Ajoy K. Datta, Lawrence L. Larmore and Toshimitsu Masuzawa
Communication Efficient Self-Stabilizing Algorithms for Breadth-First Search Trees

Martina Eikel, Christian Scheideler and Alexander Setzer
RoBuSt: A Crash-Failure-Resistant Distributed Storage System

Taisuke Izumi and Roger Wattenhofer
Time Lower Bounds for Distributed Distance Oracles


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************