Journals

• Goubault-Larrecq, J., Lasota, S., Nowak, D. Logical Relations for Monadic Types.
  Mathematical Structures in Computer Science, to appear.
  [ BibTex entry ]

• Lasota, S., Walukiewicz, I. Alternating Timed Automata.
  ACM Transactions on Computational Logic Vol. 9, No. 2, Article 10, 2008.
  [ BibTex entry ] [ on-line version ]

• Grzebelus, D., Lasota, S., Gambin, T., Kucherov, G., Gambin A. Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula.
  BMC Genomics 8:409, 2007.
  [ on-line version ] @BioMed Central Ltd

• Froeschle, S., Lasota, S. Causality Versus True-Concurrency.
  Theoretical Computer Science 386:169-187, 2007.
  [ BibTex entry ] @Elsevier

• Lasota, S. Decidability of Performance Equivalence for Basic Parallel Processes.
  Theoretical Computer Science 360:172-192, 2006.
  [ BibTex entry ] @Elsevier

• Gambin A., Lasota, S., Rutkowski, M. Analyzing stationary states of gene regulatory network using Petri nets.
  In Silico Biology 6, 0010, 2006.
  [ BibTex entry ] [ on-line version ]

• Koronacki, J., Lasota, S., Niemiro, W. Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables.
  Pattern Recognition, 38(2):241-250, 2005.
  [ BibTex entry ] [ online-version ] @Elsevier

• Lasota, S., Niemiro, W. A Version of the Swandsen-Wang Algorithm for Restoration of Images Degraded by Poisson Noise.
  Pattern Recognition 36(4):931-941, 2003.
  [ BibTex entry ] [ online-version ] @Elsevier

• Lasota, S. Coalgebra morphisms subsume open maps.
  Theoretical Computer Science 280:123-135, 2002.
  [ BibTex entry ] [ online-version ] @Elsevier

• Gambin, A., Lasota, S., Szklarczyk, R., Tiuryn, J., Tyszkiewicz, J. Contextual Alignment of Biological Sequences.
  Proc. ECCB'02, Bioinformatics 18:116-127, Oxford University Press, 2002.
  [ gzipped postscript ] [ BibTex entry ]

• Dietzfelbinger, M., Gambin, A., Lasota, S. On Different Models for Packet Flow in Multistage Interconnection Networks.
  Fundamenta Informaticae 46(4):287-314, 2001.
  

Reviewed conference proceedings

