Jan Olkowski

Orcid: 0000-0001-9278-3935

According to our database1, Jan Olkowski authored at least 19 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Dynamic Metric Embedding into ℓ<sub>p</sub> Space.
CoRR, 2024

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?
CoRR, 2024

Power of Posted-price Mechanisms for Prophet Inequalities.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Online Sampling and Decision Making with Low Entropy.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Dynamic Metric Embedding into lp Space.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Fault-Tolerant Consensus in Quantum Networks.
CoRR, 2023

Disconnected Agreement in Networks Prone to Link Failures.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Trading Prophets.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Brief Announcement: Improved Consensus in Quantum Networks.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Optimal Algorithms for Free Order Multiple-Choice Secretary.
CoRR, 2022

Improved communication complexity of fault-tolerant consensus.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Adaptive Massively Parallel Algorithms for Cut Problems.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Entropy-Based Approximation of the Secretary Problem.
CoRR, 2021

Consensus in Networks Prone to Link Failures.
CoRR, 2021

2020
Fast Agreement in Networks with Byzantine Nodes.
Proceedings of the 34th International Symposium on Distributed Computing, 2020


  Loading...