Follow
Szymon Toruńczyk
Title
Cited by
Cited by
Year
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
992010
Twin-width IV: ordered graphs and matrices
É Bonnet, U Giocanti, PO de Mendez, P Simon, S Thomassé, S Toruńczyk
Journal of the ACM 71 (3), 1-45, 2024
90*2024
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
722018
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
632013
Weak MSO+ U over infinite trees
M Bojanczyk, S Torunczyk
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012
562012
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
422011
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
36*2018
Stable graphs of bounded twin-width
J Gajarský, M Pilipczuk, S Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
352022
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
34*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
322013
Languages of profinite words and the limitedness problem
S Toruńczyk
PhD thesis, Warsaw University, 2011
302011
Deterministic automata and extensions of weak mso
M Bojanczyk, S Torunczyk
IARCS Annual Conference on Foundations of Software Technology and …, 2009
292009
Progressive algorithms for domination and independence
G Fabiański, M Pilipczuk, S Siebertz, S Toruńczyk
arXiv preprint arXiv:1811.06799, 2018
252018
Imperative programming in sets with atoms
M Bojanczyk, S Torunczyk
IARCS Annual Conference on Foundations of Software Technology and …, 2012
252012
LOIS: syntax and semantics
E Kopczyński, S Toruńczyk
ACM SIGPLAN Notices 52 (1), 586-598, 2017
242017
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
232015
Entropy Bounds for Conjunctive Queries with Functional Dependencies
T Gogacz, S Toruńczyk
20th International Conference on Database Theory, ICDT 2017 68, 15:1–15:17, 2017
212017
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
192016
Algorithms and data structures for first-order logic with connectivity under vertex failures
M Pilipczuk, N Schirrmacher, S Siebertz, S Toruńczyk, A Vigny
arXiv preprint arXiv:2111.03725, 2021
182021
LOIS: an application of SMT solvers
E Kopczyński, S Toruńczyk
Procs. SMT Workshop 1716, 51-60, 2016
182016
The system can't perform the operation now. Try again later.
Articles 1–20