| ||
| 1. | An extension of data automata that captures XPath
LOGICAL METHODS IN COMPUTER SCIENCE Tom 8 Nr 1 r. 2012, str. (Artykuł) Mikołaj Bojańczyk, Sławomir Lasota | |
| 2. | Tav4SB: integrating tools for analysis of kinetic models of biological systems
BMC SYSTEMS BIOLOGY Tom 6 Nr 1 r. 2012, str. (Artykuł) Anna Gambin, Mikołaj Rybiński, Michał Lula, Sławomir Lasota, Paweł Banasik | |
| 3. | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 6901 r. 2011, str. 528-542 (Artykuł konferencyjny) Wojciech Czerwiński, Piotr Hofman, Sławomir Lasota | |
| 4. | Partially-commutative context-free processes: expressibility and tractability
INFORMATION AND COMPUTATION Tom 209 Nr 5 r. 2011, str. 782-798 (Artykuł) Wojciech Czerwiński, Sibylle Froeschle, Sławomir Lasota | |
| 5. | Non-interleaving bisimulation equivalences on Basic Parallel Processes
INFORMATION AND COMPUTATION Tom 208 Nr 1 r. 2010, str. 42-62 (Artykuł) Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota, Zdenek Sawa | |
| 6. | EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system
INFORMATION PROCESSING LETTERS Tom 109 Nr 15 r. 2009, str. 850-855 (Artykuł) Sławomir Lasota | |
| 7. | Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
Electronic Notes in Theoretical Computer Science Tom 239 r. 2009, str. 17-42 (Artykuł) Sibylle B. Fröschle, Sławomir Lasota | |
| 8. | On Subset Seeds for Protein Alignment
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS Tom 6 Nr 3 r. 2009, str. 483-494 (Artykuł) Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov | |
| 9. | Partially-Commutative Context-Free Processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 5710 r. 2009, str. 259-273 (Artykuł) Wojciech Czerwiński, Sibylle B. Fröschle, Sławomir Lasota | |
| 10. | Alternating timed automata
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC Tom 9 Nr 2 r. 2008, str. (Artykuł) Sławomir Lasota, Igor Walukiewicz | |
| 11. | Logical Relations for Monadic Types
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE Tom 18 Nr 6 r. 2008, str. 1169-1217 (Artykuł) Jean Goubault-Larrecq, Sławomir Lasota, David Nowak | |
| 12. | Causality Versus True-Concurrency
THEORETICAL COMPUTER SCIENCE Tom 386 r. 2007, str. 169-187 (Artykuł) Sibylle Froeschle, Sławomir Lasota | |
| 13. | Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula
BMC GENOMICS Tom 8 r. 2007, str. 409-409 (Artykuł) D. Grzebelus, Sławomir Lasota, T. Gambin, G. Kucherov, Anna Gambin | |
| 14. | Analyzing stationary states of gene regulatory network using Petri nets
IN SILICO BIOLOGY Tom 6 r. 2006, str. 10-10 (Artykuł) Anna Gambin, Sławomir Lasota, Michal Rutkowski | |
| 15. | Causality Versus True-Concurrency
Electronic Notes in Theoretical Computer Science Tom 154 Nr 3 r. 2006, str. 3-18 (Artykuł konferencyjny) Sibylle Froeschle, Sławomir Lasota | |
| 16. | Decidability of Performance Equivalence for Basic Parallel Processes
THEORETICAL COMPUTER SCIENCE Tom 360 r. 2006, str. 172-192 (Artykuł) Sławomir Lasota | |
| 17. | Faster algorithm for bisimulation equivalence of normed context-free processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 4162 r. 2006, str. 646-657 (Artykuł konferencyjny) Sławomir Lasota, Wojciech Rytter | |
| 18. | Alternating Timed Automata
LECTURE NOTES IN COMPUTER SCIENCE Tom 3441 r. 2005, str. 250-265 (Artykuł konferencyjny) Sławomir Lasota, Igor Walukiewicz | |
| 19. | Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
LECTURE NOTES IN COMPUTER SCIENCE Tom 3653 r. 2005, str. 263-277 (Artykuł konferencyjny) Sławomir Lasota, Sibylle Froeschle | |
| 20. | Petri Net + Nested Relational Calculus = Dataflow
LECTURE NOTES IN COMPUTER SCIENCE Tom 3760 r. 2005, str. 220-237 (Artykuł konferencyjny) Jan Hidders, Natalia Kwasnikowska, Sławomir Lasota, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche | |
| 21. | Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables
PATTERN RECOGNITION Tom 38 Nr 2 r. 2005, str. 241-250 (Artykuł) Jacek Koronacki, Sławomir Lasota, Wojciech Niemiro | |
| 22. | Complete lax logical relations for cryptographic lambda-calculi
LECTURE NOTES IN COMPUTER SCIENCE Tom 3210 r. 2004, str. 400-414 (Artykuł konferencyjny) Jean Goubault-Larrecq, Sławomir Lasota, David Nowak, Yu Zhang | |
| 23. | A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 2747 r. 2003, str. 521-530 (Artykuł konferencyjny) Sławomir Lasota | |
| 24. | A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise
PATTERN RECOGNITION Tom 36 r. 2003, str. 931-941 (Artykuł) Sławomir Lasota, Wojciech Niemiro | |
| 25. | Coalgebra morphisms subsume open maps
THEORETICAL COMPUTER SCIENCE Tom 280 r. 2002, str. 123-135 (Artykuł) Sławomir Lasota | |