Henrik Björklund

47 papers A* 1A 4B 6C 5Journal 19Unranked 9
YearRankTypeTitle / Venue / Authors
2024 J jnl
Parsing Unranked Tree Languages, Folded Once.
Algorithms
Martin Berglund, Henrik Björklund, Johanna Björklund
2024 J jnl
Tree-Based Generation of Restricted Graph Languages.
Int. J. Found. Comput. Sci.
Henrik Björklund, Johanna Björklund, Petter Ericson
2023 B conf
Parsing Unranked Tree Languages, Folded Once.
FCT
Martin Berglund, Henrik Björklund, Johanna Björklund
2023 J jnl
Transduction from trees to graphs through folding.
Inf. Comput.
Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret
2022 — conf
Theories of "Gender" in NLP Bias Research.
FAccT
Hannah Devinney, Jenny Björklund, Henrik Björklund
2022 J jnl
Theories of "Gender" in NLP Bias Research.
CoRR
Hannah Devinney, Jenny Björklund, Henrik Björklund
2021 — ch.
Learning algorithms.
Handbook of Automata Theory (I.)
Henrik Björklund, Johanna Björklund, Wim Martens
2021 — ed.
Proceedings of the 17th Meeting on the Mathematics of Language, MOL 2021, Umeå, Sweden, December 13, 2021.
MOL
Henrik Björklund, Frank Drewes
2021 J jnl
Uniform parsing for hyperedge replacement grammars.
J. Comput. Syst. Sci.
Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke
2018 J jnl
Conjunctive query containment over trees using schema information.
Acta Informatica
Henrik Björklund, Wim Martens, Thomas Schwentick
2017 C conf
On the Regularity and Learnability of Ordered DAG Languages.
CIAA
Henrik Björklund, Johanna Björklund, Petter Ericson
2017 — conf
Predicting User Competence from Linguistic Data.
ICON
Yonas Demeke Woldemariam, Henrik Björklund, Suna Bensch
2017 — conf
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages.
TAG
Martin Berglund, Henrik Björklund, Frank Drewes
2016 C conf
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars.
LATA
Henrik Björklund, Frank Drewes, Petter Ericson
2016 J jnl
Uniform
Algorithms
Henrik Björklund, Martin Berglund, Petter Ericson
2015 A conf
Efficient Incremental Evaluation of Succinct Regular Expressions.
CIKM
Henrik Björklund, Wim Martens, Thomas Timm
2014 J jnl
Compression of finite-state automata through failure transitions.
Theor. Comput. Sci.
Henrik Björklund, Johanna Björklund, Niklas Zechner
2013 — conf
A note on the complexity of deterministic tree-walking transducers.
NCMA
Henrik Björklund, Petter Ericson
2013 C conf
Cuts in Regular Expressions.
Developments in Language Theory
Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson
2013 A conf
On optimum left-to-right strategies for active context-free games.
ICDT
Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki
2013 — conf
On the Parameterized Complexity of Linear Context-Free Rewriting Systems.
MOL
Martin Berglund, Henrik Björklund, Frank Drewes
2013 J jnl
Shuffled languages - Representation and recognition.
Theor. Comput. Sci.
Martin Berglund, Henrik Björklund, Johanna Björklund
2013 B conf
Validity of Tree Pattern Queries with Respect to Schema Information.
MFCS
Henrik Björklund, Wim Martens, Thomas Schwentick
2012 J jnl
On optimum left-to-right strategies for active context-free games
CoRR
Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki
2012 J jnl
The tractability frontier for NFA minimization.
J. Comput. Syst. Sci.
Henrik Björklund, Wim Martens
2011 J jnl
Conjunctive query containment over trees.
J. Comput. Syst. Sci.
Henrik Björklund, Wim Martens, Thomas Schwentick
2011 C conf
Recognizing Shuffled Languages.
LATA
Martin Berglund, Henrik Björklund, Johanna Högberg
2010 C conf
Algorithmic Properties of Millstream Systems.
Developments in Language Theory
Suna Bensch, Henrik Björklund, Frank Drewes
2010 J jnl
Incremental XPath evaluation.
ACM Trans. Database Syst.
Henrik Björklund, Wouter Gelade, Wim Martens
2010 J jnl
Logik und Automaten: ein echtes Dreamteam.
Inform. Spektrum
Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick
2010 J jnl
On notions of regularity for data languages.
Theor. Comput. Sci.
Henrik Björklund, Thomas Schwentick
2009 A conf
Incremental XPath evaluation.
ICDT
Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens
2009 J jnl
Volker Weber.
J. Log. Lang. Inf.
Thomas Schwentick, Henrik Björklund
2008 B conf
Optimizing Conjunctive Queries over Trees Using Schema Information.
MFCS
Henrik Björklund, Wim Martens, Thomas Schwentick
2008 — conf
The Tractability Frontier for NFA Minimization.
ICALP (2)
Henrik Björklund, Wim Martens
2007 J jnl
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Discret. Appl. Math.
Henrik Björklund, Sergei G. Vorobyov
2007 A* conf
Bounded Depth Data Trees.
ICALP
Henrik Björklund, Mikolaj Bojanczyk
2007 — conf
Conjunctive Query Containment over Trees.
DBPL
Henrik Björklund, Wim Martens, Thomas Schwentick
2007 B conf
On Notions of Regularity for Data Languages.
FCT
Henrik Björklund, Thomas Schwentick
2007 B conf
Shuffle Expressions and Words with Nested Data.
MFCS
Henrik Björklund, Mikolaj Bojanczyk
2005 — —
Combinatorial Optimization for Infinite Games on Graphs.
Henrik Björklund
2005 J jnl
Combinatorial structure and randomized subexponential algorithms for infinite games.
Theor. Comput. Sci.
Henrik Björklund, Sergei G. Vorobyov
2004 B conf
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.
MFCS
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
2004 J jnl
Memoryless determinacy of parity and mean payoff games: a simple proof.
Theor. Comput. Sci.
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
2004 — conf
State Verification.
Model-Based Testing of Reactive Systems
Henrik Björklund
2003 A conf
A Discrete Subexponential Algorithm for Parity Games.
STACS
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
2003 — conf
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework.
Ershov Memorial Conference
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov