Projects funded by the NCN
Algorytmy grafowe w różnych modelach obliczeń rozproszonych i równoległych.
2019/32/T/ST6/00566
Keywords:
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
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
woj. 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 (Y-m-d): 2019-10-01
Project end date (Y-m-d): 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 CliqueAuthors:Krzysztof NowickiConference:STOC2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing (rok: 2021, ), Wydawca: Association for Computing MachineryData:konferencja 44348Status:Published
- Massively Parallel Algorithms for Minimum CutAuthors:Mohsen Ghaffari, Krzysztof NowickiConference:PODC '20: 39th Symposium on Principles of Distributed Computing (rok: 2020, ), Wydawca: Association for Computing MachineryData:konferencja 44013Status:Published