Václav Rozhon
Orcid: 0000-0002-9646-8446
According to our database1,
Václav Rozhon
authored at least 38 papers
between 2017 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
9
10
3
1
3
4
1
1
1
1
3
7
6
2
4
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
J. Comb. Theory A, 2022
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees.
CoRR, 2022
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms.
CoRR, 2022
Undirected (1+<i>ε</i>)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the International Conference on Machine Learning, 2022
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
J. Comb. Theory B, 2021
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics.
CoRR, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021
2020
Polylogarithmic-time deterministic network decomposition and distributed derandomization.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
2019
2017
Electron. Notes Discret. Math., 2017