Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSlawomir Lasota 0001
Person information
- affiliation: University of Warsaw, Poland
Other persons with the same name
- Slawomir Lasota 0002
![[0000-0001-8179-7653]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8179-7653")
— Silesian University of Technology, Institute of Electronics, Gliwice, Poland - Slawomir Lasota 0003 — DSR, Wrocław, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c59]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. LICS 2023: 1-14- [i29]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. CoRR abs/2302.00802 (2023) - 2022
- [j34]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of register and timed automata. Log. Methods Comput. Sci. 18(2) (2022) - [c58]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. LICS 2022: 11:1-11:13 - [c57]Slawomir Lasota:
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. STACS 2022: 46:1-46:15 - [e2]Bartek Klin, Slawomir Lasota, Anca Muscholl:
33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. LIPIcs 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-246-4 [contents] - [i28]Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. CoRR abs/2201.09060 (2022) - 2021
- [j33]Susanna Donatelli, Stefan Haar, Slawomir Lasota:
Preface. Fundam. Informaticae 183(1-2) (2021) - [j32]Ryszard Janicki, Slawomir Lasota, Natalia Sidorova:
Preface. Fundam. Informaticae 183(3-4) (2021) - [j31]Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov:
Preface. Inf. Comput. 277: 104579 (2021) - [j30]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: 106079 (2021) - [j29]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): 7:1-7:28 (2021) - [j28]Lorenzo Clemente, Slawomir Lasota:
Reachability relations of timed pushdown automata. J. Comput. Syst. Sci. 117: 202-241 (2021) - [c56]Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. FoSSaCS 2021: 365-384 - [c55]Slawomir Lasota, Mohnish Pattathurajan:
Parikh Images of Register Automata. FSTTCS 2021: 50:1-50:14 - [c54]Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski:
Improved Lower Bounds for Reachability in Vector Addition Systems. ICALP 2021: 128:1-128:15 - [c53]Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. LICS 2021: 1-13 - [i27]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of register and timed automata. CoRR abs/2104.03690 (2021) - [i26]Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. CoRR abs/2104.12018 (2021) - [i25]Slawomir Lasota:
Improved Ackermannian lower bound for the VASS reachability problem. CoRR abs/2105.08551 (2021) - 2020
- [j27]Slawomir Lasota, Radoslaw Piórkowski:
WQO dichotomy for 3-graphs. Inf. Comput. 275: 104541 (2020) - [c52]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of One-Clock Timed Automata. CONCUR 2020: 42:1-42:17 - [c51]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR 2020: 48:1-48:21 - [c50]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Timed Games and Deterministic Separability. ICALP 2020: 121:1-121:16 - [i24]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in fixed dimension vector addition systems with states. CoRR abs/2001.04327 (2020) - [i23]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Timed games and deterministic separability. CoRR abs/2004.12868 (2020) - [i22]Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of one-clock timed automata. CoRR abs/2007.09340 (2020) - [i21]Lorenzo Clemente, Slawomir Lasota:
Reachability relations of timed pushdown automata. CoRR abs/2012.15291 (2020)
2010 – 2019
- 2019
- [j26]Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of One Counter Automata. Log. Methods Comput. Sci. 15(2) (2019) - [j25]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. Log. Methods Comput. Sci. 15(4) (2019) - [j24]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): 14:1-14:31 (2019) - [c49]Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski:
New Pumping Technique for 2-Dimensional VASS. MFCS 2019: 62:1-62:14 - [c48]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The reachability problem for Petri nets is not elementary. STOC 2019: 24-33 - [i20]Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski:
New Pumping Technique for 2-dimensional VASS. CoRR abs/1906.10494 (2019) - 2018
- [c47]Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. CONCUR 2018: 24:1-24:17 - [c46]Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan:
Regular Separability of Well-Structured Transition Systems. CONCUR 2018: 35:1-35:18 - [c45]Slawomir Lasota, Radoslaw Piórkowski:
WQO Dichotomy for 3-Graphs. FoSSaCS 2018: 548-564 - [c44]Lorenzo Clemente, Slawomir Lasota:
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. ICALP 2018: 118:1-118:14 - [i19]Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. CoRR abs/1802.06660 (2018) - [i18]Slawomir Lasota, Radoslaw Piórkowski:
WQO dichotomy for 3-graphs. CoRR abs/1802.07612 (2018) - [i17]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. CoRR abs/1802.08500 (2018) - [i16]Lorenzo Clemente, Slawomir Lasota:
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms. CoRR abs/1804.10772 (2018) - [i15]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs/1809.07115 (2018) - [i14]Slawomir Lasota:
VASS reachability in three steps. CoRR abs/1812.11966 (2018) - 2017
- [j23]Slawomir Lasota:
Equivariant algorithms for constraint satisfaction problems over coset templates. Inf. Process. Lett. 118: 44-52 (2017) - [c43]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. ICALP 2017: 117:1-117:13 - [c42]Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki:
Timed pushdown automata and branching vector addition systems. LICS 2017: 1-12 - [c41]Wojciech Czerwinski, Slawomir Lasota:
Regular separability of one counter automata. LICS 2017: 1-12 - [c40]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. STACS 2017: 24:1-24:14 - [i13]Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of One Counter Automata. CoRR abs/1701.02808 (2017) - [i12]Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of Well Structured Transition Systems. CoRR abs/1702.05334 (2017) - 2016
- [j22]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12(1) (2016) - [j21]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. Math. Struct. Comput. Sci. 26(6): 993-1021 (2016) - [j20]Slawomir Lasota, Marcin Poturalski:
Undecidability of performance equivalence of Petri nets. Theor. Comput. Sci. 655: 109-119 (2016) - [c39]Slawomir Lasota:
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture. Petri Nets 2016: 20-36 - [c38]Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - [c37]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Homomorphism Problems for First-Order Definable Structures. FSTTCS 2016: 14:1-14:15 - [i11]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. CoRR abs/1609.00214 (2016) - [i10]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. CoRR abs/1612.06233 (2016) - 2015
- [j19]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): 339-349 (2015) - [c36]Lorenzo Clemente, Slawomir Lasota:
Reachability Analysis of First-order Definable Pushdown Systems. CSL 2015: 244-259 - [c35]Lorenzo Clemente, Slawomir Lasota:
Timed Pushdown Automata Revisited. LICS 2015: 738-749 - [e1]Mikolaj Bojanczyk, Slawomir Lasota, Igor Potapov:
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings. Lecture Notes in Computer Science 9328, Springer 2015, ISBN 978-3-319-24536-2 [contents] - [i9]Lorenzo Clemente, Slawomir Lasota:
Timed pushdown automata revisited. CoRR abs/1503.02422 (2015) - [i8]Lorenzo Clemente, Slawomir Lasota:
Reachability analysis of first-order definable pushdown systems. CoRR abs/1504.02651 (2015) - 2014
- [j18]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014) - [j17]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55(1): 136-169 (2014) - [c34]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS 2014: 58:1-58:10 - [i7]Slawomir Lasota:
Bounded width = strict width 2, for coset templates. CoRR abs/1412.4020 (2014) - 2013
- [j16]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9(3) (2013) - [c33]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS 2013: 515-526 - [c32]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Turing Machines with Atoms. LICS 2013: 183-192 - [i6]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. CoRR abs/1310.6303 (2013) - 2012
- [j15]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: 25 (2012) - [j14]Mikolaj Bojanczyk, Slawomir Lasota:
An extension of data automata that captures XPath. Log. Methods Comput. Sci. 8(1) (2012) - [c31]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR 2012: 53-68 - [c30]Mikolaj Bojanczyk, Slawomir Lasota:
A Machine-Independent Characterization of Timed Languages. ICALP (2) 2012: 92-103 - [c29]Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota:
Towards nominal computation. POPL 2012: 401-412 - [c28]Mikolaj Bojanczyk, Slawomir Lasota:
Fraenkel-Mostowski Sets with Non-homogeneous Atoms. RP 2012: 1-5 - [c27]Wojciech Czerwinski, Slawomir Lasota:
Partially-commutative context-free languages. EXPRESS/SOS 2012: 35-48 - [i5]Mikolaj Bojanczyk, Slawomir Lasota:
Minimization of semilinear automata. CoRR abs/1210.4980 (2012) - 2011
- [j13]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209(5): 782-798 (2011) - [c26]Anna Gambin, Slawomir Lasota, Michal Startek, Maciej Sykulski, Laurent Noé, Gregory Kucherov:
Subset Seed Extension to Protein BLAST. BIOINFORMATICS 2011: 149-158 - [c25]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR 2011: 528-542 - [c24]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata with Group Actions. LICS 2011: 355-364 - 2010
- [j12]Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa:
Non-interleaving bisimulation equivalences on Basic Parallel Processes. Inf. Comput. 208(1): 42-62 (2010) - [c23]Wojciech Czerwinski, Slawomir Lasota:
Fast equivalence-checking for normed context-free processes. FSTTCS 2010: 260-271 - [c22]Mikolaj Bojanczyk, Slawomir Lasota:
An Extension of Data Automata that Captures XPath. LICS 2010: 243-252 - [c21]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. EXPRESS 2010: 61-75
2000 – 2009
- 2009
- [j11]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): 850-855 (2009) - [j10]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): 483-494 (2009) - [c20]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-Commutative Context-Free Processes. CONCUR 2009: 259-273 - [c19]Sibylle B. Fröschle, Slawomir Lasota:
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. INFINITY 2009: 17-42 - [i4]Slawomir Lasota, Marcin Poturalski:
Undecidability of performance equivalence of Petri nets. CoRR abs/0910.5819 (2009) - 2008
- [j9]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical relations for monadic types. Math. Struct. Comput. Sci. 18(6): 1169-1217 (2008) - [j8]Slawomir Lasota, Igor Walukiewicz:
Alternating timed automata. ACM Trans. Comput. Log. 9(2): 10:1-10:27 (2008) - [c18]Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov:
Efficient Seeding Techniques for Protein Similarity Search. BIRD 2008: 466-478 - 2007
- [j7]Sibylle B. Fröschle, Slawomir Lasota:
Causality versus true-concurrency. Theor. Comput. Sci. 386(3): 169-187 (2007) - 2006
- [j6]Anna Gambin, Slawomir Lasota, Michai Rutkowski:
Analyzing Stationary States of Gene Regulatory Network Using Petri Nets. Silico Biol. 6(1-2): 93-109 (2006) - [j5]Slawomir Lasota:
Decidability of performance equivalence for basic parallel processes. Theor. Comput. Sci. 360(1-3): 172-192 (2006) - [c17]Slawomir Lasota, David Nowak, Yu Zhang:
On Completeness of Logical Relations for Monadic Types. ASIAN 2006: 223-230 - [c16]Slawomir Lasota, Wojciech Rytter:
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. MFCS 2006: 646-657 - [i3]Slawomir Lasota, David Nowak, Yu Zhang:
On Completeness of Logical Relations for Monadic Types. CoRR abs/cs/0612106 (2006) - 2005
- [j4]Jacek Koronacki, Slawomir Lasota, Wojciech Niemiro:
Positron emission tomography by Markov chain Monte Carlo with auxiliary variables. Pattern Recognit. 38(2): 241-250 (2005) - [c15]Sibylle B. Fröschle, Slawomir Lasota:
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. CONCUR 2005: 263-277 - [c14]Slawomir Lasota, Igor Walukiewicz:
Alternating Timed Automata. FoSSaCS 2005: 250-265 - [c13]Sibylle B. Fröschle, Slawomir Lasota:
Causality Versus True-Concurrency. EXPRESS 2005: 3-18 - [i2]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical Relations for Monadic Types. CoRR abs/cs/0511006 (2005) - [i1]Slawomir Lasota, Igor Walukiewicz:
Alternating Timed Automata. CoRR abs/cs/0512031 (2005) - 2004
- [c12]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang:
Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414 - 2003
- [j3]Slawomir Lasota, Wojciech Niemiro:
A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise. Pattern Recognit. 36(4): 931-941 (2003) - [c11]Slawomir Lasota:
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. MFCS 2003: 521-530 - 2002
- [j2]Slawomir Lasota:
Coalgebra morphisms subsume open maps. Theor. Comput. Sci. 280(1-2): 123-135 (2002) - [c10]Slawomir Lasota:
Decidability of Strong Bisimilarity for Timed BPP. CONCUR 2002: 562-578 - [c9]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical Relations for Monadic Types. CSL 2002: 553-568 - [c8]Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz:
Contextual alignment of biological sequences. ECCB 2002: 116-127 - 2001
- [j1]Martin Dietzfelbinger, Anna Gambin, Slawomir Lasota:
On Different Models for Packet Flow in Multistage Interconnection Networks. Fundam. Informaticae 46(4): 287-314 (2001) - 2000
- [c7]Slawomir Lasota:
Behavioural Constructor Implementation for Regular Algebras. LPAR 2000: 54-69 - [c6]Slawomir Lasota:
Finitary Observations in Regular Algebras. SOFSEM 2000: 402-410
1990 – 1999
- 1999
- [c5]Slawomir Lasota:
Coalgebra morphisms subsume open maps. CMCS 1999: 23 - 1998
- [c4]Slawomir Lasota:
Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. ICALP 1998: 91-102 - [c3]Slawomir Lasota:
Weak Bisimilarity and Open Maps. SOFSEM 1998: 381-388 - 1997
- [c2]Slawomir Lasota:
Open maps as a bridge between algebraic observational equivalence and bisimilarity. WADT 1997: 285-299 - 1996
- [c1]