# Joshua R. Wang

According to our database

Collaborative distances:

^{1}, Joshua R. Wang authored at least 22 papers between 2014 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Recursive Sketches for Modular Deep Learning.

CoRR, 2019

Recursive Sketches for Modular Deep Learning.

Proceedings of the 36th International Conference on Machine Learning, 2019

On the Computational Power of Online Gradient Descent.

Proceedings of the Conference on Learning Theory, 2019

2018

Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation).

J. ACM, 2018

On the Computational Power of Online Gradient Descent.

CoRR, 2018

An Optimal Algorithm for Online Unconstrained Submodular Maximization.

CoRR, 2018

Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.

CoRR, 2018

Cell-probe lower bounds from online communication complexity.

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization.

Proceedings of the Conference On Learning Theory, 2018

2017

Cell-Probe Lower Bounds from Online Communication Complexity.

Electronic Colloquium on Computational Complexity (ECCC), 2017

Cell-Probe Lower Bounds from Online Communication Complexity.

CoRR, 2017

2016

Exact Algorithms and Strong Exponential Time Hypothesis.

Encyclopedia of Algorithms, 2016

Deterministic Time-Space Tradeoffs for k-SUM.

CoRR, 2016

Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation).

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minimizing Regret with Multiple Reserves.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Deterministic Time-Space Trade-Offs for k-SUM.

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Complexity of the k-means Method.

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter.

CoRR, 2015

Finding Four-Node Subgraphs in Triangle Time.

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Space-Efficient Randomized Algorithms for K-SUM.

Proceedings of the Algorithms - ESA 2014, 2014