• E. Furletova, A. Gambin, G. Kucherov, S. Lasota, L. Noe, M. Roytberg, E. Szczurek. Efficient seeding techniques for protein similarity search. Proc. Workshop on Algorithms in Molecular Biology (ALBIO'08), LNBI, to appear.

• S. Lasota, D. Nowak and Y. Zhang. On completeness of logical relations for monadic types. Proc. ASIAN'06, LNCS, 2007.
  [ PDF ] [ BibTex entry ] @Springer-Verlag

• Froeschle, S., Lasota, S. Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
  Proc. INFINITY'06, ENTCS, to appear.
  [ gzipped postscript ] [ BibTex entry ]

  The full version: [ gzipped postscript ]

• Lasota, S., Rytter, W. Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.
  Proc. MFCS'06, LNCS, 2006.
  [ gzipped postscript ] [ pdf ] [ BibTex entry ] @Springer-Verlag

• Froeschle, S., Lasota, S. Causality Versus True-Concurrency.
  Proc. EXPRESS'05, ENTCS 154(3), 2006.
  [ gzipped postscript ] [ BibTex entry ] [ online-version ]

• Froeschle, S., Lasota, S. Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.
  Proc. CONCUR'05, LNCS, 2005.
  [ gzipped postscript ] [ BibTex entry ] @Springer-Verlag

• Lasota, S., Walukiewicz, I. Alternating Timed Automata.
  Proc. FOSSACS'05, LNCS, 2005.
  [ gzipped postscript ] [ BibTex entry ] @Springer-Verlag

• Gambin, A., Hidders, J., Kwaśnikowska, N., Lasota, S., Sroka, J., Tyszkiewicz, J., Van den Bussche, J. Well Constructed Workflows in Bioinformatics.
  Proc. Workshop on Database Issues in Biological Databases (DBiBD 2005), 2005.
  

• Goubault-Larrecq, J., Lasota, S., Nowak, D., Zhang, Y. Complete lax logical relations for cryptographic lambda-calculi.
  Proc. CSL'04, LNCS, 2004.
  [ gzipped postscript ] [ BibTex entry ] @Springer-Verlag

• Lasota, S. A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.
  Proc. MFCS'03, LNCS, 2003.
  [ gzipped postscript ] [ gzipped postscript of the full version ] [ BibTex entry ] @Springer-Verlag

• Goubault-Larrecq, J., Lasota, S., Nowak, D. Logical Relations for Monadic Types.
  Proc. CSL'02, LNCS, 2002.
  [ gzipped postscript ] [ BibTex entry ] @Springer-Verlag

• Lasota, S. Decidability of strong bisimilarity for timed BPP.
  Proc. CONCUR'02, LNCS, 2002.
  [ gzipped postscript ] [ BibTex entry ] @Springer-Verlag

• Lasota, S. Behavioural constructor implementation for regular algebras.
  Proc. 7th International Conference on Logic for Programming and Automated Reasoning LPAR'2000, LNCS 1955, 2000.
  [ gzipped postscript ] @Springer-Verlag

• Lasota, S. Finitary observations in regular algebras.
  Proc. 27th Seminar on Current Trends in Theory and Practice of Informatics SOFSEM '2000, LNCS 1963, 2000.
  [ gzipped postscript ] @Springer-Verlag

• Lasota, S. Coalgebra morphisms subsume open maps. (Preliminary version)
  Proc. 2nd Workshop on Coalgebraic Methods in Computer Science CMCS'99, volume 19 of Electronic Notes in Theoretical Computer Science, 1999.
  [ gzipped postscript ]

• Lasota, S. Weak Bisimilarity and Open Maps.
  Proc. 25th Seminar on Current Trends in Theory and Practice of Informatics SOFSEM '98, LNCS 1521, 1998.
  [ gzipped postscript ] @Springer-Verlag

• Lasota, S. Partial-Congruence Factorization of Bisimilarity Induced by Open Maps.
  Proc. ICALP'98, Aalborg, LNCS 1443, Springer-Verlag, 1998.
  [ gzipped postscript of the full version ] @Springer-Verlag

• Lasota, S. Open Maps as a Bridge between Algebraic Observational Equivalence and Bisimilarity.
  Proc. 12th Workshop on Algebraic Developement Techniques, Tarquinia, June 1997, LNCS 1376, Springer-Verlag, 1998.
  [ gzipped postscript of the full version ] @Springer-Verlag

• Gambin, A., Lasota, S. On the Semantics of Multistage Interconnnection Networks.
  Proc. 23rd Seminar on Current Trends in Theory and Practice of Informatics SOFSEM '96, LNCS 1175, 1996.
  [ gzipped postscript ] [ gzipped postscript of the full version ] @Springer-Verlag

Technical reports

• S. Lasota, D. Nowak, and Y. Zhang. On completeness of logical relations for monadic types.
  Research Report cs.LO/0612106, arXiv.

• Froeschle, S., Lasota, S. Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. The full version.
  Technical Report 280, Institute of Informatics, Warsaw University, 2005.
  [ postscript ]

• Jean Goubault-Larrecq, Slawomir Lasota, David Nowak Logical Relations for Monadic Types. The full version.
  Research Report LSV-04-13, Lab. Specification and Verification, ENS Cachan, France, June 2004.
  [ postscript ]

• Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang Complete lax logical relations for cryptographic lambda-calculi.
  Research Report LSV-04-4, Lab. Specification and Verification, ENS Cachan, France, February 2004.
  [ postscript ]

• S. Lasota. A polynomial-time algorithm for deciding true concurrency equivalences of Basic Parallel Processes.
  Research Report LSV-02-13, Lab. Specification and Verification, ENS Cachan, France, September 2002.
  [ gzipped postscript ]

• Koronacki, J., Lasota, S., Niemiro, W. Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables: A Basic Algorithm.
  Technical Report 884 IPI PAN, 1999.

• Dietzfelbinger, M., Gambin, A., Lasota, S. On Different Models for Packet Flow in Multistage Interconnection Networks.
  Technical report 97-11(248), Institute of Informatics, Warsaw University, 1997.
  [ gzipped postscript ]

• Lasota, S. Open Maps as a Bridge between Algebraic Observational Equivalence and Bisimilarity. The full version.
  Technical report 97-12(249), Institute of Informatics, Warsaw University, 1997.
  [ gzipped postscript ]

Others

• J. Kowalski, S. Lasota, A. Niewiadomski, W. Penczek, Weryfikacja UML z wykorzystaniem systemu Verics. XIII Konferencja Systemy Czasu Rzeczywistego SCR'06, 2006.

• S. Lasota, D. Nowak and Y. Zhang. On completeness of logical relations for monadic types. In Proceedings of the 3rd APPSEM II Workshop (APPSEM'05), Frauenchiemsee, 2005.
  [ PDF ] [ BibTex entry ]

• A. Gambin, J. Hidders, N. Kwaśnikowska, S. Lasota, J. Sroka, J. Tyszkiewicz, J. Van den Bussche, NRC as a formal model for expressing bioinformatics workflows.
  Poster, Intelligent Systems for Molecular Biology ISMB'05, Chicago, 2005.
  

• Lasota, S. On coincidence of distributed and performance equivalence for Basic Parallel Processes. Draft (2002).
  [ gzipped postscript ]

• Lasota, S. Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. The full version (1998).
  [ gzipped postscript ]

PhD Dissertation

• Lasota, S. Algebraic Observational Equivalence and Open-Map Bisimilarity (2000).
  [ gzipped postscript (about 580 kB) ]

  on-line abstract (in Polish)