Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Björklund, Henrik - Department of Computing Science, Umeå Universitet
The Tractability Frontier for NFA Minimization Henrik Bjorklund and Wim Martens
Bounded depth data trees Henrik Bjorklund1
Algorithmic Properties of Millstream Systems Suna Bensch, Henrik Bjorklund, and Frank Drewes
Incremental XPath Evaluation Henrik Bjorklund
Conjunctive Query Containment over Trees Henrik Bjorklund, Wim Martens, and Thomas Schwentick
Shuffle expressions and words with nested data Henrik Bjorklund1
A Discrete Subexponential Algorithm for Parity Games
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean
Optimizing Conjunctive Queries over Trees using Schema Information
Complexity of Model Checking by Iterative Improvement: the Pseudo-Boolean Framework
On notions of regularity for data languages Henrik Bjorklund Thomas Schwentick
