Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bj{\"o}rklund, Henrik"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compression of finite-state automata through failure transitions
Henrik Björklund
,
Johanna Björklund
,
Niklas Zechner
Theoretical Computer Science
557
, 2014, pp. 87-100
Shuffled languages - Representation and recognition
Martin Berglund
,
Henrik Björklund
,
Johanna Björklund
Theoretical Computer Science
489-490
, 2013, pp. 1-20
Validity of tree pattern queries with respect to schema information
Henrik Björklund
,
Wim Martens
,
Thomas Schwentick
Lecture Notes in Computer Science
8087
, 2013, pp. 171-182
The tractability frontier for NFA minimization
Henrik Björklund
,
Wim Martens
Journal of Computer and System Sciences
78
(1), 2012, pp. 198-210
Conjunctive query containment over trees
Henrik Björklund
,
Wim Martens
,
Thomas Schwentick
Journal of Computer and System Sciences
77
(3), 2011, pp. 450-472
On notions of regularity for data languages
Henrik Björklund
,
Thomas Schwentick
Theoretical Computer Science
411
(4-5), 2010, pp. 702-715
Optimizing conjunctive queries over trees using schema information
Henrik Björklund
,
Wim Martens
,
Thomas Schwentick
Lecture Notes in Computer Science
5162
, 2008, pp. 132-143
The tractability frontier for NFA minimization
Henrik Björklund
,
Wim Martens
Lecture Notes in Computer Science
5126
, 2008, pp. 27-38
Bounded depth data trees
Henrik Björklund
,
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
4596
, 2007, pp. 862-874
Shuffle expressions and words with nested data
Henrik Björklund
,
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
4708
, 2007, pp. 750-761
Combinatorial structure and randomized subexponential algorithms for infinite games
Henrik Björklund
,
Sergei Vorobyov
Theoretical Computer Science
349
(3), 2005, pp. 347-360
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Henrik Björklund
,
Sven Sandberg
,
Sergei Vorobyov
Lecture Notes in Computer Science
3153
, 2004, pp. 673-685
Memoryless determinacy of parity and mean payoff games: A simple proof
Henrik Björklund
,
Sven Sandberg
,
Sergei Vorobyov
Theoretical Computer Science
310
(1-3), 2004, pp. 365-378
A discrete subexponential algorithm for parity games
Henrik Björklund
,
Sven Sandberg
,
Sergei Vorobyov
Lecture Notes in Computer Science
2607
, 2003, pp. 663-674