DisDyn SIGNED
Distributed and Dynamic Graph Algorithms and Complexity
Total Cost €
0EC-Contrib. €
0Partnership
0Views
0DisDyn project word cloud
Explore the words cloud of the DisDyn project. It provides you a very rough idea of what is the project "DisDyn" about.
Project "DisDyn" data sheet
The following table provides information about the project.
| Coordinator |
KUNGLIGA TEKNISKA HOEGSKOLAN
Organization address contact info |
| Coordinator Country | Sweden [SE] |
| Total cost | 1˙500˙000 € |
| EC max contribution | 1˙500˙000 € (100%) |
| Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
| Code Call | ERC-2016-STG |
| Funding Scheme | ERC-STG |
| Starting year | 2017 |
| Duration (year-month-day) | from 2017-02-01 to 2022-01-31 |
Partnership
Take a look of project's partnership.
| # | ||||
|---|---|---|---|---|
| 1 | KUNGLIGA TEKNISKA HOEGSKOLAN | SE (STOCKHOLM) | coordinator | 1˙500˙000.00 |
Map
Project objective
This project aims to (i) resolve challenging graph problems in distributed and dynamic settings, with a focus on connectivity problems (such as computing edge connectivity and distances), and (ii) on the way develop a systematic approach to attack problems in these settings, by thoroughly exploring relevant algorithmic and complexity-theoretic landscapes. Tasks include
- building a hierarchy of intermediate computational models so that designing algorithms and proving lower bounds can be done in several intermediate steps,
- explaining the limits of algorithms by proving conditional lower bounds based on old and new reasonable conjectures, and
- connecting techniques in the two settings to generate new insights that are unlikely to emerge from the isolated viewpoint of a single field.
The project will take advantage from and contribute to the developments in many young fields in theoretical computer science, such as fine-grained complexity and sublinear algorithms. Resolving one of the connectivity problems will already be a groundbreaking result. However, given the approach, it is likely that one breakthrough will lead to many others.
Publications
| year | authors and title | journal | last update |
|---|---|---|---|
| 2019 |
Danupon Nanongkai, Michele Scquizzato Equivalence Classes and Conditional Hardness in Massively Parallel Computations published pages: , ISSN: , DOI: 10.4230/lipics.opodis.2019.33 |
23rd International Conference on Principles of Distributed Systems (OPODIS 2019) | 2020-02-18 |
| 2018 |
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Multi-Finger Binary Search Trees published pages: , ISSN: 1868-8969, DOI: 10.4230/LIPIcs.ISAAC.2018.55 |
29th International Symposium on Algorithms and Computation, ISAAC 2018 | 2019-11-13 |
| 2019 |
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof New Tools and Connections for Exponential-Time Approximation published pages: 3993-4009, ISSN: 0178-4617, DOI: 10.1007/s00453-018-0512-8 |
Algorithmica 81/10 | 2019-11-13 |
| 2018 |
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai Dynamic Algorithms for Graph Coloring published pages: 1-20, ISSN: , DOI: 10.1137/1.9781611975031.1 |
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-07-18 |
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "DISDYN" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "DISDYN" are provided by the European Opendata Portal: CORDIS opendata.