On the Semantics of Multistage Interconnection Networks. - Anna Gambin; Slawomir Lasota 001 (SOFSEM, 1996)

Open maps as a bridge between algebraic observational equivalence and bisimilarity. - Slawomir Lasota 001 (WADT, 1997)

Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. - Slawomir Lasota 001 (ICALP, 1998)

Weak Bisimilarity and Open Maps. - Slawomir Lasota 001 (SOFSEM, 1998)

Behavioural Constructor Implementation for Regular Algebras. - Slawomir Lasota 001 (LPAR, 2000)

Finitary Observations in Regular Algebras. - Slawomir Lasota 001 (SOFSEM, 2000)

On Different Models for Packet Flow in Multistage Interconnection Networks. - Martin Dietzfelbinger; Anna Gambin; Slawomir Lasota 001 (Fundam. Informaticae, 2001)

Decidability of Strong Bisimilarity for Timed BPP. - Slawomir Lasota 001 (CONCUR, 2002)

Contextual alignment of biological sequences. - Anna Gambin; Slawomir Lasota 001; Radoslaw Szklarczyk; Jerzy Tiuryn; Jerzy Tyszkiewicz (ECCB, 2002)

Coalgebra morphisms subsume open maps. - Slawomir Lasota 001 (Theor. Comput. Sci., 2002)

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. - Slawomir Lasota 001 (MFCS, 2003)

A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise. - Slawomir Lasota 001; Wojciech Niemiro (Pattern Recognit., 2003)

Complete Lax Logical Relations for Cryptographic Lambda-Calculi. - Jean Goubault-Larrecq; Slawomir Lasota 001; David Nowak; Yu Zhang (CSL, 2004)

Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. - Sibylle B. Fröschle; Slawomir Lasota 001 (CONCUR, 2005)

Positron emission tomography by Markov chain Monte Carlo with auxiliary variables. - Jacek Koronacki; Slawomir Lasota 001; Wojciech Niemiro (Pattern Recognit., 2005)

On Completeness of Logical Relations for Monadic Types. - Slawomir Lasota 001; David Nowak; Yu Zhang (ASIAN, 2006)

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. - Slawomir Lasota 001; Wojciech Rytter (MFCS, 2006)

Analyzing Stationary States of Gene Regulatory Network Using Petri Nets. - Anna Gambin; Slawomir Lasota 001; Michai Rutkowski (Silico Biol., 2006)

Decidability of performance equivalence for basic parallel processes. - Slawomir Lasota 001 (Theor. Comput. Sci., 2006)

Causality versus true-concurrency. - Sibylle B. Fröschle; Slawomir Lasota 001 (Theor. Comput. Sci., 2007)

Efficient Seeding Techniques for Protein Similarity Search. - Mikhail A. Roytberg; Anna Gambin; Laurent Noé; Slawomir Lasota 001; Eugenia Furletova; Ewa Szczurek; Gregory Kucherov (BIRD, 2008)

Logical relations for monadic types. - Jean Goubault-Larrecq; Slawomir Lasota 001; David Nowak (Math. Struct. Comput. Sci., 2008)

Alternating timed automata. - Slawomir Lasota 001; Igor Walukiewicz (ACM Trans. Comput. Log., 2008)

Partially-Commutative Context-Free Processes. - Wojciech Czerwinski; Sibylle B. Fröschle; Slawomir Lasota 001 (CONCUR, 2009)

Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. - Sibylle B. Fröschle; Slawomir Lasota 001 (INFINITY, 2009)

EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system. - Slawomir Lasota 001 (Inf. Process. Lett., 2009)

On Subset Seeds for Protein Alignment. - Mikhail A. Roytberg; Anna Gambin; Laurent Noé; Slawomir Lasota 001; Eugenia Furletova; Ewa Szczurek; Gregory Kucherov (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Fast equivalence-checking for normed context-free processes. - Wojciech Czerwinski; Slawomir Lasota 001 (FSTTCS, 2010)

Relating timed and register automata - Diego Figueira; Piotr Hofman; Slawomir Lasota 001 (EXPRESS, 2010)

Non-interleaving bisimulation equivalences on Basic Parallel Processes. - Sibylle B. Fröschle; Petr Jancar; Slawomir Lasota 001; Zdenek Sawa (Inf. Comput., 2010)

Subset Seed Extension to Protein BLAST. - Anna Gambin; Slawomir Lasota 001; Michal Startek; Maciej Sykulski; Laurent Noé; Gregory Kucherov (BIOINFORMATICS, 2011)

Automata with Group Actions. - Mikolaj Bojanczyk; Bartek Klin; Slawomir Lasota 001 (LICS, 2011)

Partially-commutative context-free processes: Expressibility and tractability. - Wojciech Czerwinski; Sibylle B. Fröschle; Slawomir Lasota 001 (Inf. Comput., 2011)

A Machine-Independent Characterization of Timed Languages. - Mikolaj Bojanczyk; Slawomir Lasota 001 (ICALP (2), 2012)

Towards nominal computation. - Mikolaj Bojanczyk; Laurent Braud; Bartek Klin; Slawomir Lasota 001 (POPL, 2012)

Fraenkel-Mostowski Sets with Non-homogeneous Atoms. - Mikolaj Bojanczyk; Slawomir Lasota 001 (RP, 2012)

Tav4SB: integrating tools for analysis of kinetic models of biological systems. - Mikolaj Rybinski; Michal Lula; Pawel Banasik; Slawomir Lasota 001; Anna Gambin (BMC Syst. Biol., 2012)

An extension of data automata that captures XPath - Mikolaj Bojanczyk; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2012)

