Slawomir Lasota

142 papers A* 19A 3B 27C 1Journal 73Unranked 17
YearRankTypeTitle / Venue / Authors
2026 A conf
One-Clock Synthesis Problems.
STACS
Slawomir Lasota, Mathieu Lehaut, Julie Parreaux, Radoslaw Piórkowski
2026 J jnl
One-clock synthesis problems.
CoRR
Slawomir Lasota, Mathieu Lehaut, Julie Parreaux, Radoslaw Piórkowski
2025 J jnl
Orbit-finite Linear Programming.
J. ACM
Arka Ghosh, Piotr Hofman, Slawomir Lasota
2025 A* conf
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests.
LICS
Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota
2025 J jnl
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests.
CoRR
Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota
2025 A* conf
Reachability in 3-VASS Is Elementary.
ICALP
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski
2025 J jnl
Reachability in 3-VASS is Elementary.
CoRR
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski
2025 B conf
Reachability in Symmetric VASS.
MFCS
Lukasz Kaminski, Slawomir Lasota
2025 J jnl
Reachability in symmetric VASS.
CoRR
Lukasz Kaminski, Slawomir Lasota
2025 J jnl
Report on FSTTCS 2024.
ACM SIGLOG News
Slawomir Lasota
2024 — ed.
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024, Gandhinagar, Gujarat, India, December 16-18, 2024
FSTTCS
Siddharth Barman, Slawomir Lasota
2024 B conf
Bi-Reachability in Petri Nets with Data.
CONCUR
Lukasz Kaminski, Slawomir Lasota
2024 J jnl
Bi-reachability in Petri nets with data.
CoRR
Lukasz Kaminski, Slawomir Lasota
2024 A* conf
Equivariant ideals of polynomials.
LICS
Arka Ghosh, Slawomir Lasota
2024 J jnl
Equivariant ideals of polynomials.
CoRR
Arka Ghosh, Slawomir Lasota
2024 J jnl
Preface.
Fundam. Informaticae
Robert Lorenz, Slawomir Lasota
2023 — conf
New Lower Bounds for Reachability in Vector Addition Systems.
FSTTCS
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
2023 J jnl
New Lower Bounds for Reachability in Vector Addition Systems.
CoRR
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
2023 A* conf
Orbit-finite linear programming.
LICS
Arka Ghosh, Piotr Hofman, Slawomir Lasota
2023 J jnl
Orbit-finite linear programming.
CoRR
Arka Ghosh, Piotr Hofman, Slawomir Lasota
2022 B ed.
33rd International Conference on Concurrency Theory, CONCUR 2022, Warsaw, Poland, September 12-16, 2022
CONCUR
Bartek Klin, Slawomir Lasota, Anca Muscholl
2022 J jnl
Determinisability of register and timed automata.
Log. Methods Comput. Sci.
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
2022 A conf
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem.
STACS
Slawomir Lasota
2022 A* conf
Solvability of orbit-finite systems of linear equations.
LICS
Arka Ghosh, Piotr Hofman, Slawomir Lasota
2022 J jnl
Solvability of orbit-finite systems of linear equations.
CoRR
Arka Ghosh, Piotr Hofman, Slawomir Lasota
2021 J jnl
A lower bound for the coverability problem in acyclic pushdown VAS.
Inf. Process. Lett.
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
2021 J jnl
Determinisability of register and timed automata.
CoRR
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
2021 J jnl
Improved Ackermannian lower bound for the VASS reachability problem.
CoRR
Slawomir Lasota
2021 A* conf
Improved Lower Bounds for Reachability in Vector Addition Systems.
ICALP
Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski
2021 B conf
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages.
FoSSaCS
Bartek Klin, Slawomir Lasota, Szymon Torunczyk
2021 — conf
Parikh Images of Register Automata.
FSTTCS
Slawomir Lasota, Mohnish Pattathurajan
2021 A* conf
Parikh's theorem for infinite alphabets.
LICS
Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan
2021 J jnl
Parikh's theorem for infinite alphabets.
CoRR
Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan
2021 J jnl
Preface.
Fundam. Informaticae
Susanna Donatelli, Stefan Haar, Slawomir Lasota
2021 J jnl
Preface.
Fundam. Informaticae
Ryszard Janicki, Slawomir Lasota, Natalia Sidorova
2021 J jnl
Preface.
Inf. Comput.
Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov
2021 J jnl
Reachability relations of timed pushdown automata.
J. Comput. Syst. Sci.
Lorenzo Clemente, Slawomir Lasota
2021 J jnl
The Reachability Problem for Petri Nets Is Not Elementary.
J. ACM
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 B conf
Determinisability of One-Clock Timed Automata.
CONCUR
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
2020 J jnl
Determinisability of one-clock timed automata.
CoRR
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
2020 B conf
Reachability in Fixed Dimension Vector Addition Systems with States.
CONCUR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 J jnl
Reachability in fixed dimension vector addition systems with states.
CoRR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 J jnl
Reachability relations of timed pushdown automata.
CoRR
Lorenzo Clemente, Slawomir Lasota
2020 A* conf
Timed Games and Deterministic Separability.
ICALP
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
2020 J jnl
Timed games and deterministic separability.
CoRR
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
2020 J jnl
WQO dichotomy for 3-graphs.
Inf. Comput.
Slawomir Lasota, Radoslaw Piórkowski
2019 J jnl
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.
ACM Trans. Comput. Log.
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2019 J jnl
Definable isomorphism problem.
Log. Methods Comput. Sci.
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2019 B conf
New Pumping Technique for 2-Dimensional VASS.
MFCS
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
2019 J jnl
New Pumping Technique for 2-dimensional VASS.
CoRR
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
2019 J jnl
Regular Separability of One Counter Automata.
Log. Methods Comput. Sci.
Wojciech Czerwinski, Slawomir Lasota
2019 A* conf
The reachability problem for Petri nets is not elementary.
STOC
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2018 A* conf
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms.
ICALP
Lorenzo Clemente, Slawomir Lasota
2018 J jnl
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms.
CoRR
Lorenzo Clemente, Slawomir Lasota
2018 J jnl
Definable isomorphism problem.
CoRR
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2018 B conf
Linear Equations with Ordered Data.
CONCUR
Piotr Hofman, Slawomir Lasota
2018 J jnl
Linear Equations with Ordered Data.
CoRR
Piotr Hofman, Slawomir Lasota
2018 B conf
Regular Separability of Well-Structured Transition Systems.
CONCUR
Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan
2018 J jnl
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract).
CoRR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2018 J jnl
VASS reachability in three steps.
CoRR
Slawomir Lasota
2018 B conf
WQO Dichotomy for 3-Graphs.
FoSSaCS
Slawomir Lasota, Radoslaw Piórkowski
2018 J jnl
WQO dichotomy for 3-graphs.
CoRR
Slawomir Lasota, Radoslaw Piórkowski
2017 J jnl
Equivariant algorithms for constraint satisfaction problems over coset templates.
Inf. Process. Lett.
Slawomir Lasota
2017 J jnl
Regular Separability of One Counter Automata.
CoRR
Wojciech Czerwinski, Slawomir Lasota
2017 A* conf
Regular Separability of Parikh Automata.
ICALP
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2017 J jnl
Regular Separability of Well Structured Transition Systems.
CoRR
Wojciech Czerwinski, Slawomir Lasota
2017 A* conf
Regular separability of one counter automata.
LICS
Wojciech Czerwinski, Slawomir Lasota
2017 A conf
Separability of Reachability Sets of Vector Addition Systems.
STACS
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2017 A* conf
Timed pushdown automata and branching vector addition systems.
LICS
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2016 B conf
Coverability Trees for Petri Nets with Unordered Data.
FoSSaCS
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
2016 B conf
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture.
Petri Nets
Slawomir Lasota
2016 — conf
Homomorphism Problems for First-Order Definable Structures.
FSTTCS
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2016 J jnl
Regular Separability of Parikh Automata.
CoRR
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2016 J jnl
Relating timed and register automata.
Math. Struct. Comput. Sci.
Diego Figueira, Piotr Hofman, Slawomir Lasota
2016 J jnl
Separability of Reachability Sets of Vector Addition Systems.
CoRR
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2016 J jnl
Simulation Problems Over One-Counter Nets.
Log. Methods Comput. Sci.
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2016 J jnl
Undecidability of performance equivalence of Petri nets.
Theor. Comput. Sci.
Slawomir Lasota, Marcin Poturalski
2015 J jnl
Incremental test case generation using bounded model checking: an application to automatic rating.
Int. J. Softw. Tools Technol. Transf.
Grzegorz Anielak, Grzegorz Jakacki, Slawomir Lasota
2015 B conf
Reachability Analysis of First-order Definable Pushdown Systems.
CSL
Lorenzo Clemente, Slawomir Lasota
2015 — ed.
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings
RP
Mikolaj Bojanczyk, Slawomir Lasota, Igor Potapov
2015 J jnl
Reachability analysis of first-order definable pushdown systems.
CoRR
Lorenzo Clemente, Slawomir Lasota
2015 A* conf
Timed Pushdown Automata Revisited.
LICS
Lorenzo Clemente, Slawomir Lasota
2015 J jnl
Timed pushdown automata revisited.
CoRR
Lorenzo Clemente, Slawomir Lasota
2014 J jnl
Automata theory in nominal sets.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
2014 J jnl
Bounded width = strict width 2, for coset templates.
CoRR
Slawomir Lasota
2014 J jnl
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
Theory Comput. Syst.
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2014 — conf
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity.
CSL-LICS
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
2013 J jnl
Reachability Problem for Weak Multi-Pushdown Automata.
Log. Methods Comput. Sci.
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2013 — conf
Simulation Over One-counter Nets is PSPACE-Complete.
FSTTCS
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2013 J jnl
Simulation Over One-counter Nets is PSPACE-Complete.
CoRR
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2013 A* conf
Turing Machines with Atoms.
LICS
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
2012 — conf
A Machine-Independent Characterization of Timed Languages.
ICALP (2)
Mikolaj Bojanczyk, Slawomir Lasota
2012 J jnl
An extension of data automata that captures XPath
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Slawomir Lasota
2012 — conf
Fraenkel-Mostowski Sets with Non-homogeneous Atoms.
RP
Mikolaj Bojanczyk, Slawomir Lasota
2012 J jnl
Minimization of semilinear automata
CoRR
Mikolaj Bojanczyk, Slawomir Lasota
2012 — conf
Partially-commutative context-free languages
EXPRESS/SOS
Wojciech Czerwinski, Slawomir Lasota
2012 B conf
Reachability Problem for Weak Multi-Pushdown Automata.
CONCUR
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2012 J jnl
Tav4SB: integrating tools for analysis of kinetic models of biological systems.
BMC Syst. Biol.
Mikolaj Rybinski, Michal Lula, Pawel Banasik, Slawomir Lasota, Anna Gambin
2012 A* conf
Towards nominal computation.
POPL
Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
2011 A* conf
Automata with Group Actions.
LICS
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
2011 B conf
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
CONCUR
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2011 J jnl
Partially-commutative context-free processes: Expressibility and tractability.
Inf. Comput.
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
2011 — conf
Subset Seed Extension to Protein BLAST.
BIOINFORMATICS
Anna Gambin, Slawomir Lasota, Michal Startek, Maciej Sykulski, Laurent Noé, Gregory Kucherov
2010 A* conf
An Extension of Data Automata that Captures XPath.
LICS
Mikolaj Bojanczyk, Slawomir Lasota
2010 — conf
Fast equivalence-checking for normed context-free processes.
FSTTCS
Wojciech Czerwinski, Slawomir Lasota
2010 J jnl
Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput.
Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa
2010 — conf
Relating timed and register automata
EXPRESS
Diego Figueira, Piotr Hofman, Slawomir Lasota
2009 J jnl
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system.
Inf. Process. Lett.
Slawomir Lasota
2009 — conf
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences.
INFINITY
Sibylle B. Fröschle, Slawomir Lasota
2009 J jnl
On Subset Seeds for Protein Alignment.
IEEE ACM Trans. Comput. Biol. Bioinform.
Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov
2009 B conf
Partially-Commutative Context-Free Processes.
CONCUR
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
2009 J jnl
Undecidability of performance equivalence of Petri nets.
CoRR
Slawomir Lasota, Marcin Poturalski
2008 J jnl
Alternating timed automata.
ACM Trans. Comput. Log.
Slawomir Lasota, Igor Walukiewicz
2008 — conf
Efficient Seeding Techniques for Protein Similarity Search.
BIRD
Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov
2008 J jnl
Logical relations for monadic types.
Math. Struct. Comput. Sci.
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
2007 J jnl
Causality versus true-concurrency.
Theor. Comput. Sci.
Sibylle B. Fröschle, Slawomir Lasota
2006 J jnl
Analyzing Stationary States of Gene Regulatory Network Using Petri Nets.
Silico Biol.
Anna Gambin, Slawomir Lasota, Michai Rutkowski
2006 J jnl
Decidability of performance equivalence for basic parallel processes.
Theor. Comput. Sci.
Slawomir Lasota
2006 B conf
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.
MFCS
Slawomir Lasota, Wojciech Rytter
2006 J jnl
On Completeness of Logical Relations for Monadic Types
CoRR
Slawomir Lasota, David Nowak, Yu Zhang
2006 — conf
On Completeness of Logical Relations for Monadic Types.
ASIAN
Slawomir Lasota, David Nowak, Yu Zhang
2005 J jnl
Alternating Timed Automata
CoRR
Slawomir Lasota, Igor Walukiewicz
2005 B conf
Alternating Timed Automata.
FoSSaCS
Slawomir Lasota, Igor Walukiewicz
2005 — conf
Causality Versus True-Concurrency.
EXPRESS
Sibylle B. Fröschle, Slawomir Lasota
2005 B conf
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.
CONCUR
Sibylle B. Fröschle, Slawomir Lasota
2005 J jnl
Logical Relations for Monadic Types
CoRR
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
2005 J jnl
Positron emission tomography by Markov chain Monte Carlo with auxiliary variables.
Pattern Recognit.
Jacek Koronacki, Slawomir Lasota, Wojciech Niemiro
2004 B conf
Complete Lax Logical Relations for Cryptographic Lambda-Calculi.
CSL
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang
2003 B conf
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.
MFCS
Slawomir Lasota
2003 J jnl
A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise.
Pattern Recognit.
Slawomir Lasota, Wojciech Niemiro
2002 J jnl
Coalgebra morphisms subsume open maps.
Theor. Comput. Sci.
Slawomir Lasota
2002 C conf
Contextual alignment of biological sequences.
ECCB
Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz
2002 B conf
Decidability of Strong Bisimilarity for Timed BPP.
CONCUR
Slawomir Lasota
2002 B conf
Logical Relations for Monadic Types.
CSL
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
2001 J jnl
On Different Models for Packet Flow in Multistage Interconnection Networks.
Fundam. Informaticae
Martin Dietzfelbinger, Anna Gambin, Slawomir Lasota
2000 B conf
Behavioural Constructor Implementation for Regular Algebras.
LPAR
Slawomir Lasota
2000 B conf
Finitary Observations in Regular Algebras.
SOFSEM
Slawomir Lasota
1999 — conf
Coalgebra morphisms subsume open maps.
CMCS
Slawomir Lasota
1998 A* conf
Partial-Congruence Factorization of Bisimilarity Induced by Open Maps.
ICALP
Slawomir Lasota
1998 B conf
Weak Bisimilarity and Open Maps.
SOFSEM
Slawomir Lasota
1997 — conf
Open maps as a bridge between algebraic observational equivalence and bisimilarity.
WADT
Slawomir Lasota
1996 B conf
On the Semantics of Multistage Interconnection Networks.
SOFSEM
Anna Gambin, Slawomir Lasota