Travelled to:
1 × Austria
1 × Canada
1 × Denmark
1 × Germany
1 × Japan
1 × Poland
2 × USA
4 × United Kingdom
Collaborated with:
M.Bojanczyk B.Klin L.Clemente J.Goubault-Larrecq D.Nowak S.Torunczyk I.Walukiewicz ∅ J.Ochremiak L.Braud Y.Zhang
Talks about:
automata (4) machin (3) time (3) pushdown (2) relat (2) logic (2) ture (2) atom (2) cryptograph (1) constraint (1)
Person: Slawomir Lasota
DBLP: Lasota:Slawomir
Contributed to:
Wrote 12 papers:
- CSL-2015-ClementeL #analysis #automaton #first-order #reachability
- Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.
- LICS-2015-ClementeL #automaton #revisited
- Timed Pushdown Automata Revisited (LC, SL), pp. 738–749.
- LICS-CSL-2014-KlinLOT #complexity #constraints #problem #turing machine
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (BK, SL, JO, ST), p. 10.
- LICS-2013-BojanczykKLT #turing machine
- Turing Machines with Atoms (MB, BK, SL, ST), pp. 183–192.
- ICALP-v2-2012-BojanczykL #independence
- A Machine-Independent Characterization of Timed Languages (MB, SL), pp. 92–103.
- POPL-2012-BojanczykBKL #towards
- Towards nominal computation (MB, LB, BK, SL), pp. 401–412.
- LICS-2011-BojanczykKL #automaton
- Automata with Group Actions (MB, BK, SL), pp. 355–364.
- LICS-2010-BojanczykL #automaton #xpath
- An Extension of Data Automata that Captures XPath (MB, SL), pp. 243–252.
- FoSSaCS-2005-LasotaW #automaton
- Alternating Timed Automata (SL, IW), pp. 250–265.
- CSL-2004-Goubault-LarrecqLNZ #encryption #logic #λ-calculus
- Complete Lax Logical Relations for Cryptographic λ-Calculi (JGL, SL, DN, YZ), pp. 400–414.
- CSL-2002-Goubault-LarrecqLN #logic #monad
- Logical Relations for Monadic Types (JGL, SL, DN), pp. 553–568.
- ICALP-1998-Lasota #similarity
- Partial-Congruence Factorization of Bisimilarity Induced by Open Maps (SL), pp. 91–102.