Partially-commutative context-free languages - Wojciech Czerwinski; Slawomir Lasota 001 (EXPRESS/SOS, 2012)

Minimization of semilinear automata - Mikolaj Bojanczyk; Slawomir Lasota 001 (CoRR, 2012)

Simulation Over One-counter Nets is PSPACE-Complete. - Piotr Hofman; Slawomir Lasota 001; Richard Mayr; Patrick Totzke (FSTTCS, 2013)

Turing Machines with Atoms. - Mikolaj Bojanczyk; Bartek Klin; Slawomir Lasota 001; Szymon Torunczyk (LICS, 2013)

Reachability Problem for Weak Multi-Pushdown Automata. - Wojciech Czerwinski; Piotr Hofman; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2013)

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. - Bartek Klin; Slawomir Lasota 001; Joanna Ochremiak; Szymon Torunczyk (CSL-LICS, 2014)

Automata theory in nominal sets. - Mikolaj Bojanczyk; Bartek Klin; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2014)

Bounded width = strict width 2, for coset templates. - Slawomir Lasota 001 (CoRR, 2014)

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. - Wojciech Czerwinski; Piotr Hofman; Slawomir Lasota 001 (Theory Comput. Syst., 2014)

Reachability Analysis of First-order Definable Pushdown Systems. - Lorenzo Clemente; Slawomir Lasota 001 (CSL, 2015)

Timed Pushdown Automata Revisited. - Lorenzo Clemente; Slawomir Lasota 001 (LICS, 2015)

Incremental test case generation using bounded model checking: an application to automatic rating. - Grzegorz Anielak; Grzegorz Jakacki; Slawomir Lasota 001 (Int. J. Softw. Tools Technol. Transf., 2015)

Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture. - Slawomir Lasota 001 (Petri Nets, 2016)

Coverability Trees for Petri Nets with Unordered Data. - Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Sylvain Schmitz; Patrick Totzke (FoSSaCS, 2016)

Homomorphism Problems for First-Order Definable Structures. - Bartek Klin; Slawomir Lasota 001; Joanna Ochremiak; Szymon Torunczyk (FSTTCS, 2016)

Simulation Problems Over One-Counter Nets. - Piotr Hofman; Slawomir Lasota 001; Richard Mayr; Patrick Totzke (Log. Methods Comput. Sci., 2016)

Undecidability of performance equivalence of Petri nets. - Slawomir Lasota 001; Marcin Poturalski (Theor. Comput. Sci., 2016)

Regular Separability of Parikh Automata. - Lorenzo Clemente; Wojciech Czerwinski; Slawomir Lasota 001; Charles Paperman (ICALP, 2017)

Timed pushdown automata and branching vector addition systems. - Lorenzo Clemente; Slawomir Lasota 001; Ranko Lazic 001; Filip Mazowiecki (LICS, 2017)

Separability of Reachability Sets of Vector Addition Systems. - Lorenzo Clemente; Wojciech Czerwinski; Slawomir Lasota 001; Charles Paperman (STACS, 2017)

Regular Separability of Well Structured Transition Systems. - Wojciech Czerwinski; Slawomir Lasota 001 (CoRR, 2017)

Equivariant algorithms for constraint satisfaction problems over coset templates. - Slawomir Lasota 001 (Inf. Process. Lett., 2017)

Regular Separability of Well-Structured Transition Systems. - Wojciech Czerwinski; Slawomir Lasota 001; Roland Meyer 001; Sebastian Muskalla; K. Narayan Kumar; Prakash Saivasan (CONCUR, 2018)

Linear Equations with Ordered Data. - Piotr Hofman; Slawomir Lasota 001 (CONCUR, 2018)

Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. - Lorenzo Clemente; Slawomir Lasota 001 (ICALP, 2018)

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (CoRR, 2018)

