Thatchaphol Saranurak

Citat de

	Toate	Din 2020
Referințe bibliografice	2557	2251
h-index	28	27
i10-index	46	43

580

290

145

435

2015201620172018201920202021202220232024202513 29 28 83 142 212 353 420 526 571 157

Acces public

Afișați-le pe toate

41 de articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Danupon NanongkaiDirector, Max Planck Institute for InformaticsAdresă de e-mail confirmată pe mpi-inf.mpg.de
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityAdresă de e-mail confirmată pe cs.duke.edu
Jan van den BrandGeorgia TechAdresă de e-mail confirmată pe gatech.edu
Sorrachai YingchareonthawornchaiInstitute for Theoretical Studies, ETH ZurichAdresă de e-mail confirmată pe eth-its.ethz.ch
Parinya ChalermsookThe University of SheffieldAdresă de e-mail confirmată pe sheffield.ac.uk
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Adresă de e-mail confirmată pe ist.ac.at
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceAdresă de e-mail confirmată pe cs.uni-saarland.de
Sayan BhattacharyaUniversity of WarwickAdresă de e-mail confirmată pe warwick.ac.uk
Richard PengCarnegie Mellon UniversityAdresă de e-mail confirmată pe cs.cmu.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusAdresă de e-mail confirmată pe mpi-inf.mpg.de
Di WangGoogle ResearchAdresă de e-mail confirmată pe eecs.berkeley.edu
Aaron SidfordStanford UniversityAdresă de e-mail confirmată pe stanford.edu
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkAdresă de e-mail confirmată pe qc.cuny.edu
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityAdresă de e-mail confirmată pe rutgers.edu
Maximilian Probst GutenbergETH ZurichAdresă de e-mail confirmată pe inf.ethz.ch
Julia ChuzhoyToyota Technological Institute at ChicagoAdresă de e-mail confirmată pe ttic.edu
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonAdresă de e-mail confirmată pe uw.edu
Zhao SongSimons Institute for the Theory of Computing, UC BerkeleyAdresă de e-mail confirmată pe ias.edu
Gramoz GoranciUniversity of ViennaAdresă de e-mail confirmată pe univie.ac.at
Peter KissPhd student at the University of WarwickAdresă de e-mail confirmată pe warwick.ac.uk

Urmăriți

Thatchaphol Saranurak

University of Michigan

Adresă de e-mail confirmată pe umich.edu - Pagina de pornire

Dynamic algorithms Distributed algorithms Data structures


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	354	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	155	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	81	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	69	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	59	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	57	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	53	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

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori