( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for Lipschitz Learning on Graphs.

, , , и . COLT, том 40 из JMLR Workshop and Conference Proceedings, стр. 1190-1223. JMLR.org, (2015)

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.

Sushant Sharma

 

Другие публикации лиц с тем же именем

Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover., и . CCC, стр. 219-229. IEEE Computer Society, (2013)Faster p-norm minimizing flows, via smoothed q-norm problems., и . SODA, стр. 892-910. SIAM, (2020)Fast Algorithms for Separable Linear Programs., , , , и . SODA, стр. 3558-3604. SIAM, (2024)Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time., , , , , , и . SODA, стр. 124-153. SIAM, (2022)A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow., , , , , , , и . FOCS, стр. 503-514. IEEE, (2023)Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression., , и . NeurIPS, стр. 14166-14177. (2019)Fast, Provable Algorithms for Isotonic Regression in all L_p-norms., , и . NIPS, стр. 2719-2727. (2015)Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple., и . FOCS, стр. 573-582. IEEE Computer Society, (2016)Electrical Flows for Polylogarithmic Competitive Oblivious Routing., , , , и . ITCS, том 287 из LIPIcs, стр. 55:1-55:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach, , , и . CoRR, (2011)