Webpage of Chris Schwiegelshohn

Ciao, Welcome, Willkommen!

I am a member of the DIAG faculty of Sapienza University. I completed my PhD in 2017 under the supervision of Christian Sohler at TU Dortmund and have been living in Italy since.

I work mostly on algorithm design, with a focus on learning, streaming, and online algorithms.

Some of my favorite papers include:

  • Oblivious Dimension Reduction for k-Means -- Beyond Subspaces and the Johnson-Lindenstrauss Lemma, STOC 2019. With Luca Becchetti, Marc Bury, Vincent Cohen-Addad, and Fabrizio Grandoni.
If you are interested in this work, you may also want to read the paper by Makarychev, Makarychev, and Razenshteyn. Independently from us, they obtained essentially optimal bounds for the same problem.
  • (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time, SODA 2019. With Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, and Shay Solomon.
  • On the Local Structure of Stable Clustering Instances, FOCS 2017. With Vincent Cohen-Addad.
  • Sublinear Estimation of Weighted Matchings in Dynamic Data Streams, ESA 2015. With Marc Bury.
Follow up work with Elena, Andrew, Morteza, Sofya, and Samson improved and significantly extended the content.

A complete list of publications can be found here.

If you are a student, you may want to look here.