| 2025 | SPAA | Non-preemptive Throughput Maximization under Time-varying Capacity. | Aniket Murhekar, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2024 | WWW | Prior-Free Mechanism with Welfare Guarantees. | Guru Guruganesh, Jon Schneider, Joshua R. Wang |
| 2023 | ICALP | Efficient Caching with Reserves via Marking. | Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2022 | STACS | Scheduling with Communication Delay in Near-Linear Time. | Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2019 | COLT | On the Computational Power of Online Gradient Descent. | Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang |
| 2019 | ICML | Recursive Sketches for Modular Deep Learning. | Badih Ghazi, Rina Panigrahy, Joshua R. Wang |
| 2018 | COLT | An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. | Tim Roughgarden, Joshua R. Wang |
| 2018 | STOC | Cell-probe lower bounds from online communication complexity. | Josh Alman, Joshua R. Wang, Huacheng Yu |
| 2016 | ESA | The Complexity of the k-means Method. | Tim Roughgarden, Joshua R. Wang |
| 2016 | ICALP | Deterministic Time-Space Trade-Offs for k-SUM. | Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams |
| 2016 | SODA | Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. | Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang |
| 2016 | SPAA | Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). | Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang |
| 2015 | SODA | Finding Four-Node Subgraphs in Triangle Time. | Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu |
| 2014 | ESA | Space-Efficient Randomized Algorithms for K-SUM. | Joshua R. Wang |