( en | de | ru )

 

Disambiguation of "Grunau, Christoph"

Author of the publication

copydeleteadd this publication to your clipboard
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.

, , , , , and . ITCS, volume 215 of LIPIcs, page 29:1-29:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christoph Grunau

Hans-Christoph Grunau

Hans-Christoph Grunau

Gert Grunau

Herbert Grunau

 

Other publications of authors with the same name

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization., , , , and . SODA, page 2532-2566. SIAM, (2023)Conditionally Optimal Parallel Coloring of Forests., , , , and . DISC, volume 281 of LIPIcs, page 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond., , and . DISC, volume 179 of LIPIcs, page 34:1-34:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights., , , , , , , and . ESA, volume 308 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)MethDB - a relational DNA-Methylation-Database., , and . German Conference on Bioinformatics, Oxford University Press, (1998)Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping., and . CoRR, (2023)Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances., , , , and . STOC, page 321-334. ACM, (2023)k-means++: few more steps yield constant approximation., , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 1909-1917. PMLR, (2020)Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma., , and . PODC, page 329-338. ACM, (2020)Improved Deterministic Connectivity in Massively Parallel Computation., , and . DISC, volume 246 of LIPIcs, page 22:1-22:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)