| 2026 | ICDCS | Hash-Based Asynchronous MVBA with Optimal Complexity and Near-Optimal Resilience. | Jovan Komatovic, Joachim Neu, Tim Roughgarden |
| 2025 | AFT | From Permissioned to Proof-of-Stake Consensus. | Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Ertem Nusret Tas |
| 2025 | AFT | Beyond Optimal Fault-Tolerance. | Andrew Lewis-Pye, Tim Roughgarden |
| 2025 | CCS | Accountable Liveness. | Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca Zanolini |
| 2025 | FC | Transaction Fee Mechanism Design for Leaderless Blockchain Protocols. | Pranav Garimidi, Lioba Heimbach, Tim Roughgarden |
| 2024 | AFT | Transaction Fee Mechanism Design in a Post-MEV World. | Maryam Bahrani, Pranav Garimidi, Tim Roughgarden |
| 2024 | COLT | Online Stackelberg Optimization via Nonlinear Control. | William Brown, Christos H. Papadimitriou, Tim Roughgarden |
| 2024 | FC | Transaction Fee Mechanism Design with Active Block Producers. | Maryam Bahrani, Pranav Garimidi, Tim Roughgarden |
| 2024 | FC | Centralization in Block-Building and Proposer-Builder Separation. | Maryam Bahrani, Pranav Garimidi, Tim Roughgarden |
| 2024 | FC | Automated Market Making and Arbitrage Profits in the Presence of Fees. | Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden |
| 2024 | PODC | Keynote: Provable Slashing Guarantees. | Tim Roughgarden |
| 2024 | STOC | The Computer in the Sky (Keynote). | Tim Roughgarden |
| 2023 | AFT | When Bidders Are DAOs. | Maryam Bahrani, Pranav Garimidi, Tim Roughgarden |
| 2023 | FC | Byzantine Generals in the Permissionless Setting. | Andrew Lewis-Pye, Tim Roughgarden |
| 2023 | FC | Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs. | Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden |
| 2023 | FC | Extended Abstract: The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers. | Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden |
| 2023 | ICML | Formalizing Preferences Over Runtime Distributions. | Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden |
| 2022 | AAAI | Strictly Proper Contract Functions Can Be Arbitrage-Free. | Eric Neyman, Tim Roughgarden |
| 2022 | CCS | Quantifying Loss in Automated Market Makers. | Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden, Anthony Lee Zhang |
| 2021 | CCS | How Does Blockchain Security Dictate Blockchain Implementation? | Andrew Lewis-Pye, Tim Roughgarden |
| 2021 | FC | Ignore the Extra Zeroes: Variance-Optimal Mining Pools. | Tim Roughgarden, Clara Shikhelman |
| 2021 | FOCS | Smoothed Analysis with Adaptive Adversaries. | Nika Haghtalab, Tim Roughgarden, Abhishek Shetty |
| 2020 | SODA | The Complexity of Contracts. | Paul Dtting, Tim Roughgarden, Inbal Talgam-Cohen |
| 2019 | AFT | An Axiomatic Approach to Block Rewards. | Xi Chen, Christos H. Papadimitriou, Tim Roughgarden |
| 2019 | COLT | On the Computational Power of Online Gradient Descent. | Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang |
| 2019 | EC | Simple versus Optimal Contracts. | Paul Dtting, Tim Roughgarden, Inbal Talgam-Cohen |
| 2019 | SODA | Communication Complexity of Discrete Fair Division. | Benjamin Plaut, Tim Roughgarden |
| 2018 | COLT | An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. | Tim Roughgarden, Joshua R. Wang |
| 2018 | ICALP | Finding Cliques in Social Networks: A New Distribution-Free Model. | Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein |
| 2018 | SODA | Almost Envy-Freeness with General Valuations. | Benjamin Plaut, Tim Roughgarden |
| 2017 | ESA | Stability and Recovery for Independence Systems. | Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrk |
| 2017 | STOC | Why prices need algorithms (invited talk). | Tim Roughgarden, Inbal Talgam-Cohen |
| 2016 | COLT | Learning Simple Auctions. | Jamie Morgenstern, Tim Roughgarden |
| 2016 | ESA | The Complexity of the k-means Method. | Tim Roughgarden, Joshua R. Wang |
| 2016 | FC | Incentive Compatibility of Bitcoin Mining Pool Reward Functions. | Okke Schrijvers, Joseph Bonneau, Dan Boneh, Tim Roughgarden |
| 2016 | FOCS | On the Communication Complexity of Approximate Fixed Points. | Tim Roughgarden, Omri Weinstein |
| 2016 | IJCAI | Why Prices Need Algorithms. | Tim Roughgarden, Inbal Talgam-Cohen |
| 2016 | STOC | The price of anarchy in large games. | Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis |
| 2016 | SPAA | Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). | Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang |
| 2015 | ICML | How Hard is Inference for Structured Prediction? | Amir Globerson, Tim Roughgarden, David A. Sontag, Cafer Yildirim |
| 2014 | FOCS | Barriers to Near-Optimal Equilibria. | Tim Roughgarden |
| 2014 | ICALP | Privately Solving Linear Programs. | Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan R. Ullman |
| 2014 | STOC | The sample complexity of revenue maximization. | Richard Cole, Tim Roughgarden |
| 2014 | STOC | Private matchings and allocations. | Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu |
| 2014 | SAGT | Network Cost-Sharing without Anonymity. | Tim Roughgarden, Okke Schrijvers |
| 2012 | ICALP | Preventing Unraveling in Social Networks: The Anchored k-Core Problem. | Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma |
| 2012 | SODA | Sketching valuation functions. | Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden |
| 2012 | STOC | Prior-free auctions with ordered bidders. | Stefano Leonardi, Tim Roughgarden |
| 2011 | ICALP | Restoring Pure Equilibria to Weighted Congestion Games. | Konstantinos Kollias, Tim Roughgarden |
| 2011 | IJCAI | Flexible Tree Matching. | Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer |
| 2011 | SODA | Welfare Guarantees for Combinatorial Auctions with Item Bidding. | Kshipra Bhawalkar, Tim Roughgarden |
| 2011 | SODA | Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. | Tim Roughgarden, Florian Schoppmann |
| 2011 | STOC | From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. | Shaddin Dughmi, Tim Roughgarden, Qiqi Yan |
| 2010 | ESA | Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. | Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden |
| 2010 | FOCS | Black-Box Randomized Reductions in Algorithmic Mechanism Design. | Shaddin Dughmi, Tim Roughgarden |
| 2010 | STOC | Interactive privacy via the median mechanism. | Aaron Roth, Tim Roughgarden |
| 2009 | ICALP | Worst-Case Efficiency Analysis of Queueing Disciplines. | Damon Mosk-Aoyama, Tim Roughgarden |
| 2009 | INFOCOM | Lightweight Coloring and Desynchronization for Networks. | Arik Motskin, Tim Roughgarden, Primoz Skraba, Leonidas J. Guibas |
| 2009 | STOC | Universally utility-maximizing privacy mechanisms. | Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan |
| 2009 | STOC | Intrinsic robustness of the price of anarchy. | Tim Roughgarden |
| 2008 | FOCS | Truthful Approximation Schemes for Single-Parameter Agents. | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
| 2008 | SODA | Designing networks with good equilibria. | Ho-Lin Chen, Tim Roughgarden, Gregory Valiant |
| 2008 | SODA | Metric clustering via consistent labeling. | Robert Krauthgamer, Tim Roughgarden |
| 2008 | STOC | Optimal mechanism design and money burning. | Jason D. Hartline, Tim Roughgarden |
| 2008 | SAGT | Bertrand Competition in Networks. | Shuchi Chawla, Tim Roughgarden |
| 2008 | SAGT | Is Shapley Cost Sharing Optimal? | Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan |
| 2007 | IPCO | Optimal Efficiency Guarantees for Network Design Mechanisms. | Tim Roughgarden, Mukund Sundararajan |
| 2006 | INFOCOM | Routers with Very Small Buffers. | Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden |
| 2006 | SODA | Bottleneck links, variable demand, and the tragedy of the commons. | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
| 2006 | STOC | New trade-offs in cost-sharing mechanisms. | Tim Roughgarden, Mukund Sundararajan |
| 2006 | SPAA | Network design with weighted players. | Ho-Lin Chen, Tim Roughgarden |
| 2005 | ICALP | Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. | Henry C. Lin, Tim Roughgarden, va Tardos, Asher Walkover |
| 2005 | SODA | Computing equilibria in multi-player games. | Christos H. Papadimitriou, Tim Roughgarden |
| 2005 | SODA | Selfish routing with atomic players. | Tim Roughgarden |
| 2004 | FOCS | The Price of Stability for Network Design with Fair Cost Allocation. | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, va Tardos, Tom Wexler, Tim Roughgarden |
| 2004 | SODA | A stronger bound on Braess's Paradox. | Henry C. Lin, Tim Roughgarden, va Tardos |
| 2004 | SODA | The maximum latency of selfish routing. | Tim Roughgarden |
| 2003 | FOCS | Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. | Anupam Gupta, Amit Kumar, Martin Pl, Tim Roughgarden |
| 2003 | STOC | Pricing network edges for heterogeneous selfish users. | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
| 2003 | STOC | Simpler and better approximation algorithms for network design. | Anupam Gupta, Amit Kumar, Tim Roughgarden |
| 2002 | FOCS | A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. | Amit Kumar, Anupam Gupta, Tim Roughgarden |
| 2002 | SODA | How unfair is optimal routing? | Tim Roughgarden |
| 2002 | STOC | The price of anarchy is independent of the network topology. | Tim Roughgarden |
| 2001 | FOCS | Designing Networks for Selfish Users is Hard. | Tim Roughgarden |
| 2001 | IPCO | Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. | Fabin A. Chudak, Tim Roughgarden, David P. Williamson |
| 2001 | STOC | Stackelberg scheduling strategies. | Tim Roughgarden |
| 2000 | FOCS | How Bad is Selfish Routing? | Tim Roughgarden, va Tardos |