Thatchaphol Saranurak

Citace

	Všechny	Od 2019
Citace	2320	2161
h-index	25	25
i10-index	43	41

580

290

145

435

201520162017201820192020202120222023202412 30 28 83 142 215 352 441 572 421

Veřejný přístup

Zobrazit všechny

37 článků

1 článek

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Danupon NanongkaiDirector, Max Planck Institute for InformaticsE-mailová adresa ověřena na: mpi-inf.mpg.de
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityE-mailová adresa ověřena na: cs.duke.edu
Jan van den BrandGeorgia TechE-mailová adresa ověřena na: gatech.edu
Sorrachai YingchareonthawornchaiSimons Institute for the Theory of Computing, UC BerkeleyE-mailová adresa ověřena na: berkeley.edu
Parinya ChalermsookAalto UniversityE-mailová adresa ověřena na: aalto.fi
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)E-mailová adresa ověřena na: ist.ac.at
Sayan BhattacharyaUniversity of WarwickE-mailová adresa ověřena na: warwick.ac.uk
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceE-mailová adresa ověřena na: cs.uni-saarland.de
Richard PengCarnegie Mellon UniversityE-mailová adresa ověřena na: cs.cmu.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusE-mailová adresa ověřena na: mpi-inf.mpg.de
Di WangGoogle ResearchE-mailová adresa ověřena na: eecs.berkeley.edu
Aaron SidfordStanford UniversityE-mailová adresa ověřena na: stanford.edu
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkE-mailová adresa ověřena na: qc.cuny.edu
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityE-mailová adresa ověřena na: rutgers.edu
Julia ChuzhoyToyota Technological Institute at ChicagoE-mailová adresa ověřena na: ttic.edu
Peter KissPhd student at the University of WarwickE-mailová adresa ověřena na: warwick.ac.uk
Maximilian Probst GutenbergETH ZurichE-mailová adresa ověřena na: inf.ethz.ch
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonE-mailová adresa ověřena na: uw.edu
Zhao SongAdobe ResearchE-mailová adresa ověřena na: ias.edu
Gramoz GoranciUniversity of ViennaE-mailová adresa ověřena na: univie.ac.at

Sledovat

Thatchaphol Saranurak

University of Michigan

E-mailová adresa ověřena na: umich.edu - Domovská stránka

Dynamic algorithms Distributed algorithms Data structures


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture M Henzinger, S Krinninger, D Nanongkai, T Saranurak Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	341	2015
Minimum cost flows, MDPs, and ℓ₁-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	142	2021
Dynamic minimum spanning forest with subpolynomial worst-case update time D Nanongkai, T Saranurak, C Wulff-Nilsen 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	133	2017
A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond J Chuzhoy, Y Gao, J Li, D Nanongkai, R Peng, T Saranurak 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	119	2020
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	118	2020
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n^{1/2 - ε})-time D Nanongkai, T Saranurak Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	117	2017
Expander decomposition and pruning: Faster, stronger, and simpler T Saranurak, D Wang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	108	2019
Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds J van den Brand, D Nanongkai, T Saranurak 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019	83	2019
The expander hierarchy and its applications to dynamic graph algorithms G Goranci, H Räcke, T Saranurak, Z Tan Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	75	2021
Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing A Bernstein, MP Gutenberg, T Saranurak 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	65	2020
Deterministic decremental sssp and approximate min-cost flow in almost-linear time A Bernstein, MP Gutenberg, T Saranurak 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	58	2022
Fully-dynamic graph sparsifiers against an adaptive adversary A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ... arXiv preprint arXiv:2004.08432, 2020	55	2020
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers L Chen, G Goranci, M Henzinger, R Peng, T Saranurak 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	52	2020
Improved distributed expander decomposition and nearly optimal triangle enumeration YJ Chang, T Saranurak Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019	51	2019
Sensitive distance and reachability oracles for large batch updates J van den Brand, T Saranurak 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019	48	2019
Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms S Forster, D Nanongkai, L Yang, T Saranurak, S Yingchareonthawornchai Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	47	2020
Vertex connectivity in poly-logarithmic max-flows J Li, D Nanongkai, D Panigrahi, T Saranurak, S Yingchareonthawornchai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021	45	2021
Distributed Exact Weighted All-Pairs Shortest Paths in Õ (n^{5/4}) Rounds CC Huang, D Nanongkai, T Saranurak 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	45	2017
Breaking quadratic time for small vertex connectivity and an approximation scheme D Nanongkai, T Saranurak, S Yingchareonthawornchai Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019	38	2019
Pattern-avoiding access in binary search trees P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 410-423, 2015	38	2015

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři