Michael Mitzenmacher blogs about SODA, SOSA, ALENEX, and ANALCO: mybiasedcoin.blogspot.com/2019

Michael was PC co-chair of SOSA (simplicityinalgorithms.com/), which I was skeptical about (shouldn't all the best algorithms be simple?), but the session I attended favorably impressed me. Here's an example, a simple algorithm for 2-approximating maximum genus oriented graph embedding (arxiv.org/abs/1501.07460): greedily remove 2-edge paths while preserving connectivity. ≤ max genus ≤ 2⋅.

A Mastodon instance for maths people. The kind of people who make $\pi z^2 \times a$ jokes.

Use $ and $ for inline LaTeX, and $ and $ for display mode.