Fast Agreement in Networks with Byzantine Nodes. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski (DISC, 2020)

Consensus in Networks Prone to Link Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski; Jedrzej Olkowski (CoRR, 2021)

Entropy-Based Approximation of the Secretary Problem. - Dariusz R. Kowalski; Piotr Krysta; Jan Olkowski (CoRR, 2021)

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski (PODC, 2022)

Adaptive Massively Parallel Algorithms for Cut Problems. - MohammadTaghi Hajiaghayi; Marina Knittel; Jan Olkowski; Hamed Saleh (SPAA, 2022)

Improved communication complexity of fault-tolerant consensus. - Mohammad Taghi Hajiaghayi; Dariusz R. Kowalski; Jan Olkowski (STOC, 2022)

Optimal Algorithms for Free Order Multiple-Choice Secretary. - Mohammad Taghi Hajiaghayi; Dariusz R. Kowalski; Piotr Krysta; Jan Olkowski (CoRR, 2022)

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. - Bogdan S. Chlebus; Dariusz Rafal Kowalski; Jan Olkowski (PODC, 2023)

Brief Announcement: Improved Consensus in Quantum Networks. - MohammadTaghi Hajiaghayi; Dariusz Rafal Kowalski; Jan Olkowski (PODC, 2023)

Trading Prophets. - José Correa 001; Andrés Cristi; Paul Duetting; MohammadTaghi Hajiaghayi; Jan Olkowski; Kevin Schewior (EC, 2023)

Disconnected Agreement in Networks Prone to Link Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski; Jedrzej Olkowski (SSS, 2023)

Fault-Tolerant Consensus in Quantum Networks. - MohammadTaghi Hajiaghayi; Dariusz R. Kowalski; Jan Olkowski (CoRR, 2023)

Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication. - Mohammad Taghi Hajiaghayi; Dariusz R. Kowalski; Jan Olkowski (ICALP, 2024)

Dynamic Metric Embedding into lp Space. - Kiarash Banihashem; MohammadTaghi Hajiaghayi; Dariusz Rafal Kowalski; Jan Olkowski; Max Springer (ICML, 2024)

Online Sampling and Decision Making with Low Entropy. - Mohammad Taghi Hajiaghayi; Dariusz R. Kowalski; Piotr Krysta; Jan Olkowski (IJCAI, 2024)

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? - Mohammad Hajiaghayi; Dariusz R. Kowalski; Jan Olkowski (PODC, 2024)

Power of Posted-price Mechanisms for Prophet Inequalities. - Kiarash Banihashem; MohammadTaghi Hajiaghayi; Dariusz R. Kowalski; Piotr Krysta; Jan Olkowski (SODA, 2024)

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed? - Mohammad Hajiaghayi; Dariusz R. Kowalski; Jan Olkowski (CoRR, 2024)

Dynamic Metric Embedding into ℓp Space. - Kiarash Banihashem; MohammadTaghi Hajiaghayi; Dariusz R. Kowalski; Jan Olkowski; Max Springer (CoRR, 2024)

Beating Competitive Ratio 4 for Graphic Matroid Secretary. - Kiarash Banihashem; MohammadTaghi Hajiaghayi; Dariusz R. Kowalski; Piotr Krysta; Danny Mittal; Jan Olkowski (CoRR, 2025)

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries. - Dariusz R. Kowalski; Jan Olkowski (CoRR, 2025)