Distributed and Dynamic Graph Algorithms and Complexity

Negative-Weight Single-Source Shortest Paths in Almost-linear Time

Autorzy: Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen
Opublikowane w: FOCS, 2022
Wydawca: IEEE

A New Deterministic Algorithm for Dynamic Set Cover

Autorzy: Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
Opublikowane w: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Strona(/y) 406-423, ISBN 978-1-7281-4952-3
Wydawca: IEEE
DOI: 10.1109/focs.2019.00033

Breaking the quadratic barrier for matroid intersection

Autorzy: Joakim Blikstad; Jan van den Brand; Sagnik Mukhopadhyay; Danupon Nanongkai
Opublikowane w: STOC, Numer 7, 2021
Wydawca: ACM
DOI: 10.1145/3406325.3451092

Distributed weighted min-cut in nearly-optimal time

Autorzy: Michal Dory; Yuval Efron; Sagnik Mukhopadhyay; Danupon Nanongkai
Opublikowane w: STOC, Numer 9, 2021
Wydawca: ACM
DOI: 10.1145/3406325.3451020

Sublinear-Round Parallel Matroid Intersection

Autorzy: Joakim Blikstad
Opublikowane w: 2022
Wydawca: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2022.25

Training (Overparametrized) Neural Networks in Near-Linear Time

Autorzy: Brand, Jan van den; Peng, Binghui; Song, Zhao; Weinstein, Omri
Opublikowane w: Numer 6, 2021
Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.itcs.2021.63

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Autorzy: Bernstein, Aaron; Brand, Jan van den; Gutenberg, Maximilian Probst; Nanongkai, Danupon; Saranurak, Thatchaphol; Sidford, Aaron; Sun, He
Opublikowane w: Leibniz International Proceedings in Informatics, LIPIcs, 229, Numer 3, 2022
Wydawca: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.3929/ethz-b-000557713

Sensitive Distance and Reachability Oracles for Large Batch Updates

Autorzy: Jan van den Brand, Thatchaphol Saranurak
Opublikowane w: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Strona(/y) 424-435, ISBN 978-1-7281-4952-3
Wydawca: IEEE
DOI: 10.1109/focs.2019.00034

Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms

Autorzy: Mukhopadhyay, Sagnik; Nanongkai, Danupon
Opublikowane w: STOC, 2020
Wydawca: ACM

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

Autorzy: Jan van den Brand, Yin-Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
Opublikowane w: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Strona(/y) 919-930, ISBN 978-1-7281-9621-3
Wydawca: IEEE
DOI: 10.1109/focs46700.2020.00090

Minimum Cuts in Directed Graphs via Partial Sparsification

Autorzy: Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak
Opublikowane w: FOCS, 2021
Wydawca: IEEE
DOI: 10.1109/focs52979.2021.00113

Solving tall dense linear programs in nearly linear time

Autorzy: Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song
Opublikowane w: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Strona(/y) 775-788, ISBN 9781450369794
Wydawca: ACM
DOI: 10.1145/3357713.3384309

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds

Autorzy: Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak
Opublikowane w: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Strona(/y) 456-480, ISBN 978-1-7281-4952-3
Wydawca: IEEE
DOI: 10.1109/focs.2019.00036

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs

Autorzy: Andrés López-Martínez; Sagnik Mukhopadhyay; Danupon Nanongkai
Opublikowane w: SPAA, Numer 6, 2021
Wydawca: ACM
DOI: 10.1145/3409964.3461806

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

Autorzy: Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
Opublikowane w: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Strona(/y) 1158-1167, ISBN 978-1-7281-9621-3
Wydawca: IEEE
DOI: 10.1109/focs46700.2020.00111

Faster connectivity in low-rank hypergraphs via expander decomposition

Autorzy: Beideman, Calvin; Chandrasekaran, Karthekeyan; Mukhopadhyay, Sagnik; Nanongkai, Danupon
Opublikowane w: IPCO, Numer 8, 2022
Wydawca: Springer
DOI: 10.48550/arxiv.2011.08097

Dynamic Algorithms for Graph Coloring

Autorzy: Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
Opublikowane w: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, Strona(/y) 1-20
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.1

"Dynamic spanning forest with worst-case update time: adaptive, las vegas, and o(n<sup>1/2 - ε</sup>)-time"

Autorzy: Danupon Nanongkai, Thatchaphol Saranurak
Opublikowane w: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017, 2017, Strona(/y) 1122-1129, ISBN 9781-450345286
Wydawca: ACM Press
DOI: 10.1145/3055399.3055447

Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds

Autorzy: Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak
Opublikowane w: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Strona(/y) 168-179, ISBN 978-1-5386-3464-6
Wydawca: IEEE
DOI: 10.1109/focs.2017.24

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

Autorzy: Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
Opublikowane w: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Strona(/y) 743-754, ISBN 978-1-5386-3464-6
Wydawca: IEEE
DOI: 10.1109/focs.2017.74

Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

Autorzy: Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
Opublikowane w: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Strona(/y) 950-961, ISBN 978-1-5386-3464-6
Wydawca: IEEE
DOI: 10.1109/focs.2017.92

On the Distributed Complexity of Large-Scale Graph Computations

