| Energy and mean-payoff games with imperfect information A Degorre, L Doyen, R Gentilini, JF Raskin, S Toruńczyk International Workshop on Computer Science Logic, 260-274, 2010 | 80 | 2010 |
| 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 | 56 | 2013 |
| Weak MSO+ U over infinite trees M Bojanczyk, S Torunczyk STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012 | 50 | 2012 |
| First-Order Interpretations of Bounded Expansion Classes J Gajarsky, S Kreutzer, J Nesetril, P Ossona de Mendez, M Pilipczuk, ... 45th International Colloquium on Automata, Languages, and Programming …, 2018 | 40 | 2018 |
| Automata based verification over linearly ordered data domains L Segoufin, S Toruńczyk Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 81-92, 2011 | 31 | 2011 |
| The MSO+U Theory of (N,<) Is Undecidable M Bojanczyk, P Parys, S Toruńczyk Symposium on Theoretical Aspects of Computer Science (STACS2016) 47, 21:1--21:8, 2016 | 30* | 2016 |
| Languages of profinite words and the limitedness problem S Toruńczyk ICALP 2012, 377-389, 2012 | 27 | 2012 |
| Languages of profinite words and the limitedness problem S Toruńczyk PhD thesis, Warsaw University, 2011 | 27 | 2011 |
| Deterministic automata and extensions of weak mso M Bojanczyk, S Torunczyk IARCS Annual Conference on Foundations of Software Technology and …, 2009 | 26 | 2009 |
| Imperative programming in sets with atoms M Bojanczyk, S Torunczyk IARCS Annual Conference on Foundations of Software Technology and …, 2012 | 25 | 2012 |
| On the number of types in sparse graphs M Pilipczuk, S Siebertz, S Toruńczyk Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 24* | 2018 |
| Locally finite constraint satisfaction problems B Klin, E Kopczynski, J Ochremiak, S Torunczyk 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 475-486, 2015 | 24 | 2015 |
| Verification of database-driven systems via amalgamation M Bojańczyk, L Segoufin, S Toruńczyk Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2013 | 24 | 2013 |
| LOIS: syntax and semantics E Kopczyński, S Toruńczyk ACM SIGPLAN Notices 52 (1), 586-598, 2017 | 21 | 2017 |
| Turing machines with atoms, constraint satisfaction problems, and descriptive complexity B Klin, S Lasota, J Ochremiak, S Toruńczyk Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 15 | 2014 |
| LOIS: an application of SMT solvers E Kopczyński, S Toruńczyk Procs. SMT Workshop 1716, 51-60, 2016 | 14 | 2016 |
| Homomorphism problems for first-order definable structures B Klin, S Lasota, JR Ochremiak, SA Torunczyk 36th IARCS Annual Conference on Foundations of Software Technology and …, 2016 | 14 | 2016 |
| On the topological complexity of MSO+ U and related automata models S Hummel, M Skrzypczak, S Toruńczyk International Symposium on Mathematical Foundations of Computer Science, 429-440, 2010 | 12 | 2010 |
| Progressive algorithms for domination and independence G Fabiański, M Pilipczuk, S Siebertz, S Toruńczyk arXiv preprint arXiv:1811.06799, 2018 | 10 | 2018 |
| Cost functions definable by min/max automata T Colcombet, D Kuperberg, A Manuel, S Toruńczyk 33rd International Symposium on Theoretical Aspects of Computer Science …, 2016 | 9 | 2016 |
Mikołaj BojańczykUniwersytet WarszawskiVerifisert e-postadresse på mimuw.edu.pl
