| 2026 | STACS | One-Clock Synthesis Problems. | Slawomir Lasota, Mathieu Lehaut, Julie Parreaux, Radoslaw Pirkowski |
| 2025 | ICALP | Reachability in 3-VASS Is Elementary. | Wojciech Czerwinski, Ismal Jecker, Slawomir Lasota, Lukasz Orlikowski |
| 2025 | LICS | Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests. | Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota |
| 2025 | MFCS | Reachability in Symmetric VASS. | Lukasz Kaminski, Slawomir Lasota |
| 2024 | CONCUR | Bi-Reachability in Petri Nets with Data. | Lukasz Kaminski, Slawomir Lasota |
| 2024 | LICS | Equivariant ideals of polynomials. | Arka Ghosh, Slawomir Lasota |
| 2023 | LICS | Orbit-finite linear programming. | Arka Ghosh, Piotr Hofman, Slawomir Lasota |
| 2022 | ACIIDS | Machine Learning-Based Recommender System for Tweeting Factory in Industry 5.0 Paradigm. | Dariusz Gasior, Slawomir Lasota, Tomasz Kajdanowicz |
| 2022 | LICS | Solvability of orbit-finite systems of linear equations. | Arka Ghosh, Piotr Hofman, Slawomir Lasota |
| 2022 | MMAR | Improving the detection of noisy labels in image datasets using modified Confidence Learning. | Adam Popowicz, Krystian Radlak, Slawomir Lasota, Karolina Szczepankiewicz, Michal Szczepankiewicz |
| 2022 | STACS | Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. | Slawomir Lasota |
| 2021 | FOSSACS | Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. | Bartek Klin, Slawomir Lasota, Szymon Torunczyk |
| 2021 | ICALP | Improved Lower Bounds for Reachability in Vector Addition Systems. | Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski |
| 2021 | LICS | Parikh's theorem for infinite alphabets. | Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan |
| 2020 | CONCUR | Determinisability of One-Clock Timed Automata. | Lorenzo Clemente, Slawomir Lasota, Radoslaw Pirkowski |
| 2020 | CONCUR | Reachability in Fixed Dimension Vector Addition Systems with States. | Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Filip Mazowiecki |
| 2020 | ICALP | Timed Games and Deterministic Separability. | Lorenzo Clemente, Slawomir Lasota, Radoslaw Pirkowski |
| 2019 | MFCS | New Pumping Technique for 2-Dimensional VASS. | Wojciech Czerwinski, Slawomir Lasota, Christof Lding, Radoslaw Pirkowski |
| 2019 | STOC | The reachability problem for Petri nets is not elementary. | Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Filip Mazowiecki |
| 2018 | CONCUR | Regular Separability of Well-Structured Transition Systems. | Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan |
| 2018 | CONCUR | Linear Equations with Ordered Data. | Piotr Hofman, Slawomir Lasota |
| 2018 | FOSSACS | WQO Dichotomy for 3-Graphs. | Slawomir Lasota, Radoslaw Pirkowski |
| 2018 | ICALP | Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. | Lorenzo Clemente, Slawomir Lasota |
| 2017 | ICALP | Regular Separability of Parikh Automata. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2017 | LICS | Timed pushdown automata and branching vector addition systems. | Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki |
| 2017 | LICS | Regular separability of one counter automata. | Wojciech Czerwinski, Slawomir Lasota |
| 2017 | STACS | Separability of Reachability Sets of Vector Addition Systems. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2016 | FOSSACS | Coverability Trees for Petri Nets with Unordered Data. | Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Sylvain Schmitz, Patrick Totzke |
| 2015 | CSL | Reachability Analysis of First-order Definable Pushdown Systems. | Lorenzo Clemente, Slawomir Lasota |
| 2015 | LICS | Timed Pushdown Automata Revisited. | Lorenzo Clemente, Slawomir Lasota |
| 2014 | CSL | Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. | Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk |
| 2013 | LICS | Turing Machines with Atoms. | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk |
| 2012 | CONCUR | Reachability Problem for Weak Multi-Pushdown Automata. | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota |
| 2012 | ICALP | A Machine-Independent Characterization of Timed Languages. | Mikolaj Bojanczyk, Slawomir Lasota |
| 2012 | POPL | Towards nominal computation. | Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota |
| 2011 | CONCUR | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota |
| 2011 | LICS | Automata with Group Actions. | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota |
| 2010 | LICS | An Extension of Data Automata that Captures XPath. | Mikolaj Bojanczyk, Slawomir Lasota |
| 2009 | CONCUR | Partially-Commutative Context-Free Processes. | Wojciech Czerwinski, Sibylle Frschle, Slawomir Lasota |
| 2006 | MFCS | Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. | Slawomir Lasota, Wojciech Rytter |
| 2005 | CONCUR | Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. | Sibylle Frschle, Slawomir Lasota |
| 2005 | FOSSACS | Alternating Timed Automata. | Slawomir Lasota, Igor Walukiewicz |
| 2004 | CSL | Complete Lax Logical Relations for Cryptographic Lambda-Calculi. | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang |
| 2003 | MFCS | A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. | Slawomir Lasota |
| 2002 | CONCUR | Decidability of Strong Bisimilarity for Timed BPP. | Slawomir Lasota |
| 2002 | CSL | Logical Relations for Monadic Types. | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak |
| 2002 | ECCB | Contextual alignment of biological sequences. | Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz |
| 2000 | LPAR | Behavioural Constructor Implementation for Regular Algebras. | Slawomir Lasota |
| 2000 | SOFSEM | Finitary Observations in Regular Algebras. | Slawomir Lasota |
| 1998 | ICALP | Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. | Slawomir Lasota |
| 1998 | SOFSEM | Weak Bisimilarity and Open Maps. | Slawomir Lasota |
| 1996 | SOFSEM | On the Semantics of Multistage Interconnection Networks. | Anna Gambin, Slawomir Lasota |