bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Super Unique Tarski is in UEOPL John Fearnley Rahul Savani [github]
Reachability Switching Games John Fearnley Martin Gairing Matthias Mnich Rahul Savani [github]
Unique end of potential line John Fearnley Spencer Gordon Ruta Mehta Rahul Savani [github]
The Complexity of Gradient Descent: CLS = PPAD ąp PLS John Fearnley Paul W. Goldberg Alexandros Hollender Rahul Savani [github]
A Faster Algorithm for Finding Tarski Fixed Points John Fearnley Rahul Savani [github]
One-Clock Priced Timed Games Are PSPACE-Hard John Fearnley Rasmus Ibsen-Jensen Rahul Savani [github]
One-Clock Priced Timed Games are PSPACE-hard John Fearnley Rasmus Ibsen-Jensen Rahul Savani [github]
Inapproximability results for constrained approximate Nash equilibria Argyrios Deligkas John Fearnley Rahul Savani [github]
Unique End of Potential Line John Fearnley Spencer Gordon Ruta Mehta Rahul Savani [github]
Inapproximability Results for Approximate Nash Equilibria Argyrios Deligkas John Fearnley Rahul Savani [github]
Computing Approximate Nash Equilibria in Polymatrix Games Argyrios Deligkas John Fearnley Rahul Savani Paul Spirakis [github]
The complexity of gradient descent: CLS = PPAD ąp PLS John Fearnley Paul W. Goldberg Alexandros Hollender Rahul Savani [github]

Library Size: 13G (12 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]