hsfzLZH1's Homepage
2026
- Sampling and counting contingency tables with arbitrary margins
- Uniform sparsest cut hardness and semidefinite gaps
- Almost-linear-time exact matching in general graphs
- Unbounded bin-packing gaps and the modified integer round-up conjecture
- The Courtade–Kumar and Hellinger conjectures
- Trace reconstruction: how many incomplete copies reveal a string?
- Almost-linear expected-time approximation of edit distance
- Three-machine scheduling: exact optimization with precedence constraints
- Metric k-median: approaching the sharp approximation threshold
- Perfect matching: why exact semidefinite descriptions must be large