Szymon Toruńczyk
Szymon Toruńczyk
Verified email at mimuw.edu.pl - Homepage
TitleCited byYear
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
582010
Turing machines with atoms
M Bojanczyk, B Klin, S Lasota, S Torunczyk
Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer …, 2013
442013
Weak MSO+ U over infinite trees
M Bojanczyk, S Torunczyk
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012
412012
Languages of profinite words and the limitedness problem
S Toruńczyk
PhD thesis, Warsaw University, 2011
272011
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
252011
Imperative programming in sets with atoms
M Bojanczyk, S Torunczyk
LIPIcs-Leibniz International Proceedings in Informatics 18, 2012
222012
Deterministic automata and extensions of weak mso
M Bojanczyk, S Torunczyk
LIPIcs-Leibniz International Proceedings in Informatics 4, 2009
222009
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
19*2016
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
132013
Locally finite constraint satisfaction problems
B Klin, E Kopczynski, J Ochremiak, S Torunczyk
Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer …, 2015
122015
LOIS: syntax and semantics
E Kopczyński, S Toruńczyk
ACM SIGPLAN Notices 52 (1), 586-598, 2017
112017
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
112014
LOIS: an application of SMT solvers
E Kopczyński, S Toruńczyk
Procs. SMT Workshop 1716, 51-60, 2016
102016
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
102010
On the number of types in sparse graphs
M l Pilipczuk, S Siebertz, S Torunczyk
8*2017
Cost functions definable by min/max automata
T Colcombet, D Kuperberg, A Manuel, S Torunczyk
LIPIcs-Leibniz International Proceedings in Informatics 47, 2016
52016
Homomorphism problems for first-order definable structures
B Klin, S Lasota, J Ochremiak, S Torunczyk
LIPIcs-Leibniz International Proceedings in Informatics 65, 2016
42016
Entropy bounds for conjunctive queries with functional dependencies
T Gogacz, S Toruńczyk
arXiv preprint arXiv:1512.01808, 2015
42015
Weak MSO+ U over infinite trees (long version)
M Bojanczyk, S Torunczyk
URL http://www. mimuw. edu. pl/bojan/papers/wmsou-trees, 0
4
First-order interpretations of bounded expansion classes
J Gajarskı, S Kreutzer, J Nešetřil, PO de Mendez, M Pilipczuk, S Siebertz, ...
arXiv preprint arXiv:1810.02389, 2018
32018
The system can't perform the operation now. Try again later.
Articles 1–20