default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVáclav Rozhon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2024
[b1]Václav Rozhon:
Local Complexity: New Results and Bridges to Other Fields. ETH Zurich, Zürich, Switzerland, 2024
Journal Articles
- 2022
- [j5]Martin Dolezal, Jan Grebík
, Jan Hladký, Israel Rocha, Václav Rozhon:
Cut distance identifying graphon parameters over weak* limits. J. Comb. Theory A 189: 105615 (2022) - 2021
- [j4]Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon:
Relating the cut distance and the weak* topology for graphons. J. Comb. Theory B 147: 252-298 (2021) - 2020
- [j3]Tereza Klimosová, Diana Piguet, Václav Rozhon:
A version of the Loebl-Komlós-Sós conjecture for skew trees. Eur. J. Comb. 88: 103106 (2020) - 2019
- [j2]Václav Rozhon:
A Local Approach to the Erdös-Sós Conjecture. SIAM J. Discret. Math. 33(2): 643-664 (2019) - 2017
- [j1]Tereza Klimosová, Diana Piguet, Václav Rozhon:
A skew version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. 61: 743-749 (2017)
Conference and Workshop Papers
- 2024
- [c22]Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup:
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. FOCS 2024: 658-688 - [c21]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. FOCS 2024: 2099-2130 - [c20]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon:
Fully Dynamic Consistent k-Center Clustering. SODA 2024: 3463-3484 - 2023
- [c19]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon:
Noisy k-Means++ Revisited. ESA 2023: 55:1-55:7 - [c18]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. FOCS 2023: 1551-1562 - [c17]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
A Nearly Tight Analysis of Greedy k-means++. SODA 2023: 1012-1070 - [c16]Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA 2023: 2532-2566 - [c15]Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. SODA 2023: 4409-4447 - [c14]Václav Rozhon, Bernhard Haeupler, Christoph Grunau:
A Simple Deterministic Distributed Low-Diameter Clustering. SOSA 2023: 166-174 - [c13]Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic:
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. STOC 2023: 321-334 - 2022
- [c12]Václav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler:
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. FOCS 2022: 1114-1121 - [c11]Christoph Grunau, Václav Rozhon:
Adapting k-means Algorithms for Outliers. ICML 2022: 7845-7886 - [c10]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. ITCS 2022: 29:1-29:26 - [c9]Christoph Grunau, Václav Rozhon, Sebastian Brandt:
The Landscape of Distributed Complexities on Trees and Beyond. PODC 2022: 37-47 - [c8]Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. SPAA 2022: 1-10 - [c7]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC 2022: 478-487 - 2021
- [c6]Sebastian Brandt, Christoph Grunau, Václav Rozhon:
The Randomized Local Computation Complexity of the Lovász Local Lemma. PODC 2021: 307-317 - [c5]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Improved Deterministic Network Decomposition. SODA 2021: 2904-2923 - 2020
- [c4]Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon:
k-means++: few more steps yield constant approximation. ICML 2020: 1909-1917 - [c3]Václav Rozhon:
Simple and sharp analysis of k-means||. ICML 2020: 8266-8275 - [c2]Sebastian Brandt, Christoph Grunau, Václav Rozhon:
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC 2020: 329-338 - [c1]Václav Rozhon, Mohsen Ghaffari:
Polylogarithmic-time deterministic network decomposition and distributed derandomization. STOC 2020: 350-363
Informal and Other Publications
- 2024
- [i30]Amirreza Akbari, Xavier Coiteux-Roy, Francesco D'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela:
Online Locality Meets Distributed Quantum Computing. CoRR abs/2403.01903 (2024) - [i29]Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. CoRR abs/2404.04552 (2024) - [i28]Václav Rozhon:
Invitation to Local Algorithms. CoRR abs/2406.19430 (2024) - [i27]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Bidirectional Dijkstra's Algorithm is Instance-Optimal. CoRR abs/2410.14638 (2024) - [i26]Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup:
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. CoRR abs/2410.14643 (2024) - 2023
- [i25]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon:
Noisy k-means++ Revisited. CoRR abs/2307.13685 (2023) - [i24]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram:
Fully Dynamic Consistent k-Center Clustering. CoRR abs/2307.13747 (2023) - [i23]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR abs/2311.11793 (2023) - [i22]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. CoRR abs/2311.13764 (2023) - 2022
- [i21]Christoph Grunau, Václav Rozhon, Sebastian Brandt:
The Landscape of Distributed Complexities on Trees and Beyond. CoRR abs/2202.04724 (2022) - [i20]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. CoRR abs/2204.05874 (2022) - [i19]Michael Elkin, Bernhard Haeupler, Václav Rozhon, Christoph Grunau:
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. CoRR abs/2204.08254 (2022) - [i18]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. CoRR abs/2204.09329 (2022) - [i17]Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. CoRR abs/2204.14086 (2022) - [i16]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
A Nearly Tight Analysis of Greedy k-means++. CoRR abs/2207.07949 (2022) - [i15]Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. CoRR abs/2209.11651 (2022) - [i14]Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. CoRR abs/2209.11669 (2022) - [i13]Václav Rozhon, Bernhard Haeupler, Christoph Grunau:
A Simple Deterministic Distributed Low-Diameter Clustering. CoRR abs/2210.11784 (2022) - [i12]Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic:
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. CoRR abs/2210.16351 (2022) - 2021
- [i11]Jan Grebík, Václav Rozhon:
Of Toasts and Tails. CoRR abs/2103.08394 (2021) - [i10]Jan Grebík, Václav Rozhon:
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics. CoRR abs/2103.14112 (2021) - [i9]Sebastian Brandt, Christoph Grunau, Václav Rozhon:
The randomized local computation complexity of the Lovász local lemma. CoRR abs/2103.16251 (2021) - [i8]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. CoRR abs/2106.02066 (2021) - [i7]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
On Homomorphism Graphs. CoRR abs/2111.03683 (2021) - 2020
- [i6]Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon:
k-means++: few more steps yield constant approximation. CoRR abs/2002.07784 (2020) - [i5]Václav Rozhon:
Simple and sharp analysis of k-means||. CoRR abs/2003.02518 (2020) - [i4]Sebastian Brandt, Christoph Grunau, Václav Rozhon:
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR abs/2006.04625 (2020) - [i3]Christoph Grunau, Václav Rozhon:
Adapting k-means algorithms for outliers. CoRR abs/2007.01118 (2020) - [i2]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Improved Deterministic Network Decomposition. CoRR abs/2007.08253 (2020) - 2019
- [i1]Václav Rozhon, Mohsen Ghaffari:
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. CoRR abs/1907.10937 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
