Sledovat
Di Wang
Di Wang
Google Research
E-mailová adresa ověřena na: eecs.berkeley.edu - Domovská stránka
Název
Citace
Citace
Rok
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances
J Van Den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, ...
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
802021
Local flow partitioning for faster edge connectivity
M Henzinger, S Rao, D Wang
SIAM Journal on Computing 49 (1), 1-36, 2020
772020
Expander decomposition and pruning: Faster, stronger, and simpler
T Saranurak, D Wang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
742019
Bipartite matching in nearly-linear time on moderately dense graphs
J van den Brand, YT Lee, D Nanongkai, R Peng, T Saranurak, A Sidford, ...
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
712020
Unified acceleration method for packing and covering problems via diameter reduction
D Wang, S Rao, MW Mahoney
arXiv preprint arXiv:1508.02439, 2015
352015
On the security of trustee-based social authentications
NZ Gong, D Wang
IEEE transactions on information forensics and security 9 (8), 1251-1263, 2014
352014
Capacity releasing diffusion for speed and locality
D Wang, K Fountoulakis, M Henzinger, MW Mahoney, S Rao
International Conference on Machine Learning, 3598-3607, 2017
332017
Flows in Almost Linear Time via Adaptive Preconditioning
R Kyng, R Peng, S Sachdeva, D Wang
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
292019
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
D Wang, R Kleinberg
Discrete Applied Mathematics 157 (18), 3746-3753, 2009
282009
Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time
MW Mahoney, S Rao, D Wang, P Zhang
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
252016
Flowless: Extracting densest subgraphs without flow computations
D Boob, Y Gao, R Peng, S Sawlani, C Tsourakakis, D Wang, J Wang
Proceedings of The Web Conference 2020, 573-583, 2020
222020
p-Norm flow diffusion for local graph clustering
K Fountoulakis, D Wang, S Yang
International Conference on Machine Learning, 3222-3232, 2020
112020
Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard.
R Kyng, D Wang, P Zhang
ACM-SIAM Symposium on Discrete Algorithms, 2020
102020
Faster parallel solver for positive linear programs via dynamically-bucketed selective coordinate descent
D Wang, M Mahoney, N Mohan, S Rao
arXiv preprint arXiv:1511.06468, 2015
102015
Targeted pandemic containment through identifying local contact network bottlenecks
S Yang, P Senapati, D Wang, CT Bauch, K Fountoulakis
PLoS computational biology 17 (8), e1009351, 2021
92021
Minimum cost flows MDPs and 1-regression in nearly linear time for dense instances
J vd Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, D Wang
STOC. ACM, 859-869, 2021
92021
Faster width-dependent algorithm for mixed packing and covering LPs
D Boob, S Sawlani, D Wang
Thirty-third Conference on Neural Information Processing Systems (NeurIPS), 2019
92019
2-norm Flow Diffusion in Near-Linear Time
L Chen, R Peng, D Wang
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
12022
Minimum Cost Flows, MDPs, and -Regression in Nearly Linear Time for Dense Instances
J Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, D Wang
arXiv preprint arXiv:2101.05719, 2021
12021
Fast Approximation Algorithms for Positive Linear Programs
D Wang
University of California, Berkeley, 2017
12017
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20