Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrzysztof Nowicki 0002
Person information
- affiliation: Pathway.com, Poland
- affiliation (former): University of Copenhagen, Denmark
- affiliation (former): University of Wroclaw, Poland
Other persons with the same name
- Krzysztof Nowicki 0001
![[0000-0002-6574-6263]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6574-6263")
— Technical University of Gdansk, Poland - Krzysztof Nowicki 0003 — Institute for Basic Research in Developmental Disabilities, Staten Island, NY, USA
- Krzysztof Nowicki 0004 — Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Aleksander Bjørn Grodt Christiansen, Krzysztof Nowicki, Eva Rotenberg:
Improved Dynamic Colouring of Sparse Graphs. STOC 2023: 1201-1214- [i9]Michal Bartoszkiewicz, Jan Chorowski, Adrian Kosowski, Jakub Kowalski, Sergey Kulik, Mateusz Lewandowski, Krzysztof Nowicki, Kamil Piechowiak, Olivier Ruas, Zuzanna Stamirowska, Przemyslaw Uznanski:
Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications. CoRR abs/2307.13116 (2023) - 2022
- [i8]Aleksander B. G. Christiansen, Krzysztof D. Nowicki, Eva Rotenberg:
Improved Dynamic Colouring of Sparse Graphs. CoRR abs/2211.06858 (2022) - 2021
- [c10]Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. SODA 2021: 2939-2958 - [c9]Krzysztof Nowicki:
A deterministic algorithm for the MST problem in constant rounds of congested clique. STOC 2021: 1154-1165 - 2020
- [c8]Mohsen Ghaffari, Krzysztof Nowicki:
Massively Parallel Algorithms for Minimum Cut. PODC 2020: 119-128 - [c7]Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup:
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA 2020: 1260-1279 - [i7]Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. CoRR abs/2002.07800 (2020)
2010 – 2019
- 2019
- [i6]Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup:
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. CoRR abs/1909.00844 (2019) - [i5]Krzysztof Nowicki:
A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. CoRR abs/1912.04239 (2019) - 2018
- [c6]Mohsen Ghaffari, Krzysztof Nowicki:
Congested Clique Algorithms for the Minimum Cut Problem. PODC 2018: 357-366 - [c5]Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki:
Communication Complexity in Vertex Partition Whiteboard Model. SIROCCO 2018: 264-279 - [c4]Tomasz Jurdzinski, Krzysztof Nowicki:
Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique. SIROCCO 2018: 331-344 - [c3]Tomasz Jurdzinski, Krzysztof Nowicki:
MST in O(1) Rounds of Congested Clique. SODA 2018: 2620-2632 - [c2]Tomasz Jurdzinski, Krzysztof Nowicki:
On Range and Edge Capacity in the Congested Clique. SOFSEM 2018: 305-318 - [i4]Krzysztof Nowicki:
Random Sampling Applied to the MST Problem in the Node Congested Clique Model. CoRR abs/1807.08738 (2018) - 2017
- [c1]Tomasz Jurdzinski, Krzysztof Nowicki:
Brief Announcement: On Connectivity in the Broadcast Congested Clique. DISC 2017: 54:1-54:4 - [i3]Tomasz Jurdzinski, Krzysztof Nowicki:
MSF and Connectivity in Limited Variants of the Congested Clique. CoRR abs/1703.02743 (2017) - [i2]Tomasz Jurdzinski, Krzysztof Nowicki:
MST in O(1) Rounds of the Congested Clique. CoRR abs/1707.08484 (2017) - 2016
- [i1]Krzysztof Nowicki:
Parallel multiple selection by regular sampling. CoRR abs/1611.05549 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-14 01:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
