John Fearnley
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
30
Venues
14
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
30 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2025 | STOC | Monotone Contractions. | Eleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani |
| 2024 | ICALP | Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. | Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber |
| 2024 | STOC | The Complexity of Computing KKT Solutions of Quadratic Programs. | John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani |
| 2023 | AAAI | Tight Inapproximability for Graphical Games. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2022 | AAAI | Pizza Sharing Is PPA-Hard. | Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos |
| 2022 | FOCS | Pure-Circuit: Strong Inapproximability for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2022 | STOC | Constant inapproximability for PPA. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2021 | STOC | The complexity of gradient descent: CLS = PPAD ∩ PLS. | John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani |
| 2021 | STACS | A Faster Algorithm for Finding Tarski Fixed Points. | John Fearnley, Rahul Savani |
| 2020 | ICALP | Tree Polymatrix Games Are PPAD-Hard. | Argyrios Deligkas, John Fearnley, Rahul Savani |
| 2020 | LICS | One-Clock Priced Timed Games are PSPACE-hard. | John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani |
| 2019 | ICALP | Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. | Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis |
| 2019 | ICALP | Unique End of Potential Line. | John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani |
| 2018 | ICALP | Reachability Switching Games. | John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani |
| 2018 | SAGT | An Improved Envy-Free Cake Cutting Protocol for Four Agents. | Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou |
| 2017 | CAV | Efficient Parallel Strategy Improvement for Parity Games. | John Fearnley |
| 2017 | SAGT | Computing Constrained Approximate Equilibria in Polymatrix Games. | Argyrios Deligkas, John Fearnley, Rahul Savani |
| 2016 | SODA | The Complexity of All-switches Strategy Improvement. | John Fearnley, Rahul Savani |
| 2016 | SAGT | Lipschitz Continuity and Approximate Equilibria. | Argyrios Deligkas, John Fearnley, Paul G. Spirakis |
| 2015 | STOC | The Complexity of the Simplex Method. | John Fearnley, Rahul Savani |
| 2013 | ICALP | Reachability in Two-Clock Timed Automata Is PSPACE-Complete. | John Fearnley, Marcin Jurdzinski |
| 2012 | ATVA | Synthesis of Succinct Systems. | John Fearnley, Doron A. Peled, Sven Schewe |
| 2012 | CSL | Bounded Satisfiability for PCTL. | Nathalie Bertrand, John Fearnley, Sven Schewe |
| 2012 | ICALP | Time and Parallelizability Results for Parity Games with Bounded Treewidth. | John Fearnley, Sven Schewe |
| 2012 | SAGT | Approximate Well-Supported Nash Equilibria Below Two-Thirds. | John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Srensen |
| 2011 | MFCS | Parity Games on Graphs with Medium Tree-Width. | John Fearnley, Oded Lachish |
| 2010 | ICALP | Exponential Lower Bounds for Policy Iteration. | John Fearnley |
| 2010 | LPAR | Non-oblivious Strategy Improvement. | John Fearnley |
| 2010 | SOFSEM | Linear Complementarity Algorithms for Infinite Games. | John Fearnley, Marcin Jurdzinski, Rahul Savani |