NCN grant number 2017/25/B/ST6/02010:
Design of Distributed Algorithms in Highly Congested Networks (OPUS 13, 2018-20)
NCN grant number 2017/25/B/ST6/02010:
Design of Distributed Algorithms in Highly Congested Networks (OPUS 13, 2018-20)
Publications & reports:
Paweł Garncarek, Tomasz Jurdzinski and Dariusz Kowalski, Local queuing under contention. DISC 2018.
Mohsen Ghaffari, Krzysztof Nowicki, Congested Clique Algorithms for the Minimum Cut Problem. PODC 2018.
Tomasz Jurdzinski, Krzysztof Nowicki, Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique. SIROCCO 2018.
Tomasz Jurdzinski, Krzysztof Loryś and Krzysztof Nowicki, Communication Complexity in Vertex Partition Whiteboard Model. SIROCCO 2018.
Paweł Garncarek, Tomasz Jurdzinski, Dariusz Kowalski and Miguel Mosteiro, mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals, IPDPS 2019.
Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik and Grzegorz Stachowiak. Fair Hitting Sequence problem: scheduling activities with varied frequency requirements. CIAC 2019.
Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski. Optimal Channel Utilization with Limited Feedback. FCT 2019.
Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski: Stable Memoryless Queuing under Contention. DISC 2019.
Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak. Communication and location discovery in geometric ring networks. Information and Computation, 266: 19-48, 2019.
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup. Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA 2020.
Mohsen Ghaffari, Krzysztof Nowicki. Massively Parallel Algorithms for Minimum Cut. PODC 2020.
Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski. Efficient Local Medium Access . SPAA 2020.
Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski and Dariusz Kowalski. Optimal Packet-oblivious Stable Routing in Multi-hop Wireless Networks. SIROCCO 2020.
Krzysztof Nowicki, Krzysztof Onak. Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. SODA 2021.
Krzysztof Nowicki: A deterministic algorithm for the MST problem in constant rounds of congested clique. STOC 2021: 1154-1165.
Adam Gańczorz, Tomasz Jurdziński, and Mateusz Lewko, Andrzej Pelc. Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. Accepted for DISC 2021. (Appeared also as a Brief Announcement at SPAA 2021.)
PhD Theses:
Krzysztof Nowicki, On Spanning Trees and Small Cuts in Congested Clique and MPC, 2020.
Paweł Garncarek, Online and Distributed Algorithms for Packet Dissemination in Wireless Networks, 2021.
Investigators:
A. Gańczorz, P. Garncarek, T. Jurdziński (Principal Investigator), D. Kowalski (Univ. Augusta), K. Nowicki.
Collaborators:
G. de Marco (Univ. Salerno), M. Ghaffari (ETH), L. Gasieniec (Univ. Liverpool), A. Pelc (Université du Québec en Outaouais), M. Mosteiro (PACE).