| A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games H Björklund, S Vorobyov Discrete Applied Mathematics 155 (2), 210-229, 2007 | 181 | 2007 |
| On notions of regularity for data languages H Björklund, T Schwentick Theoretical Computer Science 411 (4-5), 702-715, 2010 | 121 | 2010 |
| A discrete subexponential algorithm for parity games H Björklund, S Sandberg, S Vorobyov Annual Symposium on Theoretical Aspects of Computer Science, 663-674, 2003 | 93 | 2003 |
| Memoryless determinacy of parity and mean payoff games: a simple proof H Björklund, S Sandberg, S Vorobyov Theoretical Computer Science 310 (1-3), 365-378, 2004 | 76 | 2004 |
| Conjunctive query containment over trees H Björklund, W Martens, T Schwentick Journal of Computer and System Sciences 77 (3), 450-472, 2011 | 59* | 2011 |
| Optimizing conjunctive queries over trees using schema information H Björklund, W Martens, T Schwentick International Symposium on Mathematical Foundations of Computer Science, 132-143, 2008 | 57 | 2008 |
| The tractability frontier for NFA minimization H Björklund, W Martens Journal of Computer and System Sciences 78 (1), 198-210, 2012 | 56* | 2012 |
| Combinatorial structure and randomized subexponential algorithms for infinite games H Björklund, S Vorobyov Theoretical Computer Science 349 (3), 347-360, 2005 | 46 | 2005 |
| Shuffled languages—Representation and recognition M Berglund, H Björklund, J Björklund Theoretical Computer Science 489, 1-20, 2013 | 39* | 2013 |
| Incremental xpath evaluation H Björklund, W Gelade, W Martens ACM Transactions on Database Systems (TODS) 35 (4), 1-43, 2010 | 39 | 2010 |
| Theories of “gender” in nlp bias research H Devinney, J Björklund, H Björklund Proceedings of the 2022 ACM conference on fairness, accountability, and …, 2022 | 36 | 2022 |
| Shuffle expressions and words with nested data H Björklund, M Bojańczyk Mathematical Foundations of Computer Science 2007: 32nd International …, 2007 | 33 | 2007 |
| Between a rock and a hard place–uniform parsing for hyperedge replacement DAG grammars H Björklund, F Drewes, P Ericson Language and Automata Theory and Applications: 10th International Conference …, 2016 | 31 | 2016 |
| Optimization on completely unimodal hypercubes H BjЈorklund, S Sandberg, S Vorobyov | 25 | 2002 |
| Efficient incremental evaluation of succinct regular expressions H Björklund, W Martens, T Timm Proceedings of the 24th ACM International on Conference on Information and …, 2015 | 22 | 2015 |
| Linear complementarity algorithms for mean payoff games H Björklund, O Svensson, S Vorobyov Technical Report DIMACS-2005-05, DIMACS: Center for Discrete Mathematics and …, 2005 | 22 | 2005 |
| Complexity of model checking by iterative improvement: the pseudo-Boolean framework H Björklund, S Sandberg, S Vorobyov International Andrei Ershov Memorial Conference on Perspectives of System …, 2003 | 22 | 2003 |
| Semi-supervised topic modeling for gender bias discovery in English and Swedish H Devinney, J Björklund, H Björklund GeBNLP2020, COLING'2020–The 28th International Conference on Computational …, 2020 | 20 | 2020 |
| Bounded depth data trees H Björklund, M Bojańczyk Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007 | 19 | 2007 |
| Compression of finite-state automata through failure transitions H Björklund, J Björklund, N Zechner Theoretical Computer Science 557, 87-100, 2014 | 16* | 2014 |
