|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Henrik Björklund, Wim Martens |
The tractability frontier for NFA minimization.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wim Martens, Thomas Schwentick |
Conjunctive query containment over trees. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Berglund, Henrik Björklund, Johanna Högberg |
Recognizing Shuffled Languages. |
LATA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Thomas Schwentick |
On notions of regularity for data languages. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wouter Gelade, Wim Martens |
Incremental XPath evaluation. |
ACM Trans. Database Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick |
Logik und Automaten: ein echtes Dreamteam. |
Informatik Spektrum |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Suna Bensch, Henrik Björklund, Frank Drewes |
Algorithmic Properties of Millstream Systems. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Henrik Björklund |
Volker Weber. |
Journal of Logic, Language and Information |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens |
Incremental XPath evaluation. |
ICDT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wim Martens |
The Tractability Frontier for NFA Minimization. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wim Martens, Thomas Schwentick |
Optimizing Conjunctive Queries over Trees Using Schema Information. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Sergei G. Vorobyov |
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Mikolaj Bojanczyk |
Bounded Depth Data Trees. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Mikolaj Bojanczyk |
Shuffle Expressions and Words with Nested Data. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Thomas Schwentick |
On Notions of Regularity for Data Languages. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wim Martens, Thomas Schwentick |
Conjunctive Query Containment over Trees. |
DBPL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Sergei G. Vorobyov |
Combinatorial structure and randomized subexponential algorithms for infinite games. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov |
Memoryless determinacy of parity and mean payoff games: a simple proof. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov |
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund |
State Verification. |
Model-Based Testing of Reactive Systems |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov |
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework. |
Ershov Memorial Conference |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov |
A Discrete Subexponential Algorithm for Parity Games. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")