VASS reachability in three steps. - Slawomir Lasota 001 (CoRR, 2018)

New Pumping Technique for 2-Dimensional VASS. - Wojciech Czerwinski; Slawomir Lasota 001; Christof Löding; Radoslaw Piórkowski (MFCS, 2019)

Regular Separability of One Counter Automata. - Wojciech Czerwinski; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2019)

Definable isomorphism problem. - Khadijeh Keshvardoost; Bartek Klin; Slawomir Lasota 001; Joanna Ochremiak; Szymon Torunczyk (Log. Methods Comput. Sci., 2019)

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. - Lorenzo Clemente; Slawomir Lasota 001; Ranko Lazic 001; Filip Mazowiecki (ACM Trans. Comput. Log., 2019)

Determinisability of One-Clock Timed Automata. - Lorenzo Clemente; Slawomir Lasota 001; Radoslaw Piórkowski (CONCUR, 2020)

Reachability in Fixed Dimension Vector Addition Systems with States. - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (CONCUR, 2020)

Timed Games and Deterministic Separability. - Lorenzo Clemente; Slawomir Lasota 001; Radoslaw Piórkowski (ICALP, 2020)

WQO dichotomy for 3-graphs. - Slawomir Lasota 001; Radoslaw Piórkowski (Inf. Comput., 2020)

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. - Bartek Klin; Slawomir Lasota 001; Szymon Torunczyk (FoSSaCS, 2021)

Parikh Images of Register Automata. - Slawomir Lasota 001; Mohnish Pattathurajan (FSTTCS, 2021)

Improved Lower Bounds for Reachability in Vector Addition Systems. - Wojciech Czerwinski; Slawomir Lasota 001; Lukasz Orlikowski (ICALP, 2021)

Parikh's theorem for infinite alphabets. - Piotr Hofman; Marta Juzepczuk; Slawomir Lasota 001; Mohnish Pattathurajan (LICS, 2021)

Improved Ackermannian lower bound for the VASS reachability problem. - Slawomir Lasota 001 (CoRR, 2021)

Preface. - Susanna Donatelli; Stefan Haar; Slawomir Lasota 001 (Fundam. Informaticae, 2021)

Preface. - Ryszard Janicki; Slawomir Lasota 001; Natalia Sidorova (Fundam. Informaticae, 2021)

Preface. - Mikolaj Bojanczyk; Thomas Brihaye; Christoph Haase; Slawomir Lasota 001; Joël Ouaknine; Igor Potapov (Inf. Comput., 2021)

A lower bound for the coverability problem in acyclic pushdown VAS. - Matthias Englert; Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Juliusz Straszynski (Inf. Process. Lett., 2021)

The Reachability Problem for Petri Nets Is Not Elementary. - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (J. ACM, 2021)

Reachability relations of timed pushdown automata. - Lorenzo Clemente; Slawomir Lasota 001 (J. Comput. Syst. Sci., 2021)

Solvability of orbit-finite systems of linear equations. - Arka Ghosh 002; Piotr Hofman; Slawomir Lasota 001 (LICS, 2022)

Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. - Slawomir Lasota 001 (STACS, 2022)

Determinisability of register and timed automata. - Lorenzo Clemente; Slawomir Lasota 001; Radoslaw Piórkowski (Log. Methods Comput. Sci., 2022)

New Lower Bounds for Reachability in Vector Addition Systems. - Wojciech Czerwinski; Ismaël Jecker; Slawomir Lasota 001; Jérôme Leroux; Lukasz Orlikowski (FSTTCS, 2023)

Bi-Reachability in Petri Nets with Data. - Lukasz Kaminski; Slawomir Lasota 001 (CONCUR, 2024)

Equivariant ideals of polynomials. - Arka Ghosh 002; Slawomir Lasota 001 (LICS, 2024)

Preface. - Robert Lorenz 001; Slawomir Lasota 001 (Fundam. Informaticae, 2024)

Reachability in 3-VASS Is Elementary. - Wojciech Czerwinski; Ismaël Jecker; Slawomir Lasota 001; Lukasz Orlikowski (ICALP, 2025)

Reachability in Symmetric VASS. - Lukasz Kaminski; Slawomir Lasota 001 (MFCS, 2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests. - Roland Guttenberg; Wojciech Czerwinski; Slawomir Lasota 001 (CoRR, 2025)

Orbit-finite Linear Programming. - Arka Ghosh 002; Piotr Hofman; Slawomir Lasota 001 (J. ACM, 2025)

Report on FSTTCS 2024. - Slawomir Lasota 001 (ACM SIGLOG News, 2025)