Henrik Björklund

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 13

Top Topics

Efficient Incremental

Context Free Grammars

Top Venues

J. Comput. Syst. Sci.

Publications

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