Currently I'm a Datastore Research Engineer at Pathway.com
Before, I was:
- a postdoc at BARC, at University of Copenhagen , hosted by Mikkel Thorup;
- a PhD student at Institute of Computer Science, at University of Wrocław, under the supervision of Tomasz Jurdziński.
My main area of interests are parallel and distributed algorithms, as well as algorithms for large data sets.
Here are my dblp, google scholar and a list of my papers (updated once in a while; more or less in chronological order, starting with the most recent):
Aleksander B. G. Christiansen, Krzysztof D. Nowicki, Eva Rotenberg: Improved Dynamic Colouring of Sparse Graphs (arxiv)
Krzysztof Nowicki: A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique (STOC'21, arxiv)
Krzysztof Nowicki, Krzysztof Onak: Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation model (SODA'21, arxiv)
Mohsen Ghaffarri, Krzysztof Nowicki: Massively Parallel Algorithms for Minimum Cut (PODC'20)
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup: Faster Algorithms for Edge Connectivity via Random 2-Out Contractions (SODA'20, arxiv)
Mohsen Ghaffari, Krzysztof Nowicki: Congested Clique Algorithms for the Minimum Cut Problem (PODC'18)
Tomasz Jurdziński, Krzysztof Nowicki: Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique (SIROCCO'18)
Tomasz Jurdziński, Krzysztof Loryś, Krzysztof Nowicki: Communication Complexity in Vertex Partition Whiteboard Model (SIROCCO'18)
Tomasz Jurdziński, Krzysztof Nowicki: On Range and Edge Capacity in the Congested Clique (SOFSEM'18, part of arxiv)
Tomasz Jurdziński, Krzysztof Nowicki: MST in O(1) Rounds of Congested Clique (SODA'18, invited talk at HALG'18, invited talk at 'Discrete algorithms' minisymposium at CanaDAM'19, arxiv)
Tomasz Jurdziński, Krzysztof Nowicki: Brief Announcement: On Connectivity in the Broadcast Congested Clique (DISC'17, part of arxiv)
I was a member of a research group led by Tomasz Jurdziński, working on a project 'Design and Analysis of Scalable Algorithms for Wireless Networks' funded by NCN OPUS grant number DEC-2012/07/B/ST6/01534
I was a member of a research group led by Tomasz Jurdziński, working on a project 'Design of Distributed Algorithms in Highly Congested Networks' funded by NCN OPUS grant number 2017/25/B/ST6/02010
I was a principle investigator in a project 'Graph algorithms in various models of parallel and distributed computing' funded by NCN ETIUDA grant number 2019/32/T/ST6/00566 that funded my 6 month doctoral internship in the group of prof. M. Ghaffari at ETH,
In November 2018 I was awarded by the city / president of Wrocław with Hugo Steinhaus scholarship for PhD students
In May 2020 I got a START scholarship funded by the Foundation for Polish Science.
In 2020 I was awarded Witold Lipski prize [see details(in polish)].
In 2022 I was awarded Prime Minister [of Poland] Prize for the best PhD theses.
So far I was mistaken for:
- dr Krzysztof Nowicki from Faculty of Law, Administration and Economics at the University of Wroclaw.
- prof. Krzysztof Nowicki from Department of Statistics at the Lund University.
emails:
knowicki@cs.uni.wroc.pl
krzysiek@pathway.com
where to find me:
currently - in Paris, if you want to reach me, try email
