Publications

19 results for Krzysztof Onak

Dynamic graph algorithms with batch updates in the massively parallel computation model
- - Krzysztof Nowicki
  - Krzysztof Onak
- 2021
- SODA 2021
Walking randomly, massively, and efficiently
- - Jakub Lacki
  - Slobodan Mitrović
  - et al.
- 2020
- STOC 2020
Fully Dynamic MIS in Uniformly Sparse Graphs
- - Krzysztof Onak
  - Baruch Schieber
  - et al.
- 2020
- ACM Transactions on Algorithms
Round compression for parallel matching algorithms
- - Artur Czumaj
  - Jakub Lacki
  - et al.
- 2019
- SIAM Journal on Computing
Planar graphs: Random walks and bipartiteness testing
- - Artur Czumaj
  - Morteza Monemizadeh
  - et al.
- 2019
- Random Structures and Algorithms
Scalable fair clustering
- - Arturs Backurs
  - Piotr Indyk
  - et al.
- 2019
- ICML 2019
Fully dynamic maximal independent set with sublinear in N update time
- - Sepehr Assadi
  - Krzysztof Onak
  - et al.
- 2019
- SODA 2019
Streaming algorithms for estimating the matching size in planar graphs and beyond
- - Hossein Esfandiari
  - Mohammadtaghi Hajiaghayi
  - et al.
- 2018
- ACM Transactions on Algorithms
Fully dynamic MIS in uniformly sparse graphs
- - Krzysztof Onak
  - Baruch Schieber
  - et al.
- 2018
- ICALP 2018
Fully dynamic maximal independent set with sublinear update time
- - Sepehr Assadi
  - Baruch Schieber
  - et al.
- 2018
- STOC 2018