Folgen
Joakim Blikstad
Titel
Zitiert von
Zitiert von
Jahr
Breaking the quadratic barrier for matroid intersection
J Blikstad, J van den Brand, S Mukhopadhyay, D Nanongkai
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
112021
Breaking o (nr) for matroid intersection
J Blikstad
arXiv preprint arXiv:2105.05673, 2021
112021
Fast algorithms via dynamic-oracle matroids
J Blikstad, S Mukhopadhyay, D Nanongkai, TW Tu
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1229-1242, 2023
82023
Nearly optimal communication and query complexity of bipartite matching
J Blikstad, J Van Den Brand, Y Efron, S Mukhopadhyay, D Nanongkai
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
82022
Incremental -approximate dynamic matching in update time
J Blikstad, P Kiss
arXiv preprint arXiv:2302.08432, 2023
62023
On the longest common subsequence of Thue-Morse words
J Blikstad
Information Processing Letters 164, 106020, 2020
22020
Online Edge Coloring is (Nearly) as Easy as Offline
J Blikstad, O Svensson, R Vintan, D Wajc
arXiv preprint arXiv:2402.18339, 2024
12024
Simple and Asymptotically Optimal Online Bipartite Edge Coloring
J Blikstad, O Svensson, R Vintan, D Wajc
2024 Symposium on Simplicity in Algorithms (SOSA), 331-336, 2024
12024
Minimum Star Partitions of Simple Polygons in Polynomial Time
M Abrahamsen, J Blikstad, A Nusser, H Zhang
arXiv preprint arXiv:2311.10631, 2023
12023
Sublinear-round parallel matroid intersection
J Blikstad
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
12022
Maximum Flow by Augmenting Paths in Time
A Bernstein, J Blikstad, T Saranurak, TW Tu
arXiv preprint arXiv:2406.03648, 2024
2024
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–11