E-LIB Suche - Ergebnisse für: Blikstad, Joakim

1

Minimum Star Partitions of Simple Polygons in Polynomial Ti..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Abrahamsen, Mikkel ; Blikstad, Joakim ; Nusser, André. - p. 904-910 , 2024

Link: https://dl.acm.org/doi/1..

2

Online Edge Coloring Is (Nearly) as Easy as Offline:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Blikstad, Joakim ; Svensson, Ola ; Vintan, Radu. - p. 36-46 , 2024

Link: https://dl.acm.org/doi/1..

3

Fast Algorithms via Dynamic-Oracle Matroids:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Blikstad, Joakim ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon. - p. 1229-1242 , 2023

Link: https://dl.acm.org/doi/1..

4

Nearly Optimal Communication and Query Complexity of Bipart..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Blikstad, Joakim ; Van Den Brand, Jan ; Efron, Yuval.. - p. 1174-1185 , 2022

Link: https://doi.org/10.1109/..

5

Breaking the quadratic barrier for matroid intersection:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,

Blikstad, Joakim ; van den Brand, Jan ; Mukhopadhyay, Sagnik. - p. 421-432 , 2021

Link: https://dl.acm.org/doi/1..

6

On the longest common subsequence of Thue-Morse words:

Blikstad, Joakim
Information Processing Letters. 164 (2020) - p. 106020 , 2020

Link: https://doi.org/10.1016/..

7

Simple and Asymptotically Optimal Online Bipartite Edge Col..:

Blikstad, Joakim ; Svensson, Ola ; Vintan, Radu.
http://arxiv.org/abs/2311.04574. , 2023

Link: http://arxiv.org/abs/231..

8

Minimum Star Partitions of Simple Polygons in Polynomial Ti..:

Abrahamsen, Mikkel ; Blikstad, Joakim ; Nusser, André.
http://arxiv.org/abs/2311.10631. , 2023

Link: http://arxiv.org/abs/231..

9

Incremental $(1-\epsilon)$-approximate dynamic matching in ..:

Blikstad, Joakim ; Kiss, Peter
http://arxiv.org/abs/2302.08432. , 2023

Link: http://arxiv.org/abs/230..

10

Fast Algorithms via Dynamic-Oracle Matroids:

Blikstad, Joakim ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon.
http://arxiv.org/abs/2302.09796. , 2023

Link: http://arxiv.org/abs/230..

11

Nearly Optimal Communication and Query Complexity of Bipart..:

Blikstad, Joakim ; Brand, Jan van den ; Efron, Yuval..
http://arxiv.org/abs/2208.02526. , 2022

Link: http://arxiv.org/abs/220..

12

Sublinear-Round Parallel Matroid Intersection:

Blikstad, Joakim
doi:10.4230/LIPIcs.ICALP.2022.25. , 2022

Link: https://doi.org/10.4230/..

13

Breaking O(nr) for Matroid Intersection:

Blikstad, Joakim
http://arxiv.org/abs/2105.05673. , 2021

Link: http://arxiv.org/abs/210..

14

Breaking the Quadratic Barrier for Matroid Intersection:

Blikstad, Joakim ; Brand, Jan van den ; Mukhopadhyay, Sagnik.
http://arxiv.org/abs/2102.05548. , 2021

Link: http://arxiv.org/abs/210..

15

Breaking O(nr) for Matroid Intersection:

Blikstad, Joakim
doi:10.4230/LIPIcs.ICALP.2021.31. , 2021

Link: https://doi.org/10.4230/..