Search the dblp DataBase
Slawomir Lasota :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Sibylle B. Fröschle , Slawomir Lasota Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. [Citation Graph (0, 0)][DBLP ] CONCUR, 2005, pp:263-277 [Conf ] Slawomir Lasota Decidability of Strong Bisimilarity for Timed BPP. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:562-578 [Conf ] Jean Goubault-Larrecq , Slawomir Lasota , David Nowak Logical Relations for Monadic Types. [Citation Graph (0, 0)][DBLP ] CSL, 2002, pp:553-568 [Conf ] Jean Goubault-Larrecq , Slawomir Lasota , David Nowak , Yu Zhang Complete Lax Logical Relations for Cryptographic Lambda-Calculi. [Citation Graph (0, 0)][DBLP ] CSL, 2004, pp:400-414 [Conf ] Anna Gambin , Slawomir Lasota , Radoslaw Szklarczyk , Jerzy Tiuryn , Jerzy Tyszkiewicz Contextual alignment of biological sequences. [Citation Graph (0, 0)][DBLP ] ECCB, 2002, pp:116-127 [Conf ] Slawomir Lasota , Igor Walukiewicz Alternating Timed Automata. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2005, pp:250-265 [Conf ] Slawomir Lasota Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:91-102 [Conf ] Slawomir Lasota Behavioural Constructor Implementation for Regular Algebras. [Citation Graph (0, 0)][DBLP ] LPAR, 2000, pp:54-69 [Conf ] Slawomir Lasota A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 2003, pp:521-530 [Conf ] Slawomir Lasota , Wojciech Rytter Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 2006, pp:646-657 [Conf ] Anna Gambin , Slawomir Lasota On the Semantics of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1996, pp:359-368 [Conf ] Slawomir Lasota Finitary Observations in Regular Algebras. [Citation Graph (0, 0)][DBLP ] SOFSEM, 2000, pp:402-410 [Conf ] Slawomir Lasota Weak Bisimilarity and Open Maps. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1998, pp:381-388 [Conf ] Slawomir Lasota Open maps as a bridge between algebraic observational equivalence and bisimilarity. [Citation Graph (0, 0)][DBLP ] WADT, 1997, pp:285-299 [Conf ] Sibylle B. Fröschle , Slawomir Lasota Causality Versus True-Concurrency. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:154, n:3, pp:3-18 [Journal ] Slawomir Lasota Coalgebra morphisms subsume open maps. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:19, n:, pp:- [Journal ] Martin Dietzfelbinger , Anna Gambin , Slawomir Lasota On Different Models for Packet Flow in Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2001, v:46, n:4, pp:287-314 [Journal ] Jacek Koronacki , Slawomir Lasota , Wojciech Niemiro Positron emission tomography by Markov chain Monte Carlo with auxiliary variables. [Citation Graph (0, 0)][DBLP ] Pattern Recognition, 2005, v:38, n:2, pp:241-250 [Journal ] Slawomir Lasota , Wojciech Niemiro A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise. [Citation Graph (0, 0)][DBLP ] Pattern Recognition, 2003, v:36, n:4, pp:931-941 [Journal ] Slawomir Lasota Coalgebra morphisms subsume open maps. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:280, n:1-2, pp:123-135 [Journal ] Slawomir Lasota Decidability of performance equivalence for basic parallel processes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:360, n:1-3, pp:172-192 [Journal ] Slawomir Lasota , David Nowak , Yu Zhang On Completeness of Logical Relations for Monadic Types [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] On Completeness of Logical Relations for Monadic Types. [Citation Graph (, )][DBLP ] Partially-Commutative Context-Free Processes. [Citation Graph (, )][DBLP ] An Extension of Data Automata that Captures XPath. [Citation Graph (, )][DBLP ] Efficient Seeding Techniques for Protein Similarity Search. [Citation Graph (, )][DBLP ] Logical Relations for Monadic Types [Citation Graph (, )][DBLP ] Alternating Timed Automata [Citation Graph (, )][DBLP ] Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.302secs