 | 2009 |
|---|
| 14 |       | Henrik Björklund,
Wouter Gelade,
Marcel Marquardt,
Wim Martens:
Incremental XPath evaluation.
ICDT 2009: 162-173 |
| 2008 |
|---|
| 13 | | Henrik Björklund,
Wim Martens:
The Tractability Frontier for NFA Minimization.
ICALP (2) 2008: 27-38 |
| 12 | | Henrik Björklund,
Wim Martens,
Thomas Schwentick:
Optimizing Conjunctive Queries over Trees Using Schema Information.
MFCS 2008: 132-143 |
| 2007 |
|---|
| 11 | | Henrik Björklund,
Wim Martens,
Thomas Schwentick:
Conjunctive Query Containment over Trees.
DBPL 2007: 66-80 |
| 10 | | Henrik Björklund,
Thomas Schwentick:
On Notions of Regularity for Data Languages.
FCT 2007: 88-99 |
| 9 | | Henrik Björklund,
Mikolaj Bojanczyk:
Bounded Depth Data Trees.
ICALP 2007: 862-874 |
| 8 | | Henrik Björklund,
Mikolaj Bojanczyk:
Shuffle Expressions and Words with Nested Data.
MFCS 2007: 750-761 |
| 7 | | Henrik Björklund,
Sergei G. Vorobyov:
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Discrete Applied Mathematics 155(2): 210-229 (2007) |
| 2005 |
|---|
| 6 | | Henrik Björklund,
Sergei G. Vorobyov:
Combinatorial structure and randomized subexponential algorithms for infinite games.
Theor. Comput. Sci. 349(3): 347-360 (2005) |
| 2004 |
|---|
| 5 | | Henrik Björklund,
Sven Sandberg,
Sergei G. Vorobyov:
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.
MFCS 2004: 673-685 |
| 4 | | Henrik Björklund:
State Verification.
Model-Based Testing of Reactive Systems 2004: 69-86 |
| 3 | | 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): 365-378 (2004) |
| 2003 |
|---|
| 2 | | Henrik Björklund,
Sven Sandberg,
Sergei G. Vorobyov:
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework.
Ershov Memorial Conference 2003: 381-394 |
| 1 | | Henrik Björklund,
Sven Sandberg,
Sergei G. Vorobyov:
A Discrete Subexponential Algorithm for Parity Games.
STACS 2003: 663-674 |
