default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenrik Björklund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2005
[b1]Henrik Björklund:
Combinatorial Optimization for Infinite Games on Graphs. Uppsala University, Sweden, 2005
Journal Articles
- 2024
- [j17]Martin Berglund
, Henrik Björklund, Johanna Björklund:
Parsing Unranked Tree Languages, Folded Once. Algorithms 17(6): 268 (2024) - [j16]Henrik Björklund, Johanna Björklund, Petter Ericson:
Tree-Based Generation of Restricted Graph Languages. Int. J. Found. Comput. Sci. 35(1&2): 215-243 (2024) - 2023
- [j15]Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret:
Transduction from trees to graphs through folding. Inf. Comput. 295(Part B): 105111 (2023) - 2021
- [j14]Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke:
Uniform parsing for hyperedge replacement grammars. J. Comput. Syst. Sci. 118: 1-27 (2021) - 2018
- [j13]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees using schema information. Acta Informatica 55(1): 17-56 (2018) - 2016
- [j12]Henrik Björklund, Martin Berglund, Petter Ericson:
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey. Algorithms 9(2): 32 (2016) - 2014
- [j11]Henrik Björklund, Johanna Björklund, Niklas Zechner:
Compression of finite-state automata through failure transitions. Theor. Comput. Sci. 557: 87-100 (2014) - 2013
- [j10]Martin Berglund, Henrik Björklund, Johanna Björklund:
Shuffled languages - Representation and recognition. Theor. Comput. Sci. 489-490: 1-20 (2013) - 2012
- [j9]Henrik Björklund, Wim Martens:
The tractability frontier for NFA minimization. J. Comput. Syst. Sci. 78(1): 198-210 (2012) - 2011
- [j8]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011) - 2010
- [j7]Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick:
Logik und Automaten: ein echtes Dreamteam. Inform. Spektrum 33(5): 452-461 (2010) - [j6]Henrik Björklund, Thomas Schwentick:
On notions of regularity for data languages. Theor. Comput. Sci. 411(4-5): 702-715 (2010) - [j5]Henrik Björklund, Wouter Gelade, Wim Martens:
Incremental XPath evaluation. ACM Trans. Database Syst. 35(4): 29:1-29:43 (2010) - 2009
- [j4]Thomas Schwentick, Henrik Björklund:
Volker Weber. J. Log. Lang. Inf. 18(4): 433 (2009) - 2007
- [j3]Henrik Björklund, Sergei G. Vorobyov:
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discret. Appl. Math. 155(2): 210-229 (2007) - 2005
- [j2]Henrik Björklund, Sergei G. Vorobyov:
Combinatorial structure and randomized subexponential algorithms for infinite games. Theor. Comput. Sci. 349(3): 347-360 (2005) - 2004
- [j1]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)
Conference and Workshop Papers
- 2023
- [c25]Martin Berglund, Henrik Björklund, Johanna Björklund:
Parsing Unranked Tree Languages, Folded Once. FCT 2023: 60-73 - 2022
- [c24]Hannah Devinney, Jenny Björklund, Henrik Björklund:
Theories of "Gender" in NLP Bias Research. FAccT 2022: 2083-2102 - 2017
- [c23]Yonas Demeke Woldemariam, Henrik Björklund, Suna Bensch:
Predicting User Competence from Linguistic Data. ICON 2017: 476-484 - [c22]Martin Berglund, Henrik Björklund, Frank Drewes:
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. TAG 2017: 94-101 - [c21]Henrik Björklund, Johanna Björklund, Petter Ericson:
On the Regularity and Learnability of Ordered DAG Languages. CIAA 2017: 27-39 - 2016
- [c20]Henrik Björklund, Frank Drewes, Petter Ericson:
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. LATA 2016: 521-532 - 2015
- [c19]Henrik Björklund, Wim Martens, Thomas Timm:
Efficient Incremental Evaluation of Succinct Regular Expressions. CIKM 2015: 1541-1550 - 2013
- [c18]Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson:
Cuts in Regular Expressions. Developments in Language Theory 2013: 70-81 - [c17]Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki:
On optimum left-to-right strategies for active context-free games. ICDT 2013: 105-116 - [c16]Henrik Björklund, Wim Martens, Thomas Schwentick:
Validity of Tree Pattern Queries with Respect to Schema Information. MFCS 2013: 171-182 - [c15]Martin Berglund, Henrik Björklund, Frank Drewes:
On the Parameterized Complexity of Linear Context-Free Rewriting Systems. MOL 2013: 21-29 - [c14]Henrik Björklund, Petter Ericson:
A note on the complexity of deterministic tree-walking transducers. NCMA 2013: 69-83 - 2011
- [c13]Martin Berglund, Henrik Björklund, Johanna Högberg:
Recognizing Shuffled Languages. LATA 2011: 142-154 - 2010
- [c12]Suna Bensch, Henrik Björklund, Frank Drewes:
Algorithmic Properties of Millstream Systems. Developments in Language Theory 2010: 54-65 - 2009
- [c11]Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens:
Incremental XPath evaluation. ICDT 2009: 162-173 - 2008
- [c10]Henrik Björklund, Wim Martens:
The Tractability Frontier for NFA Minimization. ICALP (2) 2008: 27-38 - [c9]Henrik Björklund, Wim Martens, Thomas Schwentick:
Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143 - 2007
- [c8]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive Query Containment over Trees. DBPL 2007: 66-80 - [c7]Henrik Björklund, Thomas Schwentick:
On Notions of Regularity for Data Languages. FCT 2007: 88-99 - [c6]Henrik Björklund, Mikolaj Bojanczyk:
Bounded Depth Data Trees. ICALP 2007: 862-874 - [c5]Henrik Björklund, Mikolaj Bojanczyk:
Shuffle Expressions and Words with Nested Data. MFCS 2007: 750-761 - 2004
- [c4]Henrik Björklund:
State Verification. Model-Based Testing of Reactive Systems 2004: 69-86 - [c3]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. MFCS 2004: 673-685 - 2003
- [c2]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 - [c1]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
A Discrete Subexponential Algorithm for Parity Games. STACS 2003: 663-674
Parts in Books or Collections
- 2021
- [p1]Henrik Björklund, Johanna Björklund, Wim Martens:
Learning algorithms. Handbook of Automata Theory (I.) 2021: 375-409
Informal and Other Publications
- 2022
- [i2]Hannah Devinney, Jenny Björklund, Henrik Björklund:
Theories of "Gender" in NLP Bias Research. CoRR abs/2205.02526 (2022) - 2012
- [i1]Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki:
On optimum left-to-right strategies for active context-free games. CoRR abs/1212.3501 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
