Krzysztof Nowicki

Orcid: 0000-0002-6770-6644

Affiliations:
  • Pathway.com, Poland
  • University of Copenhagen, Denmark (former)
  • University of Wroclaw, Poland (former)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Local Advice and Local Decompression.
CoRR, 2024

Brief Announcement: Local Advice and Local Decompression.
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.
CoRR, 2023

Improved Dynamic Colouring of Sparse Graphs.
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.
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.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Massively Parallel Algorithms for Minimum Cut.
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.
CoRR, 2018

On Range and Edge Capacity in the Congested Clique.
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.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Communication Complexity in Vertex Partition Whiteboard Model.
Proceedings of the Structural Information and Communication Complexity, 2018

Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique.
Proceedings of the Structural Information and Communication Complexity, 2018

Congested Clique Algorithms for the Minimum Cut Problem.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

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

MSF and Connectivity in Limited Variants of the Congested Clique.
CoRR, 2017

Brief Announcement: On Connectivity in the Broadcast Congested Clique.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016
Parallel multiple selection by regular sampling.
CoRR, 2016


  Loading...