Æȷοì
Joshua R. Wang
Joshua R. Wang
Google
cs.stanford.eduÀÇ À̸ÞÀÏ È®ÀÎµÊ - ȨÆäÀÌÁö
Á¦¸ñ
Àοë
Àοë
¿¬µµ
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
A Abboud, VV Williams, J Wang
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete ¡¦, 2016
1942016
Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search
B Moseley, JR Wang
Journal of Machine Learning Research 24 (1), 1-36, 2023
1272023
Shuffles and circuits (on lower bounds for modern parallel computation)
T Roughgarden, S Vassilvitskii, JR Wang
Journal of the ACM (JACM) 65 (6), 1-24, 2018
912018
Minimizing regret with multiple reserves
T Roughgarden, JR Wang
ACM Transactions on Economics and Computation (TEAC) 7 (3), 1-18, 2019
712019
Finding four-node subgraphs in triangle time
VV Williams, JR Wang, R Williams, H Yu
Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete ¡¦, 2014
712014
Optimal algorithms for continuous non-monotone submodular and dr-submodular maximization
R Niazadeh, T Roughgarden, JR Wang
Journal of Machine Learning Research 21 (125), 1-31, 2020
552020
Efficient rematerialization for deep networks
R Kumar, M Purohit, Z Svitkina, E Vee, J Wang
Advances in Neural Information Processing Systems 32, 2019
452019
Deterministic Time-Space Tradeoffs for k-SUM
A Lincoln, VV Williams, JR Wang, RR Williams
arXiv preprint arXiv:1605.07285, 2016
412016
Contracts under moral hazard and adverse selection
G Guruganesh, J Schneider, JR Wang
Proceedings of the 22nd ACM Conference on Economics and Computation, 563-582, 2021
372021
Online learning via offline greedy algorithms: Applications in market design and optimization
R Niazadeh, N Golrezaei, JR Wang, F Susan, A Badanidiyuru
Proceedings of the 22nd ACM Conference on Economics and Computation, 737-738, 2021
362021
An optimal learning algorithm for online unconstrained submodular maximization
T Roughgarden, JR Wang
Conference On Learning Theory, 1307-1325, 2018
252018
Space-efficient randomized algorithms for K-SUM
JR Wang
European Symposium on Algorithms, 810-829, 2014
212014
The Complexity of the k-means Method
T Roughgarden, JR Wang
24th Annual European Symposium on Algorithms (ESA 2016), 2016
122016
Online learning via offline greedy: Applications in market design and optimization
R Niazadeh, N Golrezaei, J Wang, F Susan, A Badanidiyuru
102020
On the computational power of online gradient descent
V Chatziafratis, T Roughgarden, JR Wang
Conference on Learning Theory, 624-662, 2019
62019
Cell-probe lower bounds from online communication complexity
J Alman, JR Wang, H Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing ¡¦, 2018
52018
Scheduling with communication delay in near-linear time
QC Liu, M Purohit, Z Svitkina, E Vee, JR Wang
arXiv preprint arXiv:2108.02770, 2021
22021
Exact Algorithms and Strong Exponential Time Hypothesis.
JR Wang, RR Williams
Encyclopedia of Algorithms, 657-661, 2016
22016
Margin-Independent Online Multiclass Learning via Convex Geometry
G Guruganesh, A Liu, J Schneider, J Wang
Advances in Neural Information Processing Systems 34, 29156-29167, 2021
2021
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–19