| MST in O(1) Rounds of Congested Clique T Jurdziński, K Nowicki Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 105 | 2018 |
| Faster algorithms for edge connectivity via random 2-out contractions M Ghaffari, K Nowicki, M Thorup Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 60 | 2020 |
| A deterministic algorithm for the MST problem in constant rounds of congested clique K Nowicki Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 36 | 2021 |
| Congested clique algorithms for the minimum cut problem M Ghaffari, K Nowicki Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 24 | 2018 |
| Dynamic graph algorithms with batch updates in the massively parallel computation model K Nowicki, K Onak Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 18 | 2021 |
| Massively Parallel Algorithms for Minimum Cut M Ghaffari, K Nowicki Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 15 | 2020 |
| Connectivity and minimum cut approximation in the broadcast congested clique T Jurdziński, K Nowicki International Colloquium on Structural Information and Communication …, 2018 | 13 | 2018 |
| Brief announcement: on connectivity in the broadcast congested clique T Jurdzinski, K Nowicki 31st International Symposium on Distributed Computing (DISC 2017), 54: 1-54: 4, 2017 | 12 | 2017 |
| Improved dynamic colouring of sparse graphs ABG Christiansen, K Nowicki, E Rotenberg Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1201-1214, 2023 | 6 | 2023 |
| Msf and connectivity in limited variants of the congested clique T Jurdzinski, K Nowicki arXiv preprint arXiv:1703.02743, 2017 | 6 | 2017 |
| Communication complexity in vertex partition whiteboard model T Jurdzinski, K Lorys, K Nowicki International Colloquium on Structural Information and Communication …, 2018 | 5 | 2018 |
| Random sampling applied to the MST problem in the node congested clique model K Nowicki arXiv preprint arXiv:1807.08738, 2018 | 3 | 2018 |
| Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications M Bartoszkiewicz, J Chorowski, A Kosowski, J Kowalski, S Kulik, ... arXiv preprint arXiv:2307.13116, 2023 | 1 | 2023 |
| On Range and Edge Capacity in the Congested Clique T Jurdziński, K Nowicki SOFSEM 2018: Theory and Practice of Computer Science: 44th International …, 2018 | | 2018 |
| Parallel multiple selection by regular sampling K Nowicki arXiv preprint arXiv:1611.05549, 2016 | | 2016 |
