( en | de | ru )

 

Disambiguation of "Li, Jason"

Author of the publication

copydeleteadd this publication to your clipboard
Minimum Cuts in Directed Graphs via Partial Sparsification.

, , , , , and . CoRR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ian Jason

Jason Miskuly

Jason Crook

Jason Tam

Jason Pazis

 

Other publications of authors with the same name

Stochastic Gradient Methods with Layer-wise Adaptive Moments for Training of Deep Networks., , , , , , , , and . CoRR, (2019)A 34MB/s-Program-Throughput 16Gb MLC NAND with All-Bitline Architecture in 56nm., , , , , , , , , and 33 other author(s). ISSCC, page 420-421. IEEE, (2008)Evaluation of Photogrammetry for Use in Industrial Production Systems., , , , , and . CASE, page 414-420. IEEE, (2018)Scalable Machine Learning Algorithms for a Twitter Followee Recommender System., , and . SpringSim, page 1-8. IEEE, (2019)NeMo: a toolkit for building AI applications using Neural Modules, , , , , , , , , and 4 other author(s). (2019)cite arxiv:1909.09577Comment: 6 pages plus references.Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs., and . CoRR, (2020)Bounding laconic proof systems by solving CSPs in parallel., and . Electron. Colloquium Comput. Complex., (2016)Beyond the Quadratic Time Barrier for Network Unreliability., , , and . SODA, page 1542-1567. SIAM, (2024)The Connectivity Threshold for Dense Graphs., , and . SODA, page 89-105. SIAM, (2021)Deep Learning Inference Service at Microsoft., , , , , , , , , and 2 other author(s). OpML, page 15-17. USENIX Association, (2019)