Autorzy: Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Opublikowane w: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Strona(/y) 405-414, ISBN 9781-450357999
Wydawca: ACM Press
DOI: 10.1145/3210377.3210409

Distributed edge connectivity in sublinear time

Autorzy: Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
Opublikowane w: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Strona(/y) 343-354, ISBN 9781-450367059
Wydawca: ACM Press
DOI: 10.1145/3313276.3316346

Smooth heaps and a dual view of self-adjusting data structures

Autorzy: László Kozma, Thatchaphol Saranurak
Opublikowane w: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, 2018, Strona(/y) 801-814, ISBN 9781-450355599
Wydawca: ACM Press
DOI: 10.1145/3188745.3188864

Distributed exact weighted all-pairs shortest paths in near-linear time

Autorzy: Aaron Bernstein, Danupon Nanongkai
Opublikowane w: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Strona(/y) 334-342, ISBN 9781-450367059
Wydawca: ACM Press
DOI: 10.1145/3313276.3316326

A Faster Distributed Single-Source Shortest Paths Algorithm

Autorzy: Sebastian Forster, Danupon Nanongkai
Opublikowane w: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Strona(/y) 686-697, ISBN 978-1-5386-4230-6
Wydawca: IEEE
DOI: 10.1109/focs.2018.00071

Breaking quadratic time for small vertex connectivity and an approximation scheme

Autorzy: Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Opublikowane w: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Strona(/y) 241-252, ISBN 9781-450367059
Wydawca: ACM Press
DOI: 10.1145/3313276.3316394

Equivalence Classes and Conditional Hardness in Massively Parallel Computations

Autorzy: Danupon Nanongkai, Michele Scquizzato
Opublikowane w: 23rd International Conference on Principles of Distributed Systems (OPODIS 2019), 2019
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.opodis.2019.33

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

Autorzy: Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Opublikowane w: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Strona(/y) 2046-2065, ISBN 978-1-61197-599-4
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.126

Coarse-Grained Complexity for Dynamic Algorithms

Autorzy: Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
Opublikowane w: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Strona(/y) 476-494, ISBN 978-1-61197-599-4
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.29

A Deterministic Linear Program Solver in Current Matrix Multiplication Time

Autorzy: Jan van den Brand
Opublikowane w: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Strona(/y) 259-278, ISBN 978-1-61197-599-4
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.16

Breaking O(nr) for Matroid Intersection

Autorzy: Joakim Blikstad
Opublikowane w: 2021
Wydawca: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2021.31

Cut query algorithms with star contraction

Autorzy: Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai
Opublikowane w: FOCS, 2022
Wydawca: IEEE

Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances

Autorzy: Jan van den Brand; Yin Tat Lee; Yang P. Liu; Thatchaphol Saranurak; Aaron Sidford; Zhao Song; Di Wang
Opublikowane w: STOC, Numer 8, 2021
Wydawca: ACM
DOI: 10.1145/3406325.3451108

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time {LP} Solver

Autorzy: Parinya Chalermsook; Chien-Chung Huang; Danupon Nanongkai; Thatchaphol Saranurak; Pattara Sukprasert; Sorrachai Yingchareonthawornchai
Opublikowane w: 49th International Colloquium on Automata, Languages, and Programming,{ICALP} 2022, July 4-8, 2022, Paris, France, 2022
Wydawca: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.icalp.2022.37

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time

Autorzy: Jan van den Brand, Danupon Nanongkai
Opublikowane w: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Strona(/y) 436-455, ISBN 978-1-7281-4952-3
Wydawca: IEEE
DOI: 10.1109/focs.2019.00035

Vertex connectivity in poly-logarithmic max-flows

Autorzy: Jason Li; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai
Opublikowane w: STOC, 2021
Wydawca: ACM STOC
DOI: 10.1145/3406325.3451088

Nearly Optimal Communication and Query Complexity of Bipartite Matching

Autorzy: Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
Opublikowane w: FOCS, 2022
Wydawca: IEEE

Dynamic Set Cover: Improved Amortized and Worst-Case Update Time

Autorzy: Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
Opublikowane w: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Strona(/y) 2537-2549, ISBN 978-1-61197-646-5
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.150

Expander Decomposition and Pruning: Faster, Stronger, and Simpler

Autorzy: Thatchaphol Saranurak, Di Wang
Opublikowane w: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Strona(/y) 2616-2635, ISBN 978-1-61197-548-2
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.162

Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms

Autorzy: Jan van den Brand
Opublikowane w: Symposium on Simplicity in Algorithms (SOSA), 2021, Strona(/y) 1-13, ISBN 978-1-61197-649-6
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976496.1

Multi-Finger Binary Search Trees

Autorzy: Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
Opublikowane w: 29th International Symposium on Algorithms and Computation, ISAAC 2018, 2018, ISSN 1868-8969
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ISAAC.2018.55

New Tools and Connections for Exponential-Time Approximation

Autorzy: Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
Opublikowane w: Algorithmica, Numer 81/10, 2019, Strona(/y) 3993-4009, ISSN 0178-4617
Wydawca: Springer Verlag
DOI: 10.1007/s00453-018-0512-8

Publikacje

Udostępnij tę stronę

Pobierz