Henrik Björklund
Henrik Björklund
Department of computing science, Umeå university
Verified email at cs.umu.se
TitleCited byYear
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
H Björklund, S Vorobyov
Discrete Applied Mathematics 155 (2), 210-229, 2007
1572007
On notions of regularity for data languages
H Björklund, T Schwentick
Theoretical Computer Science 411 (4-5), 702-715, 2010
952010
A discrete subexponential algorithm for parity games
H Björklund, S Sandberg, S Vorobyov
Annual Symposium on Theoretical Aspects of Computer Science, 663-674, 2003
872003
Memoryless determinacy of parity and mean payoff games: a simple proof
H Björklund, S Sandberg, S Vorobyov
Theoretical Computer Science 310 (1-3), 365-378, 2004
642004
Conjunctive query containment over trees
H Björklund, W Martens, T Schwentick
Journal of Computer and System Sciences 77 (3), 450-472, 2011
55*2011
Optimizing conjunctive queries over trees using schema information
H Björklund, W Martens, T Schwentick
International Symposium on Mathematical Foundations of Computer Science, 132-143, 2008
542008
The tractability frontier for NFA minimization
H Björklund, W Martens
Journal of Computer and System Sciences 78 (1), 198-210, 2012
49*2012
Combinatorial structure and randomized subexponential algorithms for infinite games
H Björklund, S Vorobyov
Theoretical Computer Science 349 (3), 347-360, 2005
402005
Shuffled languages—Representation and recognition
M Berglund, H Björklund, J Björklund
Theoretical Computer Science 489, 1-20, 2013
31*2013
Incremental xpath evaluation
H Björklund, W Gelade, W Martens
ACM Transactions on Database Systems (TODS) 35 (4), 29, 2010
302010
Shuffle expressions and words with nested data
H Björklund, M Bojańczyk
International Symposium on Mathematical Foundations of Computer Science, 750-761, 2007
282007
Optimization on completely unimodal hypercubes
H BjЈorklund, S Sandberg, S Vorobyov
242002
Linear complementarity algorithms for mean payoff games
H Björklund, O Svensson, S Vorobyov
Technical Report DIMACS-2005-05, DIMACS: Center for Discrete Mathematics and …, 2005
212005
Complexity of model checking by iterative improvement: the pseudo-Boolean framework
H Björklund, S Sandberg, S Vorobyov
International Andrei Ershov Memorial Conference on Perspectives of System …, 2003
212003
Between a rock and a hard place–uniform parsing for hyperedge replacement DAG grammars
H Björklund, F Drewes, P Ericson
Language and Automata Theory and Applications, 521-532, 2016
182016
Bounded depth data trees
H Björklund, M Bojańczyk
International Colloquium on Automata, Languages, and Programming, 862-874, 2007
172007
Randomized subexponential algorithms for parity games
H BjЈorklund, S Sandberg, S Vorobyov
152003
On combinatorial structure and algorithms for parity games
H BjЈorklund, S Sandberg, S Vorobyov
152003
Efficient incremental evaluation of succinct regular expressions
H Björklund, W Martens, T Timm
Proceedings of the 24th ACM International on Conference on Information and …, 2015
122015
Validity of tree pattern queries with respect to schema information
H Björklund, W Martens, T Schwentick
International Symposium on Mathematical Foundations of Computer Science, 171-182, 2013
122013
The system can't perform the operation now. Try again later.
Articles 1–20