Joshua R. Wang

Google (United States) — United States

Computer Science · Physical Sciences

12h-index407citations34works1.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(17), Optimization and Search Problems(12), Auction Theory and Applications(7), Cryptography and Data Security(6), Advanced Graph Theory Research(5)

Publications34 total

Non-preemptive Throughput Maximization under Time-varying Capacity
2025Open Access
Prior-Free Mechanism with Welfare Guarantees
2024
Contracting with a Learning Agent
arXiv (Cornell University)·2024· 1 citedOpen Access
Contracting with a Learning Agent
2024· 4 cited
New Tools for Peak Memory Scheduling
arXiv (Cornell University)·2023· 1 citedOpen Access
A PnP Algorithm for Two-Dimensional Pose Estimation
arXiv (Cornell University)·2023Open Access
The Power of Menus in Contract Design
2023· 5 citedOpen Access
Efficient Caching with Reserves via Marking
arXiv (Cornell University)·2023Open Access
Margin-Independent Online Multiclass Learning via Convex Geometry
arXiv (Cornell University)·2021Open Access
Scheduling with Communication Delay in Near-Linear Time
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
2021· 12 cited
Contracts under Moral Hazard and Adverse Selection
2021· 24 citedOpen Access
Minimizing Regret with Multiple Reserves
ACM Transactions on Economics and Computation·2019· 11 citedOpen Access
Recursive Sketches for Modular Deep Learning
arXiv (Cornell University)·2019· 2 citedOpen Access
Efficient Rematerialization for Deep Networks
Neural Information Processing Systems·2019· 20 cited
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
Journal of the ACM·2018· 32 citedOpen Access
On the Computational Power of Online Gradient Descent
arXiv (Cornell University)·2018Open Access
Cell-probe lower bounds from online communication complexity
2018Open Access
An Optimal Algorithm for Online Unconstrained Submodular Maximization
arXiv (Cornell University)·2018· 5 citedOpen Access
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
arXiv (Cornell University)·2018· 23 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Tim Roughgarden(9), Jon Schneider(6), Ryan Williams(5), Guru Guruganesh(5), Manish Purohit(5), Zoya Svitkina(5), Erik Vee(5), Virginia Vassilevska Williams(4), Huacheng Yu(4), Rad Niazadeh(3), Sergei Vassilvitskii(2), Yoav Kolumbus(2), Inbal Talgam-Cohen(2), Emmanouil-Vasileios Vlatakis-Gkaragkounis(2), S. Matthew Weinberg(2), Josh Alman(2), Benjamin Moseley(1), Ravi Kumar(1), Amir Abboud(1), Negin Golrezaei(1)