Henrik Björklund
Orcid: 0000-0002-4696-9787
According to our database1,
Henrik Björklund
authored at least 40 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
2
1
1
1
1
1
1
1
1
3
1
1
1
1
1
3
1
1
5
1
1
1
1
2
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Int. J. Found. Comput. Sci., 2024
2023
2022
Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022
2021
2018
Acta Informatica, 2018
2017
Proceedings of the Implementation and Application of Automata, 2017
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017
Proceedings of the 14th International Conference on Natural Language Processing, 2017
2016
Uniform <i>vs.</i> Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey.
Algorithms, 2016
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars.
Proceedings of the Language and Automata Theory and Applications, 2016
2015
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015
2014
Theor. Comput. Sci., 2014
2013
A note on the complexity of deterministic tree-walking transducers.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013
Proceedings of the 13th Meeting on the Mathematics of Language, 2013
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
2012
2011
Proceedings of the Language and Automata Theory and Applications, 2011
2010
Proceedings of the Developments in Language Theory, 14th International Conference, 2010
2009
2008
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008
2007
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Discret. Appl. Math., 2007
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
2005
Theor. Comput. Sci., 2005
2004
Theor. Comput. Sci., 2004
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
2003
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Proceedings of the Perspectives of Systems Informatics, 2003