Thatchaphol Saranurak

Geciteerd door

	Alles	Sinds 2019
Citaties	2485	2326
h-index	27	27
i10-index	45	43

600

300

150

450

201520162017201820192020202120222023202412 30 28 83 143 215 352 443 560 592

Openbare toegang

Alles bekijken

38 artikelen

0 artikelen

beschikbaar

niet beschikbaar

Op basis van financieringsmachtigingen

Medeauteurs

Danupon NanongkaiDirector, Max Planck Institute for InformaticsGeverifieerd e-mailadres voor mpi-inf.mpg.de
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityGeverifieerd e-mailadres voor cs.duke.edu
Jan van den BrandGeorgia TechGeverifieerd e-mailadres voor gatech.edu
Sorrachai YingchareonthawornchaiSimons Institute for the Theory of Computing, UC BerkeleyGeverifieerd e-mailadres voor berkeley.edu
Parinya ChalermsookAalto UniversityGeverifieerd e-mailadres voor aalto.fi
Sayan BhattacharyaUniversity of WarwickGeverifieerd e-mailadres voor warwick.ac.uk
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Geverifieerd e-mailadres voor ist.ac.at
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceGeverifieerd e-mailadres voor cs.uni-saarland.de
Richard PengCarnegie Mellon UniversityGeverifieerd e-mailadres voor cs.cmu.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusGeverifieerd e-mailadres voor mpi-inf.mpg.de
Di WangGoogle ResearchGeverifieerd e-mailadres voor eecs.berkeley.edu
Aaron SidfordStanford UniversityGeverifieerd e-mailadres voor stanford.edu
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkGeverifieerd e-mailadres voor qc.cuny.edu
Maximilian Probst GutenbergETH ZurichGeverifieerd e-mailadres voor inf.ethz.ch
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityGeverifieerd e-mailadres voor rutgers.edu
Peter KissPhd student at the University of WarwickGeverifieerd e-mailadres voor warwick.ac.uk
Julia ChuzhoyToyota Technological Institute at ChicagoGeverifieerd e-mailadres voor ttic.edu
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonGeverifieerd e-mailadres voor uw.edu
Zhao SongSimons Institute for the Theory of Computing, UC BerkeleyGeverifieerd e-mailadres voor ias.edu
Gramoz GoranciUniversity of ViennaGeverifieerd e-mailadres voor univie.ac.at

Volgen

Thatchaphol Saranurak

University of Michigan

Geverifieerd e-mailadres voor umich.edu - Homepage

Dynamic algorithms Distributed algorithms Data structures


Titel Sorteren op citaties Sorteren op jaar Sorteren op titel	Geciteerd door Geciteerd door	Jaar
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	353	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	150	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	140	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	127	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	124	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	123	2017
Expander decomposition and pruning: Faster, stronger, and simpler T Saranurak, D Wang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	115	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	85	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	78	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	63	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	57	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	55	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	50	2021
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
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	49	2020
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	46	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	40	2022
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	40	2015

Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.

Artikelen 1–20

Citaties per jaar

Dubbele citaties

Samengevoegde citaties

Medeauteurs toevoegenMedeauteurs

Volgen

Geciteerd door

Medeauteurs