=======================================================
ADGA 2017: The 6th Workshop on Advances in Distributed Graph Algorithms
October 20, 2017
Vienna, Austria (co-located with DISC 2017)
=======================================================
ADGA is a one-day workshop that focuses on the theoretical foundations
of distributed graph algorithms.
The program consists of several invited talks, which are aimed at the
general DISC audience.
ADGA 2017 will be held on Friday, 20 October 2017 in Vienna, Austria,
and will be co-located with DISC 2017.
The workshop will be chaired by Fabian Kuhn.
Please refer to our website of ADGA 2017 at http://adga.hiit.fi/2017/
and to the website of DISC 2017 at http://www.disc-conference.org/2017/.
For information on past and future ADGA workshops, see the web site of
the ADGA workshop series, at http://adga.hiit.fi/.
=============
Invited talks
=============
Moti Medina: A (Centralized) Local Guide
Andreas Karrenbauer: Continuous Optimization Methods for Network Problems
Magnus Halldorsson: Graph abstractions in wireless networking
Mohsen Ghaffari: LOCAL Algorithms: The Chasm Between Deterministic and
Randomized
Juho Hirvonen: Proving lower bounds in the LOCAL model
Adrian Kosowski: Distance Labeling: Understanding the Source of Hardness
--
See you in Vienna!
**********************************************************
*
* 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/
*
**********************************************************
Posts
