✳flâneur — a map of the web's best reading
Total Search @ STOC 2025
sites.google.com · saved by 1 readers
Total search problems naturally arise in various areas of Theoretical Computer Science. Since the 1990s, the study of total search problems has successfully characterized significant problems in game theory, optimization, and combinatorics. This workshop aims to showcase the recent progress in
Explore this link on the map →