Christoph Grunau

CoRR, 2023

Fully Dynamic Consistent k-Center Clustering.

[BibT_eX]

[DOI]

CoRR, 2023

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights.

[BibT_eX]

[DOI]

CoRR, 2023

Conditionally Optimal Parallel Coloring of Forests.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Faster Deterministic Distributed MIS and Approximate Matching.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs.

[BibT_eX]

[DOI]

Manuela Fischer

Jeff Giliberti

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Nearly Work-Efficient Parallel DFS in Undirected Graphs.

[BibT_eX]

[DOI]

Jiahao Qu

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

A Simple Deterministic Distributed Low-Diameter Clustering.

[BibT_eX]

[DOI]

Bernhard Haeupler

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

A Nearly Tight Analysis of Greedy k-means++.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Noisy k-Means++ Revisited.

[BibT_eX]

[DOI]

Ahmet Alper Özüdogru

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees.

[BibT_eX]

[DOI]

CoRR, 2022

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Deterministic Connectivity in Massively Parallel Computation.

[BibT_eX]

[DOI]

Manuela Fischer

Jeff Giliberti

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Undirected (1+<i>ε</i>)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Massively Parallel Algorithms for b-Matching.

[BibT_eX]

[DOI]

Slobodan Mitrovic

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

The Landscape of Distributed Complexities on Trees and Beyond.

[BibT_eX]

[DOI]

Sebastian Brandt

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.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Adapting k-means Algorithms for Outliers.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

On Homomorphism Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Improved Deterministic Network Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

The Randomized Local Computation Complexity of the Lovász Local Lemma.

[BibT_eX]

[DOI]

Sebastian Brandt

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond.

[BibT_eX]

[DOI]

Ce Jin

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Improved Local Computation Algorithm for Set Cover via Sparsification.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma.

[BibT_eX]

[DOI]

Sebastian Brandt

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

k-means++: few more steps yield constant approximation.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2018

Notos - a galaxy tool to analyze CpN observed expected ratios for inferring DNA methylation types.

[BibT_eX]

[DOI]

BMC Bioinform., 2018

2004

eL-DASionator: an LDAS upload file generator.

[BibT_eX]

[DOI]

Vincent Nègre

BMC Bioinform., 2004

2003

An improved version of the DNA methylation database (MethDB).

[BibT_eX]

[DOI]

Céline Amoreira

Winfried Hindermann

Nucleic Acids Res., 2003

2001

MethDB - a public database for DNA methylation data.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2001

Bisulfite genomic sequencing: systematic investigation of critical experimental parameters.

[BibT_eX]

[DOI]

S. J. Clark

André Rosenthal

Nucleic Acids Res., 2001

1998

MethDB - a relational DNA-Methylation-Database.

[BibT_eX]

M. Schilling