Travelled to:1 × Australia
1 × Austria
1 × Canada
1 × Croatia
1 × Greece
1 × Hungary
1 × Japan
1 × USA
2 × France
Collaborated with:∅ M.Bojanczyk I.Walukiewicz S.Torunczyk W.Czerwinski W.Martens M.Przybylko A.Blumensath T.Colcombet D.Kuperberg M.V.Boom
Talks about:automata (3) evalu (3) time (3) contain (2) collaps (2) system (2) linear (2) logic (2) weak (2) tree (2)
Person: Pawel Parys
DBLP: Parys:Pawel
Contributed to:
2015
2014
2014
20122012
201020092009
2008200820162020Wrote 12 papers:
- PODS-2015-CzerwinskiMPP
- The (Almost) Complete Guide to Tree Pattern Containment (WC, WM, PP, MP), pp. 117–130.
- FLOPS-2014-Parys #how #question
- How Many Numbers Can a λ-Term Contain? (PP), pp. 302–318.
- LICS-CSL-2014-BlumensathCKPB #automaton #infinity #logic
- Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.
- CSL-2012-Parys #automaton
- Variants of Collapsible Pushdown Systems (PP), pp. 500–515.
- LICS-2012-Parys #on the
- On the Significance of the Collapse Operation (PP), pp. 521–530.
- ICALP-v1-2010-BojanczykP #automaton #evaluation #nondeterminism #performance #using
- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (MB, PP), pp. 515–526.
- ICALP-v2-2009-ParysW #automaton
- Weak Alternating Timed Automata (PP, IW), pp. 273–284.
- PODS-2009-Parys #complexity #evaluation #linear #polynomial #xpath
- XPath evaluation in linear time with polynomial combined complexity (PP), pp. 55–64.
- FoSSaCS-2008-Parys #commutative #equation #finite
- Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.
- PODS-2008-BojanczykP #evaluation #linear #xpath
- XPath evaluation in linear time (MB, PP), pp. 241–250.
- CSL-2016-ParysT #logic #modelling #λ-calculus
- Models of Lambda-Calculus and the Weak MSO Logic (PP, ST), p. 12.
- CSL-2020-Parys #algorithm #game studies
- Parity Games: Another View on Lehtinen's Algorithm (PP), p. 15.