Thatchaphol Saranurak

Citirano

	Sve	Od 2020.
Citati	2568	2261
H-indeks	28	27
i10-indeks	46	43

580

290

145

435

2015201620172018201920202021202220232024202513 29 28 83 142 212 353 418 524 575 167

Javni pristup

Prikaži sve

41 članak

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Danupon NanongkaiDirector, Max Planck Institute for InformaticsPotvrđena adresa e-pošte na mpi-inf.mpg.de
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityPotvrđena adresa e-pošte na cs.duke.edu
Jan van den BrandGeorgia TechPotvrđena adresa e-pošte na gatech.edu
Sorrachai YingchareonthawornchaiInstitute for Theoretical Studies, ETH ZurichPotvrđena adresa e-pošte na eth-its.ethz.ch
Parinya ChalermsookThe University of SheffieldPotvrđena adresa e-pošte na sheffield.ac.uk
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Potvrđena adresa e-pošte na ist.ac.at
László KozmaFreie Universität Berlin, Department of Mathematics and Computer SciencePotvrđena adresa e-pošte na cs.uni-saarland.de
Sayan BhattacharyaUniversity of WarwickPotvrđena adresa e-pošte na warwick.ac.uk
Richard PengCarnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusPotvrđena adresa e-pošte na mpi-inf.mpg.de
Di WangGoogle ResearchPotvrđena adresa e-pošte na eecs.berkeley.edu
Aaron SidfordStanford UniversityPotvrđena adresa e-pošte na stanford.edu
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityPotvrđena adresa e-pošte na rutgers.edu
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkPotvrđena adresa e-pošte na qc.cuny.edu
Maximilian Probst GutenbergETH ZurichPotvrđena adresa e-pošte na inf.ethz.ch
Julia ChuzhoyToyota Technological Institute at ChicagoPotvrđena adresa e-pošte na ttic.edu
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonPotvrđena adresa e-pošte na uw.edu
Zhao SongSimons Institute for the Theory of Computing, UC BerkeleyPotvrđena adresa e-pošte na ias.edu
Gramoz GoranciUniversity of ViennaPotvrđena adresa e-pošte na univie.ac.at
Peter KissPhd student at the University of WarwickPotvrđena adresa e-pošte na warwick.ac.uk

Prati

Thatchaphol Saranurak

University of Michigan

Potvrđena adresa e-pošte na umich.edu - Početna stranica

Dynamic algorithms Distributed algorithms Data structures


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	356	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	156	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	144	2017
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	129	2020
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	126	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	124	2017
Expander decomposition and pruning: Faster, stronger, and simpler T Saranurak, D Wang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	116	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	82	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	79	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	70	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	68	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	60	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	58	2019
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	54	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	52	2021
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	51	2020
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	50	2019
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	48	2017
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds A Beimel, H Kaplan, Y Mansour, K Nissim, T Saranurak, U Stemmer Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022	42	2022
Distributed edge connectivity in sublinear time M Daga, M Henzinger, D Nanongkai, T Saranurak Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019	41	2019

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori