VR
Václav Rozhoň
cs.DScs.DCmath.COcs.LGmath.LOmath.PRcs.AIcs.CLcs.CCcs.DM
On Valency
published · living versionsW_c8jxt68w·v1 · currentpublished
Least-Atom Extremizers for Resampling Noise
with Matěj Kripner, Robert Šámal, Martin Šindelář, Adrián Zámečník
1 version
W_47e3gpvg·v1published
W_syfr45ta·v1published
W_ej6ja5wf·v1published
W_qvavks8c·v1published
Preprints & journals
46 papers in the corpus · 2018–2026General Constructions of Permutation-Fair Dice2610.15421v1 · Tom'as Gavenciak, Bernhard Haeupler, V'aclav Rozhon2026 · 0 citationsarXiv
Bolzano: From Expert-Guided Proof Search to Automated Open-Problem Solving2610.09769v2 · Adri'an Z'amecn'ik, Matej Kripner, Martin Kouteck'y et al.2026 · 0 citationsarXiv
Collision Detection is Instance ptimal Under the Birthday Threshold2609.37342v1 · Omri Ben-Eliezer, Tomer Grossman, V'aclav Rozhon et al.2026 · 0 citationsarXiv
Test or Run? Scheduling Jobs of Unknown Length2608.30911v1 · V'aclav Rozhon2026 · 0 citationsarXiv
Borel dimension growth and hyperfiniteness2608.22565v1 · Jan Greb'ik, Andrew S. Marks, V'aclav Rozhon et al.2026 · 0 citationsarXiv
Randomizing the Number of Centers in k-means++2607.26202v1 · Vaclav Rozhon2026 · 0 citationsarXiv
Heaps and Their Working Sets2607.24621v1 · Bernhard Haeupler, Richard Hlad'ik, V'aclav Rozhon et al.2026 · 0 citationsarXiv
Splay trees are almost dynamically optimal2607.18498v1 · Petr Chmel, Bernhard Haeupler, Richard Hlad'ik et al.2026 · 0 citationsarXiv
Bolzano: Case Studies in LLM-Assisted Mathematical Research2604.16989v2 · Martin Balko, Jan Greb'ik, Pavel Hub'acek et al.2026 · 0 citationsarXiv
Fast and Simple Sorting Using Partial Information.42920730 · Haeupler, Bernhard, Hladík, Richard, Iacono, John et al.2026 · 0 citationsAlgorithmica. 2026;88(3):41
Humanity's Last Exam2501.14249v12 · Long Phan, Alice Gatti, Ziwen Han et al.2025 · 61 citationsarXiv
Bidirectional Dijkstra's Algorithm is Instance-Optimal2410.14638v4 · Bernhard Haeupler, Richard Hlad'ik, Vaclav Rozhon et al.2024 · 3 citationsarXiv
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation2410.14643v1 · Shyam Narayanan, V'aclav Rozhon, Jakub Tetek et al.2024 · 0 citationsarXiv
Invitation to Local Algorithms2406.19430v2 · V'aclav Rozhon2024 · 0 citationsarXiv
Fast and Simple Sorting Using Partial Information2404.04552v4 · Bernhard Haeupler, Richard Hlad'ik, John Iacono et al.2024 · 3 citationsarXiv
Online Locality Meets Distributed Quantum Computing2403.01903v4 · Amirreza Akbari, Xavier Coiteux-Roy, Francesco d'Amore et al.2024 · 6 citationsarXiv
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence2311.13764v1 · Mohsen Ghaffari, Christoph Grunau, V'aclav Rozhon2023 · 0 citationsarXiv
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps2311.11793v4 · Bernhard Haeupler, Richard Hlad'ik, V'aclav Rozhon et al.2023 · 36 citationsarXiv
Noisy k-means++ Revisited2307.13685v1 · Christoph Grunau, Ahmet Alper Ozudogru, V'aclav Rozhon2023 · 1 citationarXiv
Fully Dynamic Consistent -Center Clustering2307.13747v1 · Jakub \Lacki, Bernhard Haeupler, Christoph Grunau et al.2023 · 7 citationsarXiv
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances2210.16351v1 · V'aclav Rozhon, Bernhard Haeupler, Anders Martinsson et al.2022 · 8 citationsarXiv
A Simple Deterministic Distributed Low-Diameter Clustering2210.11784v1 · V'aclav Rozhon, Bernhard Haeupler, Christoph Grunau2022 · 1 citationarXiv
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond2209.11651v1 · Salwa Faour, Mohsen Ghaffari, Christoph Grunau et al.2022 · 23 citationsarXiv
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization2209.11669v1 · Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler et al.2022 · 15 citationsarXiv
A Nearly Tight Analysis of Greedy k-means++2207.07949v1 · Christoph Grunau, Ahmet Alper Ozudogru, V'aclav Rozhon et al.2022 · 10 citationsarXiv
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates2204.14086v2 · Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari et al.2022 · 6 citationsarXiv
Deterministic Distributed Algorithms and Measurable Combinatorics on -Regular Forests2204.09329v2 · Sebastian Brandt, Yi-Jun Chang, Jan Greb'ik et al.2022 · 0 citationsarXiv
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications2204.08254v2 · V'aclav Rozhon, Michael Elkin, Christoph Grunau et al.2022 · 6 citationsarXiv
Undirected -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms2204.05874v2 · V'aclav Rozhon, Christoph Grunau, Bernhard Haeupler et al.2022 · 0 citationsarXiv
Measurable tilings by abelian group actions2203.01511v2 · Jan Greb'ik, Rachel Greenfeld, V'aclav Rozhon et al.2022 · 6 citationsarXiv
The Landscape of Distributed Complexities on Trees and Beyond2202.04724v2 · Christoph Grunau, Vaclav Rozhon, Sebastian Brandt2022 · 9 citationsarXiv
On Homomorphism Graphs2111.03683v2 · Sebastian Brandt, Yi-Jun Chang, Jan Greb'ik et al.2021 · 8 citationsForum of Mathematics, Pi 12 (2024) e10
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics2106.02066v1 · Sebastian Brandt, Yi-Jun Chang, Jan Greb'ik et al.2021 · 13 citationsarXiv
The randomized local computation complexity of the Lovász local lemma2103.16251v2 · Sebastian Brandt, Christoph Grunau, V'aclav Rozhon2021 · 9 citationsarXiv
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics2103.14112v1 · Jan Greb'ik, V'aclav Rozhon2021 · 8 citationsarXiv
Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics2103.08394v3 · Jan Greb'ik, V'aclav Rozhon2021 · 20 citationsarXiv
Improved Deterministic Network Decomposition2007.08253v1 · Mohsen Ghaffari, Christoph Grunau, V'aclav Rozhon2020 · 63 citationsarXiv
Adapting -means algorithms for outliers2007.01118v2 · Christoph Grunau, V'aclav Rozhon2020 · 1 citationarXiv
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma2006.04625v1 · Sebastian Brandt, Christoph Grunau, V'aclav Rozhon2020 · 7 citationsarXiv
Simple and sharp analysis of k-means||2003.02518v2 · V'aclav Rozhon2020 · 5 citationsarXiv
k-means++: few more steps yield constant approximation2002.07784v1 · Davin Choo, Christoph Grunau, Julian Portmann et al.2020 · 7 citationsarXiv
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization1907.10937v2 · V'aclav Rozhon, Mohsen Ghaffari2019 · 147 citationsarXiv
Cut distance identifying graphon parameters over weak* limits1809.03797v5 · Martin Dolezal, Jan Greb'ik, Jan Hladk'y et al.2018 · 8 citationsJournal of Combinatorial Theory, series A, volume 189 (2022), 105615
Relating the cut distance and the weak* topology for graphons1806.07368v3 · Martin Dolezal, Jan Greb'ik, Jan Hladk'y et al.2018 · 7 citationsJournal of Combinatorial Theory, series B, Volume 147, 2021, Pages 252-298
A local approach to the Erdős-Sós conjecture1804.06791v2 · V'aclav Rozhon2018 · 10 citationsarXiv
A version of the Loebl-Komlós-Sós conjecture for skewed trees1802.00679v1 · Tereza Klimosov'a, Diana Piguet, V'aclav Rozhon2018 · 0 citationsarXiv
Career total: 62 works. 46 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.