المؤلفون: van den Brand, Jan, Lee, Y. T., Liu, Y. P., Saranurak, T., Sidford, A., Song, Z., Wang, D.

المصدر: Proceedings of the Annual ACM Symposium on Theory of Computing Proceedings of the annual ACM Symposium on Theory of Computing. :859-869

مصطلحات موضوعية: Data Structure, Interior Point Method, Linear Program, Computation theory, Cost accounting, Flow graphs, Linear programming, Markov processes, Matrix algebra, Stochastic systems, Approximate solution, Dynamic data structure, Effective resistances, Interior-point method, Markov Decision Processes, Minimum cost flow problem, Problem parameters, Randomized Algorithms, Iterative methods

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309937
https://doi.org/10.1145/3406325.3451108

المؤلفون: Bhattacharya, S., Kiss, P., Saranurak, T.

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=od______1874::3c658077412c7eb2e008b8acca031077
https://hdl.handle.net/21.11116/0000-000C-9BAA-621.11116/0000-000C-9BA8-8

المؤلفون: Chuzhoy, J., Gao, Y., Li, J., Na Nongkai, Danupon, 1981, Peng, R., Saranurak, T.

المصدر: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. :1158-1167

مصطلحات موضوعية: balanced cuts, deterministic algorithms, dynamic connectivity, Laplacian solvers, maximum flow, Approximation algorithms, Flow graphs, Dynamic graph algorithms, Linear-time approximation, Minimizing the number of, Minimum spanning forests, Randomized Algorithms, Time complexity, Undirected graph, Graph algorithms

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292665

المؤلفون: Bhattacharya, S., Kiss, P., Saranurak, T.

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=od______1874::a37fa3a1cc5023bc006a393a0fa71c1a
https://hdl.handle.net/21.11116/0000-000C-2696-021.11116/0000-000C-2698-E

المؤلفون: Chalermsook, P., Huang, C. -C, Na Nongkai, Danupon, 1981, Saranurak, T., Sukprasert, P., Yingchareonthawornchai, S.

المصدر: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) Leibniz International Proceedings in Informatics, LIPIcs.

مصطلحات موضوعية: Approximation Algorithms, Data Structures

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-317539

المؤلفون: Bernstein, A., van den Brand, J., Gutenberg, M. P., Na Nongkai, Danupon, 1981, Saranurak, T., Sidford, A., Sun, H.

المصدر: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) Leibniz International Proceedings in Informatics, LIPIcs.

مصطلحات موضوعية: adaptive adversary, dynamic graph algorithm, spanner, sparsifier

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-317540

المؤلفون: Daga, Mohit, Henzinger, M., Na Nongkai, Danupon, 1981, Saranurak, T.

المصدر: Proceeding STOC 2019 Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing Proceedings of the Annual ACM Symposium on Theory of Computing. :343-354

مصطلحات موضوعية: Distributed computing, Edge connectivity, Graph algorithms

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262619

المؤلفون: Na Nongkai, Danupon, 1981, Saranurak, T., Yingchareonthawornchai, S.

المصدر: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019. :241-252

مصطلحات موضوعية: Graph algorithms, Local flow algorithms, Vertex connectivity

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262618

لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.

لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.