Joshua R. Wang

I graduated from Stanford University in 2018 with a Ph.D. in Computer Science, advised by Tim Roughgarden. My current research interests include submodular functions, graph algorithms, and algorithmic game theory. You can reach me at joshw0 on Gmail.

Research Scientist at Google

Publications

2022

    • S. Ibrahimpur, M. Purohit, Z. Svitkina, E. Vee, and J. R. Wang. Caching with Reserves.
      To appear in the
      25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2022).

    • Q. C. Liu, M. Purohit, Z. Svitkina, E. Vee, and J. R. Wang. Scheduling with Communication Delay in Near-Linear Time [arXiv].
      In the 39th International Symposium on the Theoretical Aspects of Computer Science (STACS 2022).

2021

2020

    • R. Niazadeh, T. Roughgarden, and J. R. Wang. Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization [JMLR].
      Journal of Machine Learning Research (JMLR).

2019

2018

    • R. Niazadeh, T. Roughgarden, and J. R. Wang. Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization [arXiv].
      In the 32nd Conference on Neural Information Processing Systems (NeurIPS 2018).
      Oral Presentation (top 30 out of 4856 submissions).

    • T. Roughgarden and J. R. Wang. An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization [arXiv].
      In the 31st Annual Conference on Learning Theory (COLT 2018).

    • J. Alman, J. R. Wang, and H. Yu. Cell-Probe Lower Bounds from Online Communication Complexity [arXiv].
      In the 50th Annual ACM Symposium on the Theory of Computing (STOC 2018).

    • T. Roughgarden, S. Vassilvitskii, and J. R. Wang. Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) [ACM].
      Journal of the ACM (JACM).

2017

    • B. Moseley and J. R. Wang. Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-Means, and Local Search [NeurIPS Proceedings].
      In the 31st Conference on Neural Information Processing Systems (NeurIPS 2017).
      Oral Presentation (top 40 out of 3240 submissions).

2016

2015

2014

    • J. R. Wang. Space-efficient randomized algorithms for k-sum.
      In the 22nd Annual European Symposium on Algorithms (ESA 2014).
      Best student paper award.