Slawomir Lasota

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 64

Top Venues

CoRR

LICS

CONCUR

Log. Methods Comput. Sci.

Publications

Arka Ghosh, Slawomir Lasota
Equivariant ideals of polynomials. LICS (2024)
Lukasz Kaminski, Slawomir Lasota
Bi-Reachability in Petri Nets with Data. CONCUR (2024)
Lukasz Kaminski, Slawomir Lasota
Bi-reachability in Petri nets with data. CoRR (2024)
Arka Ghosh, Slawomir Lasota
Equivariant ideals of polynomials. CoRR (2024)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Orbit-finite linear programming. LICS (2023)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. CoRR (2023)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Orbit-finite linear programming. CoRR (2023)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS (2023)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Solvability of orbit-finite systems of linear equations. CoRR (2022)
Arka Ghosh, Piotr Hofman, Slawomir Lasota
Solvability of orbit-finite systems of linear equations. LICS (2022)
Slawomir Lasota
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. STACS (2022)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of register and timed automata. Log. Methods Comput. Sci. 18 (2) (2022)
Susanna Donatelli, Stefan Haar, Slawomir Lasota
Preface. Fundam. Informaticae 183 (1-2) (2021)
Lorenzo Clemente, Slawomir Lasota
Reachability relations of timed pushdown automata. J. Comput. Syst. Sci. 117 (2021)
Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan
Parikh's theorem for infinite alphabets. CoRR (2021)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of register and timed automata. CoRR (2021)
Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan
Parikh's theorem for infinite alphabets. LICS (2021)
Bartek Klin, Slawomir Lasota, Szymon Torunczyk
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. FoSSaCS (2021)
Ryszard Janicki, Slawomir Lasota, Natalia Sidorova
Preface. Fundam. Informaticae 183 (3-4) (2021)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68 (1) (2021)
Slawomir Lasota, Mohnish Pattathurajan
Parikh Images of Register Automata. FSTTCS (2021)
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. 167 (2021)
Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov
Preface. Inf. Comput. 277 (2021)
Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski
Improved Lower Bounds for Reachability in Vector Addition Systems. ICALP (2021)
Slawomir Lasota
Improved Ackermannian lower bound for the VASS reachability problem. CoRR (2021)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Timed Games and Deterministic Separability. ICALP (2020)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of One-Clock Timed Automata. CONCUR (2020)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of one-clock timed automata. CoRR (2020)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Timed games and deterministic separability. CoRR (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in fixed dimension vector addition systems with states. CoRR (2020)
Slawomir Lasota, Radoslaw Piórkowski
WQO dichotomy for 3-graphs. Inf. Comput. 275 (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR (2020)
Lorenzo Clemente, Slawomir Lasota
Reachability relations of timed pushdown automata. CoRR (2020)
Wojciech Czerwinski, Slawomir Lasota
Regular Separability of One Counter Automata. Log. Methods Comput. Sci. 15 (2) (2019)
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. 20 (3) (2019)
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
New Pumping Technique for 2-Dimensional VASS. MFCS (2019)
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Definable isomorphism problem. Log. Methods Comput. Sci. 15 (4) (2019)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The reachability problem for Petri nets is not elementary. STOC (2019)
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
New Pumping Technique for 2-dimensional VASS. CoRR (2019)
Piotr Hofman, Slawomir Lasota
Linear Equations with Ordered Data. CoRR (2018)
Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Definable isomorphism problem. CoRR (2018)
Piotr Hofman, Slawomir Lasota
Linear Equations with Ordered Data. CONCUR (2018)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR (2018)
Slawomir Lasota, Radoslaw Piórkowski
WQO Dichotomy for 3-Graphs. FoSSaCS (2018)
Lorenzo Clemente, Slawomir Lasota
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms. CoRR (2018)
Slawomir Lasota
VASS reachability in three steps. CoRR (2018)
Slawomir Lasota, Radoslaw Piórkowski
WQO dichotomy for 3-graphs. CoRR (2018)
Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan
Regular Separability of Well-Structured Transition Systems. CONCUR (2018)
Lorenzo Clemente, Slawomir Lasota
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. ICALP (2018)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Regular Separability of Parikh Automata. ICALP (2017)
Wojciech Czerwinski, Slawomir Lasota
Regular separability of one counter automata. LICS (2017)
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Timed pushdown automata and branching vector addition systems. LICS (2017)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Separability of Reachability Sets of Vector Addition Systems. STACS (2017)
Wojciech Czerwinski, Slawomir Lasota
Regular Separability of One Counter Automata. CoRR (2017)
Slawomir Lasota
Equivariant algorithms for constraint satisfaction problems over coset templates. Inf. Process. Lett. 118 (2017)
Wojciech Czerwinski, Slawomir Lasota
Regular Separability of Well Structured Transition Systems. CoRR (2017)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Regular Separability of Parikh Automata. CoRR (2016)
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS (2016)
Diego Figueira, Piotr Hofman, Slawomir Lasota
Relating timed and register automata. Math. Struct. Comput. Sci. 26 (6) (2016)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12 (1) (2016)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Separability of Reachability Sets of Vector Addition Systems. CoRR (2016)
Slawomir Lasota
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture. Petri Nets (2016)
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Homomorphism Problems for First-Order Definable Structures. FSTTCS (2016)
Slawomir Lasota, Marcin Poturalski
Undecidability of performance equivalence of Petri nets. Theor. Comput. Sci. 655 (2016)
Lorenzo Clemente, Slawomir Lasota
Reachability analysis of first-order definable pushdown systems. CoRR (2015)
Lorenzo Clemente, Slawomir Lasota
Timed Pushdown Automata Revisited. LICS (2015)
Grzegorz Anielak, Grzegorz Jakacki, Slawomir Lasota
Incremental test case generation using bounded model checking: an application to automatic rating. Int. J. Softw. Tools Technol. Transf. 17 (3) (2015)
Lorenzo Clemente, Slawomir Lasota
Reachability Analysis of First-order Definable Pushdown Systems. CSL (2015)
Lorenzo Clemente, Slawomir Lasota
Timed pushdown automata revisited. CoRR (2015)
Slawomir Lasota
Bounded width = strict width 2, for coset templates. CoRR (2014)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
Automata theory in nominal sets. Log. Methods Comput. Sci. 10 (3) (2014)
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS (2014)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55 (1) (2014)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Over One-counter Nets is PSPACE-Complete. CoRR (2013)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
Turing Machines with Atoms. LICS (2013)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS (2013)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9 (3) (2013)
Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
Towards nominal computation. POPL (2012)
Mikolaj Rybinski, Michal Lula, Pawel Banasik, Slawomir Lasota, Anna Gambin
Tav4SB: integrating tools for analysis of kinetic models of biological systems. BMC Syst. Biol. 6 (2012)
Mikolaj Bojanczyk, Slawomir Lasota
A Machine-Independent Characterization of Timed Languages. ICALP (2) (2012)
Wojciech Czerwinski, Slawomir Lasota
Partially-commutative context-free languages EXPRESS/SOS (2012)
Mikolaj Bojanczyk, Slawomir Lasota
Minimization of semilinear automata CoRR (2012)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR (2012)
Mikolaj Bojanczyk, Slawomir Lasota
An extension of data automata that captures XPath Log. Methods Comput. Sci. 8 (1) (2012)
Mikolaj Bojanczyk, Slawomir Lasota
Fraenkel-Mostowski Sets with Non-homogeneous Atoms. RP (2012)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR (2011)
Anna Gambin, Slawomir Lasota, Michal Startek, Maciej Sykulski, Laurent Noé, Gregory Kucherov
Subset Seed Extension to Protein BLAST. BIOINFORMATICS (2011)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
Automata with Group Actions. LICS (2011)
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209 (5) (2011)
Wojciech Czerwinski, Slawomir Lasota
Fast equivalence-checking for normed context-free processes. FSTTCS (2010)
Diego Figueira, Piotr Hofman, Slawomir Lasota
Relating timed and register automata EXPRESS (2010)
Mikolaj Bojanczyk, Slawomir Lasota
An Extension of Data Automata that Captures XPath. LICS (2010)
Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa
Non-interleaving bisimulation equivalences on Basic Parallel Processes. Inf. Comput. 208 (1) (2010)
Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov
On Subset Seeds for Protein Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 6 (3) (2009)
Slawomir Lasota
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system. Inf. Process. Lett. 109 (15) (2009)
Slawomir Lasota, Marcin Poturalski
Undecidability of performance equivalence of Petri nets. CoRR (2009)
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
Partially-Commutative Context-Free Processes. CONCUR (2009)
Sibylle B. Fröschle, Slawomir Lasota
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. INFINITY (2009)
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
Logical relations for monadic types. Math. Struct. Comput. Sci. 18 (6) (2008)
Slawomir Lasota, Igor Walukiewicz
Alternating timed automata. ACM Trans. Comput. Log. 9 (2) (2008)

Slawomir Lasota.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Slawomir Lasota