Szymon Torunczyk
Szymon Toruńczyk
Person information
- unicode name: Szymon Toruńczyk
- affiliation: University of Warsaw, Institute of Informatics
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
- [c23]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [c22]Mikolaj Bojanczyk, Szymon Torunczyk:
On computability and tractability for infinite sets. LICS 2018: 145-154 - [c21]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Parameterized circuit complexity of model-checking on sparse structures. LICS 2018: 789-798 - [c20]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
On the number of types in sparse graphs. LICS 2018: 799-808 - [i9]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. CoRR abs/1802.08500 (2018) - [i8]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Parameterized circuit complexity of model checking first-order logic on sparse structures. CoRR abs/1805.03488 (2018) - [i7]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i6]Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. CoRR abs/1811.06799 (2018) - 2017
- [c19]Tomasz Gogacz, Szymon Torunczyk:
Entropy Bounds for Conjunctive Queries with Functional Dependencies. ICDT 2017: 15:1-15:17 - [c18]
- [i5]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
On Wideness and Stability. CoRR abs/1705.09336 (2017) - 2016
- [j2]Michal Pilipczuk, Szymon Torunczyk:
On Ultralimits of Sparse Graph Classes. Electr. J. Comb. 23(2): P2.32 (2016) - [c17]
- [c16]Pawel Parys, Szymon Torunczyk:
Models of Lambda-Calculus and the Weak MSO Logic. CSL 2016: 11:1-11:12 - [c15]Albert Atserias, Szymon Torunczyk:
Non-Homogenizable Classes of Finite Structures. CSL 2016: 16:1-16:16 - [c14]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Homomorphism Problems for First-Order Definable Structures. FSTTCS 2016: 14:1-14:15 - [c13]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U Theory of (N, <) Is Undecidable. STACS 2016: 21:1-21:8 - [c12]Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk:
Cost Functions Definable by Min/Max Automata. STACS 2016: 29:1-29:13 - [i4]Albert Atserias, Szymon Torunczyk:
Non-Homogenizable Classes of Finite Structures. CoRR abs/1605.01199 (2016) - 2015
- [c11]Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk:
Locally Finite Constraint Satisfaction Problems. LICS 2015: 475-486 - [i3]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U theory of (N, <) is undecidable. CoRR abs/1502.04578 (2015) - [i2]Michal Pilipczuk, Szymon Torunczyk:
On ultralimits of sparse graph classes. CoRR abs/1508.07256 (2015) - [i1]Tomasz Gogacz, Szymon Torunczyk:
Entropy bounds for conjunctive queries with functional dependencies. CoRR abs/1512.01808 (2015) - 2014
- [c10]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS 2014: 58:1-58:10 - 2013
- [j1]
- [c9]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Turing Machines with Atoms. LICS 2013: 183-192 - [c8]Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk:
Verification of database-driven systems via amalgamation. PODS 2013: 63-74 - 2012
- [c7]
- [c6]
- [c5]
- 2011
- [c4]Luc Segoufin, Szymon Torunczyk:
Automata based verification over linearly ordered data domains. STACS 2011: 81-92 - 2010
- [c3]Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk:
Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274 - [c2]Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk:
On the Topological Complexity of MSO+U and Related Automata Models. MFCS 2010: 429-440
2000 – 2009
- 2009
- [c1]Mikolaj Bojanczyk, Szymon Torunczyk:
Deterministic Automata and Extensions of Weak MSO. FSTTCS 2009: 73-84
Coauthor Index
last updated on 2019-01-11 22:22 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint