default search action
Christoph Grunau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. ESA 2024: 13:1-13:15 - [c29]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon:
Fully Dynamic Consistent k-Center Clustering. SODA 2024: 3463-3484 - [c28]Mohsen Ghaffari
, Christoph Grunau
Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time. STOC 2024: 1184-1191 - [c27]Mohsen Ghaffari
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. STOC 2024: 1889-1900 - 2023
- [c26]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon:
Noisy k-Means++ Revisited. ESA 2023: 55:1-55:7 - [c25]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. FOCS 2023: 1551-1562 - [c24]Christoph Grunau
A Nearly Tight Analysis of Greedy k-means++. SODA 2023: 1012-1070 - [c23]Mohsen Ghaffari, Christoph Grunau
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA 2023: 2532-2566 - [c22]Salwa Faour, Mohsen Ghaffari, Christoph Grunau
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. SODA 2023: 4409-4447 - [c21]Václav Rozhon, Bernhard Haeupler, Christoph Grunau
A Simple Deterministic Distributed Low-Diameter Clustering. SOSA 2023: 166-174 - [c20]Manuela Fischer
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. SPAA 2023: 89-100 - [c19]Mohsen Ghaffari, Christoph Grunau
Nearly Work-Efficient Parallel DFS in Undirected Graphs. SPAA 2023: 273-283 - [c18]Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. STOC 2023: 321-334 - [c17]Mohsen Ghaffari, Christoph Grunau
Faster Deterministic Distributed MIS and Approximate Matching. STOC 2023: 1777-1790 - [c16]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto
Conditionally Optimal Parallel Coloring of Forests. DISC 2023: 23:1-23:20 - [i30]Jeff Giliberti, Manuela Fischer, Christoph Grunau:
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. CoRR abs/2301.11205 (2023) - [i29]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. CoRR abs/2303.00811 (2023) - [i28]Mohsen Ghaffari, Christoph Grunau:
Faster Deterministic Distributed MIS and Approximate Matching. CoRR abs/2303.16043 (2023) - [i27]Mohsen Ghaffari, Christoph Grunau, Jiahao Qu:
Nearly Work-Efficient Parallel DFS in Undirected Graphs. CoRR abs/2304.09774 (2023) - [i26]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon:
Noisy k-means++ Revisited. CoRR abs/2307.13685 (2023) - [i25]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram:
Fully Dynamic Consistent k-Center Clustering. CoRR abs/2307.13747 (2023) - [i24]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. CoRR abs/2308.00355 (2023) - [i23]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. CoRR abs/2311.13764 (2023) - [i22]Mohsen Ghaffari, Christoph Grunau:
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. CoRR abs/2311.13771 (2023) - 2022
- [c15]Václav Rozhon, Michael Elkin, Christoph Grunau
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. FOCS 2022: 1114-1121 - [c14]Christoph Grunau
Adapting k-means Algorithms for Outliers. ICML 2022: 7845-7886 - [c13]Sebastian Brandt, Yi-Jun Chang
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. ITCS 2022: 29:1-29:26 - [c12]Christoph Grunau
The Landscape of Distributed Complexities on Trees and Beyond. PODC 2022: 37-47 - [c11]Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. SPAA 2022: 1-10 - [c10]Mohsen Ghaffari, Christoph Grunau
Massively Parallel Algorithms for b-Matching. SPAA 2022: 35-44 - [c9]Václav Rozhon, Christoph Grunau
Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC 2022: 478-487 - [c8]Manuela Fischer, Jeff Giliberti, Christoph Grunau
Improved Deterministic Connectivity in Massively Parallel Computation. DISC 2022: 22:1-22:17 - [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]Manuela Fischer, Jeff Giliberti, Christoph Grunau:
Improved Deterministic Connectivity in Massively Parallel Computation. CoRR abs/2206.01568 (2022) - [i15]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
A Nearly Tight Analysis of Greedy k-means++. CoRR abs/2207.07949 (2022) - [i14]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) - [i13]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) - [i12]Václav Rozhon, Bernhard Haeupler, Christoph Grunau:
A Simple Deterministic Distributed Low-Diameter Clustering. CoRR abs/2210.11784 (2022) - [i11]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) - [i10]Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrovic:
Massively Parallel Algorithms for b-Matching. CoRR abs/2211.07796 (2022) - 2021
- [c7]Sebastian Brandt
The Randomized Local Computation Complexity of the Lovász Local Lemma. PODC 2021: 307-317 - [c6]Mohsen Ghaffari, Christoph Grunau
Improved Deterministic Network Decomposition. SODA 2021: 2904-2923 - [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
- [c5]Davin Choo, Christoph Grunau
k-means++: few more steps yield constant approximation. ICML 2020: 1909-1917 - [c4]Sebastian Brandt
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC 2020: 329-338 - [c3]Christoph Grunau
Improved Local Computation Algorithm for Set Cover via Sparsification. SODA 2020: 2993-3011 - [c2]Mohsen Ghaffari, Christoph Grunau
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC 2020: 34:1-34:18 - [i6]Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon:
k-means++: few more steps yield constant approximation. CoRR abs/2002.07784 (2020) - [i5]Mohsen Ghaffari, Christoph Grunau, Ce Jin:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. CoRR abs/2002.09610 (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)
2010 – 2019
- 2019
- [i1]Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian:
Improved Local Computation Algorithm for Set Cover via Sparsification. CoRR abs/1910.14154 (2019) - 2018
- [j5]Ingo Bulla, Benoît Aliaga
Notos - a galaxy tool to analyze CpN observed expected ratios for inferring DNA methylation types. BMC Bioinform. 19(1): 105:1-105:13 (2018)
2000 – 2009
- 2004
- [j4]Vincent Nègre, Christoph Grunau
eL-DASionator: an LDAS upload file generator. BMC Bioinform. 5: 55 (2004) - 2003
- [j3]Céline Amoreira, Winfried Hindermann, Christoph Grunau
An improved version of the DNA methylation database (MethDB). Nucleic Acids Res. 31(1): 75-77 (2003) - 2001
- [j2]Christoph Grunau
MethDB - a public database for DNA methylation data. Nucleic Acids Res. 29(1): 270-274 (2001) - [j1]Christoph Grunau
Bisulfite genomic sequencing: systematic investigation of critical experimental parameters. Nucleic Acids Res. 29(13): 65 (2001)
1990 – 1999
- 1998
- [c1]M. Schilling, Christoph Grunau, André Rosenthal:
MethDB - a relational DNA-Methylation-Database. German Conference on Bioinformatics 1998
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-10-07 21:24 CEST 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: