Automata theory in nominal sets M Bojańczyk, B Klin, S Lasota arXiv preprint arXiv:1402.0897, 2014 | 146 | 2014 |

The reachability problem for Petri nets is not elementary W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki Journal of the ACM (JACM) 68 (1), 1-28, 2020 | 143 | 2020 |

Alternating timed automata S Lasota, I Walukiewicz ACM Transactions on Computational Logic (TOCL) 9 (2), 1-27, 2008 | 134 | 2008 |

Automata with group actions M Bojanczyk, B Klin, S Lasota 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 355-364, 2011 | 123 | 2011 |

Logical relations for monadic types J Goubault-Larrecq, S Lasota, D Nowak Mathematical Structures in Computer Science 18 (6), 1169-1217, 2008 | 79* | 2008 |

Towards nominal computation M Bojanczyk, L Braud, B Klin, S Lasota Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2012 | 71 | 2012 |

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 | 63 | 2013 |

Modelling the efficacy of hyperthermia treatment M Rybiński, Z Szymańska, S Lasota, A Gambin Journal of The Royal Society Interface 10 (88), 20130527, 2013 | 57 | 2013 |

An extension of data automata that captures XPath M Bojańczyk, S Lasota 2010 25th Annual IEEE Symposium on Logic in Computer Science, 243-252, 2010 | 55 | 2010 |

A machine-independent characterization of timed languages M Bojańczyk, S Lasota Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 45 | 2012 |

Relating timed and register automata D Figueira, P Hofman, S Lasota Mathematical Structures in Computer Science 26 (6), 993-1021, 2016 | 42 | 2016 |

Timed pushdown automata revisited L Clemente, S Lasota 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 738-749, 2015 | 40 | 2015 |

Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula D Grzebelus, S Lasota, T Gambin, G Kucherov, A Gambin BMC genomics 8 (1), 1-14, 2007 | 40 | 2007 |

On subset seeds for protein alignment M Roytberg, A Gambin, L Noé, S Lasota, E Furletova, E Szczurek, ... IEEE/ACM Transactions on Computational Biology and Bioinformatics 6 (3), 483-494, 2009 | 29 | 2009 |

Faster algorithm for bisimulation equivalence of normed context-free processes S Lasota, W Rytter Mathematical Foundations of Computer Science 2006: 31st International …, 2006 | 28 | 2006 |

Regular separability of one counter automata W Czerwiński, S Lasota 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 27 | 2017 |

Decidability border for Petri nets with data: WQO dichotomy conjecture S Lasota Application and Theory of Petri Nets and Concurrency: 37th International …, 2016 | 26 | 2016 |

Coverability trees for Petri nets with unordered data P Hofman, S Lasota, R Lazić, J Leroux, S Schmitz, P Totzke Foundations of Software Science and Computation Structures: 19th …, 2016 | 24 | 2016 |

Decidability of branching bisimulation on normed commutative context-free processes W Czerwiński, P Hofman, S Lasota CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011 | 23 | 2011 |

Regular separability of Parikh automata L Clemente, W Czerwiński, S Lasota, C Paperman arXiv preprint arXiv:1612.06233, 2016 | 21 | 2016 |