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 | 167 | 2020 |

Automata theory in nominal sets M Bojańczyk, B Klin, S Lasota Logical Methods in Computer Science 10, 2014 | 160 | 2014 |

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

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

Logical relations for monadic types J Goubault-Larrecq, S Lasota, D Nowak Mathematical Structures in Computer Science 18 (6), 1169-1217, 2008 | 84* | 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 | 69 | 2012 |

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

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 |

An extension of data automata that captures XPath M Bojańczyk, S Lasota Logical Methods in Computer Science 8, 2012 | 53 | 2012 |

A machine-independent characterization of timed languages M Bojańczyk, S Lasota International Colloquium on Automata, Languages, and Programming, 92-103, 2012 | 44 | 2012 |

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

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-14, 2007 | 39 | 2007 |

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

Decidability border for Petri nets with data: WQO dichotomy conjecture S Lasota International Conference on Applications and Theory of Petri Nets and …, 2016 | 31 | 2016 |

Regular separability of one counter automata W Czerwiński, S Lasota Logical Methods in Computer Science 15, 2019 | 30 | 2019 |

Coverability trees for Petri nets with unordered data P Hofman, S Lasota, R Lazić, J Leroux, S Schmitz, P Totzke International Conference on Foundations of Software Science and Computation …, 2016 | 29 | 2016 |

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 International Symposium on Mathematical Foundations of Computer Science, 646-657, 2006 | 28 | 2006 |

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

Regular separability of well structured transition systems W Czerwiński, S Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan arXiv preprint arXiv:1702.05334, 2017 | 24 | 2017 |