Picture of Simon Meierhans in Italy

About

I'm a computer science PhD student in the group of Rasmus Kyng at the Department of Computer Science, ETH Zurich.

My interests lie in the realm of algorithm design & analysis and optimization. In particular, I am fascinated by fast graph algorithms and their relations to linear algebra. During my Bachelor and Master studies I dabbled in other fields, such as deep learning and high performance computing, and I have very broad interests in general.

In fall 2023 I was a visitor at the Data Structures and Optimization for Fast Algorithms program at the Simons Institute in Berkeley, California.

I was awarded the ETH Medal for my Master Thesis on Incremental Single Source Shortest Paths supervised by Maximilian Probst Gutenberg and Rasmus Kyng.

My pronouns are he/him.

Papers

I maintain a Google Scholar profile listing the articles I contributed to. The ones made available on arXiv are openly accessible.

  • Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Maximum & Minimum-Cost Flow
    with Li Chen, Rasmus Kyng, Yang P. Liu and Maximilian Probst Gutenberg
    [arXiv][STOC'24]
    Featured in Simons Institute Newsletter by Nikhil Srivastava.
  • A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
    with Rasmus Kyng and Maximilian Probst Gutenberg
    [arXiv][STOC'24]
  • Derandomizing Directed Random Walks in Almost-Linear Time
    with Rasmus Kyng and Maximilian Probst Gutenberg
    [arXiv][FOCS'22]
  • Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier
    with Rasmus Kyng and Maximilian Probst Gutenberg
    [arXiv][SODA'22]
  • Content adaptive optimization for neural image compression
    with Joaquim Campos, Abdelaziz Djelouah and Christopher Schroers
    [arXiv] [CVPR Workshop and Challenge on Learned Image Compression'19]
    Joaquim features an accessible and elegant exposition of this result and related work on his website.
  • Resilient Dictionaries for Randomly Unreliable Memory
    with Stefano Leucci and Chih-Hung Liu
    [ESA'19]
  • Transformations of high-level synthesis codes for high-performance computing
    with Johannnes de Fine Licht, Maciej Besta and Torsten Hoefler
    [arXiv][TPDS][code]

Talks

  • Partial Symmetrization for Eulerian Laplacians, Informal Blackboard Talk @Simons Institute
  • Derandomizing Directed Random Walks in Almost-Linear Time @FOCS22
  • Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier @SODA22
  • Resilient Dictionaries for Randomly Unreliable Memory @ESA19

Contact

You can reach me by email at:

  • firstname.lastname@inf.ethz.ch