Di Wang

Orcid: 0000-0003-0891-0255

Affiliations:
  • Google Research, Mountain View, CA, USA
  • University of California at Berkeley, Department of Electrical Engineering and Computer Sciences, CA, USA (PhD 2017)


According to our database1, Di Wang authored at least 20 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.
CoRR, 2024

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Prior-Independent Auctions for Heterogeneous Bidders.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱.
Proceedings of the ACM Web Conference 2023, 2023

2021
Targeted pandemic containment through identifying local contact network bottlenecks.
PLoS Comput. Biol., 2021

𝓁<sub>2</sub>-norm Flow Diffusion in Near-Linear Time.
CoRR, 2021

Minimum cost flows, MDPs, and ℓ<sub>1</sub>-regression in nearly linear time for dense instances.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2-norm Flow Diffusion in Near-Linear Time.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Local Flow Partitioning for Faster Edge Connectivity.
SIAM J. Comput., 2020

Flowless: Extracting Densest Subgraphs Without Flow Computations.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

p-Norm Flow Diffusion for Local Graph Clustering.
Proceedings of the 37th International Conference on Machine Learning, 2020

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Flows in almost linear time via adaptive preconditioning.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2017
Fast Approximation Algorithms for Positive Linear Programs.
PhD thesis, 2017

Capacity Releasing Diffusion for Speed and Locality.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent.
CoRR, 2015


  Loading...