Algorytmy grafowe w różnych modelach obliczeń rozproszonych i równoległych.
2019/32/T/ST6/00566
Descriptors
- ST6_006: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
Panel
ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution
Uniwersytet Wrocławski, Wydział Matematyki i Informatyki
Voivodeship: dolnośląskie
Principal investigator (from the host institution)
Number of co-investigators in the project: 2
Call
ETIUDA 7 – announced on 2018-12-14
- Amount awarded
- 143 264 PLN
- Project start date
- 2019-10-01
- Project end date
- 2020-09-30
- Project duration
- 12 months (the same as in the proposal)
- Project status
- Project settled
Project description
Download the project description in a pdf file
Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Information in the final report
Articles in post-conference publications (2)
-
A deterministic algorithm for the MST problem in constant rounds of Congested Clique
- Authors:
- Krzysztof Nowicki
- Conference:
- STOC2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing (year: 2021, pages: 1154–1165), Publisher: Association for Computing Machinery
- Date:
- conference 44348
- Status:
- Published
-
Massively Parallel Algorithms for Minimum Cut
- Authors:
- Mohsen Ghaffari, Krzysztof Nowicki
- Conference:
- PODC '20: 39th Symposium on Principles of Distributed Computing (year: 2020, pages: 119–128), Publisher: Association for Computing Machinery
- Date:
- conference 44013
- Status:
- Published