Simon Meierhans

Orcid: 0000-0002-9736-4745

According to our database1, Simon Meierhans authored at least 10 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bootstrapping Dynamic APSP via Sparsification.
CoRR, 2024

A Simple Dynamic Spanner via APSP.
CoRR, 2024

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.
CoRR, 2024

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2022
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Derandomizing Directed Random Walks in Almost-Linear Time.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Transformations of High-Level Synthesis Codes for High-Performance Computing.
IEEE Trans. Parallel Distributed Syst., 2021

2019
Resilient Dictionaries for Randomly Unreliable Memory.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Content Adaptive Optimization for Neural Image Compression.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019


  Loading...