Andreas Björklund (Former)

1 – 10 of 62

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/be1f2cca-1e88-4051-b196-90382a3368d7?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
3
4
…
6
7
next »

2022
Mark The shortest even cycle problem is tractable
Björklund, Andreas ^LU ; Husfeldt, Thore ^LU and Kaski, Petteri (2022) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 In Proceedings of the Annual ACM Symposium on Theory of Computing p.117-130
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2021
Mark Approximate Counting of k-Paths : Simpler, Deterministic, and in Polynomial Space
Lokshtanov, Daniel ; Björklund, Andreas ^LU ; Saurabh, Saket and Zehavi, Meirav (2021) In ACM Transactions on Algorithms 17(3).
- Contribution to journal › Article
Mark The fine-grained complexity of computing the tutte polynomial of a linear matroid
Björklund, Andreas ^LU and Kaski, Petteri (2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2019
Mark Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Björklund, Andreas ^LU ; Kaski, Petteri and Williams, Ryan (2019) In Algorithmica 81(10). p.4010-4028
- Contribution to journal › Article
Mark A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
Björklund, Andreas ^LU ; Gupt, Brajesh and Quesada, Nicolás (2019) In ACM Journal of Experimental Algorithmics 24(1).
- Contribution to journal › Article
Mark Shortest two disjoint paths in polynomial time
Björklund, Andreas ^LU and Husfeldt, Thore ^LU (2019) In SIAM Journal on Computing 48(6). p.1698-1710
- Contribution to journal › Article
Mark Approximate counting of K-paths : Deterministic and in polynomial space
Björklund, Andreas ^LU ; Lokshtanov, Daniel ; Saurabh, Saket and Zehavi, Meirav (2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 132.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
Björklund, Andreas ^LU and Williams, Ryan (2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-25
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
Björklund, Andreas ^LU ; Kaski, Petteri and Williams, Ryan (2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-26
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2018
Mark Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Björklund, Andreas ^LU ; Kaski, Petteri and Williams, Ryan (2018) 12th International Symposium on Parameterized and Exact Computation, IPEC 2017 89.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

« previous
1
2
3
4
…
6
7
next »