| Two-variable logic on data words M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin ACM Transactions on Computational Logic (TOCL) 12 (4), 1-26, 2011 | 452* | 2011 |
| Two-variable logic on data trees and XML reasoning M Bojańczyk, A Muscholl, T Schwentick, L Segoufin Journal of the ACM (JACM) 56 (3), 1-48, 2009 | 273 | 2009 |
| Automata theory in nominal sets M Bojańczyk, B Klin, S Lasota Logical Methods in Computer Science 10, 2014 | 271* | 2014 |
| Bounds in w-regularity M Bojanczyk, T Colcombet 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 285-296, 2006 | 135 | 2006 |
| Forest algebras M laj Bojanczyk, I Walukiewicz Automata and logic: history and perspectives, 107-132, 2008 | 112 | 2008 |
| Transducers with origin information M Bojańczyk Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 91 | 2014 |
| A bounding quantifier M Bojańczyk International Workshop on Computer Science Logic, 41-55, 2004 | 80 | 2004 |
| Weak MSO with the unbounding quantifier M Bojańczyk Theory of Computing Systems 48 (3), 554-576, 2011 | 79 | 2011 |
| Tree-walking automata do not recognize all regular languages M Bojanczyk, T Colcombet Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 79 | 2005 |
| Nominal monoids M Bojańczyk Theory of Computing Systems 53 (2), 194-222, 2013 | 73* | 2013 |
| Recognisable languages over monads M Bojańczyk International Conference on Developments in Language Theory, 1-13, 2015 | 70 | 2015 |
| Towards nominal computation M Bojanczyk, L Braud, B Klin, S Lasota Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2012 | 69 | 2012 |
| Definability equals recognizability for graphs of bounded treewidth M Bojańczyk, M Pilipczuk Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 64 | 2016 |
| Turing machines with atoms M Bojanczyk, B Klin, S Lasota, S Torunczyk 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 183-192, 2013 | 64 | 2013 |
| Piecewise testable tree languages M Bojańczyk, L Segoufin, H Straubing Logical Methods in Computer Science 8, 2012 | 62 | 2012 |
| Tree-walking automata cannot be determinized M Bojańczyk, T Colcombet Theoretical Computer Science 350 (2-3), 164-173, 2006 | 59 | 2006 |
| Weak MSO+ U over infinite trees M Bojanczyk, S Torunczyk STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012 | 56 | 2012 |
| An extension of data automata that captures XPath M Bojańczyk, S Lasota Logical Methods in Computer Science 8, 2012 | 56 | 2012 |
| XPath evaluation in linear time M Bojańczyk, P Parys Journal of the ACM (JACM) 58 (4), 1-33, 2011 | 52 | 2011 |
| Expressive power of pebble automata M Bojańczyk, M Samuelides, T Schwentick, L Segoufin International Colloquium on Automata, Languages, and Programming, 157-168, 2006 | 52 | 2006 |
