Henrik Björklund

According to our database1, Henrik Björklund
  • authored at least 36 papers between 2003 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Conjunctive query containment over trees using schema information.
Acta Inf., 2018

2017
On the Regularity and Learnability of Ordered DAG Languages.
Proceedings of the Implementation and Application of Automata, 2017

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages.
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017

2016
Uniform vs. 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
Efficient Incremental Evaluation of Succinct Regular Expressions.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Compression of finite-state automata through failure transitions.
Theor. Comput. Sci., 2014

2013
Shuffled languages - Representation and recognition.
Theor. Comput. Sci., 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

On the Parameterized Complexity of Linear Context-Free Rewriting Systems.
Proceedings of the 13th Meeting on the Mathematics of Language, 2013

Validity of Tree Pattern Queries with Respect to Schema Information.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On optimum left-to-right strategies for active context-free games.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Cuts in Regular Expressions.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
The tractability frontier for NFA minimization.
J. Comput. Syst. Sci., 2012

On optimum left-to-right strategies for active context-free games
CoRR, 2012

2011
Conjunctive query containment over trees.
J. Comput. Syst. Sci., 2011

Recognizing Shuffled Languages.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
Incremental XPath evaluation.
ACM Trans. Database Syst., 2010

On notions of regularity for data languages.
Theor. Comput. Sci., 2010

Logik und Automaten: ein echtes Dreamteam.
Informatik Spektrum, 2010

Algorithmic Properties of Millstream Systems.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Volker Weber.
Journal of Logic, Language and Information, 2009

Incremental XPath evaluation.
Proceedings of the Database Theory, 2009

2008
Optimizing Conjunctive Queries over Trees Using Schema Information.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

The Tractability Frontier for NFA Minimization.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Discrete Applied Mathematics, 2007

Shuffle Expressions and Words with Nested Data.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Bounded Depth Data Trees.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

On Notions of Regularity for Data Languages.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Conjunctive Query Containment over Trees.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007

2005
Combinatorial structure and randomized subexponential algorithms for infinite games.
Theor. Comput. Sci., 2005

2004
Memoryless determinacy of parity and mean payoff games: a simple proof.
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

State Verification.
Proceedings of the Model-Based Testing of Reactive Systems, 2004

2003
A Discrete Subexponential Algorithm for Parity Games.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework.
Proceedings of the Perspectives of Systems Informatics, 2003


  Loading...