( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving SDD linear systems in nearly mlog1/2n time.

, , , , , , и . STOC, стр. 343-352. ACM, (2014)

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.

Changgeng Peng

Xiao-Wei Peng

Jianqiang Peng

Martin Peng

Guo Peng

 

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

Current Flow Group Closeness Centrality for Complex Networks?, , , , и . WWW, стр. 961-971. ACM, (2019)Lp Row Sampling by Lewis Weights., и . STOC, стр. 183-192. ACM, (2015)Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices., , и . STACS, том 14 из LIPIcs, стр. 266-277. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Solving SDD linear systems in nearly mlog1/2n time., , , , , , и . STOC, стр. 343-352. ACM, (2014)Offline Dynamic Higher Connectivity., , и . CoRR, (2017)Distance Queries over Dynamic Interval Graphs., , , , , и . ISAAC, том 283 из LIPIcs, стр. 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximate Undirected Maximum Flows in O(mpolylog(n)) Time.. SODA, стр. 1862-1867. SIAM, (2016)A Framework for Analyzing Resparsification Algorithms., , , и . SODA, стр. 2032-2043. SIAM, (2017)Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds., , , , , и . SODA, стр. 1300-1319. SIAM, (2020)Exponential Convergence of Sinkhorn Under Regularization Scheduling., , , , и . ACDA, стр. 180-188. SIAM, (2023)