Krzysztof Nowicki

According to our database, Krzysztof Nowicki authored at least 18 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Local Advice and Local Decompression.

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela

CoRR, 2024

Brief Announcement: Local Advice and Local Decompression.

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications.

Michal Bartoszkiewicz, Jan Chorowski, Adrian Kosowski, Jakub Kowalski, Sergey Kulik, Mateusz Lewandowski, Krzysztof Nowicki, Kamil Piechowiak, Olivier Ruas, Zuzanna Stamirowska, Przemyslaw Uznanski

CoRR, 2023

Improved Dynamic Colouring of Sparse Graphs.

Aleksander Bjørn Grodt Christiansen, Krzysztof Nowicki, Eva Rotenberg

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2021

A deterministic algorithm for the MST problem in constant rounds of congested clique.

Krzysztof Nowicki

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model.

Krzysztof Nowicki, Krzysztof Onak

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Faster Algorithms for Edge Connectivity via Random 2-Out Contractions.

Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Massively Parallel Algorithms for Minimum Cut.

Mohsen Ghaffari, Krzysztof Nowicki

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2018

Random Sampling Applied to the MST Problem in the Node Congested Clique Model.

Krzysztof Nowicki

CoRR, 2018

On Range and Edge Capacity in the Congested Clique.

Tomasz Jurdzinski, Krzysztof Nowicki

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

MST in <i>O</i>(1) Rounds of Congested Clique.

Tomasz Jurdzinski, Krzysztof Nowicki

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Communication Complexity in Vertex Partition Whiteboard Model.

Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki

Proceedings of the Structural Information and Communication Complexity, 2018

Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique.

Tomasz Jurdzinski, Krzysztof Nowicki

Proceedings of the Structural Information and Communication Complexity, 2018

Congested Clique Algorithms for the Minimum Cut Problem.

Mohsen Ghaffari, Krzysztof Nowicki

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

MST in O(1) Rounds of the Congested Clique.

Tomasz Jurdzinski, Krzysztof Nowicki

CoRR, 2017

MSF and Connectivity in Limited Variants of the Congested Clique.

Tomasz Jurdzinski, Krzysztof Nowicki

CoRR, 2017

Brief Announcement: On Connectivity in the Broadcast Congested Clique.

Tomasz Jurdzinski, Krzysztof Nowicki

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Parallel multiple selection by regular sampling.

Krzysztof Nowicki

CoRR, 2016