( en | de | ru )

 

Disambiguation of "Björklund, Henrik"

Author of the publication

copydeleteadd this publication to your clipboard
Memoryless determinacy of parity and mean payoff games: a simple proof.

, , and . Theor. Comput. Sci., 310 (1-3): 365-378 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Patrik Björklund

Andreas Björklund

Beth Bjorklund

Henrik Heinzelmann

Henrik Hoffmann

 

Other publications of authors with the same name

Incremental XPath evaluation., , , and . ICDT, volume 361 of ACM International Conference Proceeding Series, page 162-173. ACM, (2009)Bounded Depth Data Trees., and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 862-874. Springer, (2007)Shuffled languages - Representation and recognition., , and . Theor. Comput. Sci., (2013)Tree-Based Generation of Restricted Graph Languages., , and . Int. J. Found. Comput. Sci., 35 (1&2): 215-243 (January 2024)Shuffle Expressions and Words with Nested Data., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 750-761. Springer, (2007)Parsing Unranked Tree Languages, Folded Once., , and . Algorithms, 17 (6): 268 (June 2024)A note on the complexity of deterministic tree-walking transducers., and . NCMA, volume 294 of books@ocg.at, page 69-83. Österreichische Computer Gesellschaft, (2013)The Tractability Frontier for NFA Minimization., and . ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 27-38. Springer, (2008)Efficient Incremental Evaluation of Succinct Regular Expressions., , and . CIKM, page 1541-1550. ACM, (2015)Cuts in Regular Expressions., , , , and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 70-81. Springer, (2013)