| 2008 |
|---|
| 29 | EE | 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 |
| 28 | EE | Slawomir Lasota,
Igor Walukiewicz:
Alternating timed automata.
ACM Trans. Comput. Log. 9(2): (2008) |
| 27 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak:
Logical relations for monadic types.
Mathematical Structures in Computer Science 18(6): 1169-1217 (2008) |
| 2007 |
|---|
| 26 | EE | Sibylle B. Fröschle,
Slawomir Lasota:
Causality versus true-concurrency.
Theor. Comput. Sci. 386(3): 169-187 (2007) |
| 2006 |
|---|
| 25 | EE | Slawomir Lasota,
David Nowak,
Yu Zhang:
On Completeness of Logical Relations for Monadic Types.
ASIAN 2006: 223-230 |
| 24 | EE | Slawomir Lasota,
Wojciech Rytter:
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.
MFCS 2006: 646-657 |
| 23 | EE | Slawomir Lasota,
David Nowak,
Yu Zhang:
On Completeness of Logical Relations for Monadic Types
CoRR abs/cs/0612106: (2006) |
| 22 | EE | Sibylle B. Fröschle,
Slawomir Lasota:
Causality Versus True-Concurrency.
Electr. Notes Theor. Comput. Sci. 154(3): 3-18 (2006) |
| 21 | EE | Slawomir Lasota:
Decidability of performance equivalence for basic parallel processes.
Theor. Comput. Sci. 360(1-3): 172-192 (2006) |
| 2005 |
|---|
| 20 | EE | Sibylle B. Fröschle,
Slawomir Lasota:
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.
CONCUR 2005: 263-277 |
| 19 | EE | Slawomir Lasota,
Igor Walukiewicz:
Alternating Timed Automata.
FoSSaCS 2005: 250-265 |
| 18 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak:
Logical Relations for Monadic Types
CoRR abs/cs/0511006: (2005) |
| 17 | EE | Slawomir Lasota,
Igor Walukiewicz:
Alternating Timed Automata
CoRR abs/cs/0512031: (2005) |
| 16 | EE | Jacek Koronacki,
Slawomir Lasota,
Wojciech Niemiro:
Positron emission tomography by Markov chain Monte Carlo with auxiliary variables.
Pattern Recognition 38(2): 241-250 (2005) |
| 2004 |
|---|
| 15 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak,
Yu Zhang:
Complete Lax Logical Relations for Cryptographic Lambda-Calculi.
CSL 2004: 400-414 |
| 2003 |
|---|
| 14 | EE | Slawomir Lasota:
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.
MFCS 2003: 521-530 |
| 13 | EE | Slawomir Lasota,
Wojciech Niemiro:
A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise.
Pattern Recognition 36(4): 931-941 (2003) |
| 2002 |
|---|
| 12 | EE | Slawomir Lasota:
Decidability of Strong Bisimilarity for Timed BPP.
CONCUR 2002: 562-578 |
| 11 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak:
Logical Relations for Monadic Types.
CSL 2002: 553-568 |
| 10 | | Anna Gambin,
Slawomir Lasota,
Radoslaw Szklarczyk,
Jerzy Tiuryn,
Jerzy Tyszkiewicz:
Contextual alignment of biological sequences.
ECCB 2002: 116-127 |
| 9 | EE | Slawomir Lasota:
Coalgebra morphisms subsume open maps.
Theor. Comput. Sci. 280(1-2): 123-135 (2002) |
| 2001 |
|---|
| 8 | | Martin Dietzfelbinger,
Anna Gambin,
Slawomir Lasota:
On Different Models for Packet Flow in Multistage Interconnection Networks.
Fundam. Inform. 46(4): 287-314 (2001) |
| 2000 |
|---|
| 7 | EE | Slawomir Lasota:
Behavioural Constructor Implementation for Regular Algebras.
LPAR 2000: 54-69 |
| 6 | EE | Slawomir Lasota:
Finitary Observations in Regular Algebras.
SOFSEM 2000: 402-410 |
| 1999 |
|---|
| 5 | EE | Slawomir Lasota:
Coalgebra morphisms subsume open maps.
Electr. Notes Theor. Comput. Sci. 19: (1999) |
| 1998 |
|---|
| 4 | EE | Slawomir Lasota:
Partial-Congruence Factorization of Bisimilarity Induced by Open Maps.
ICALP 1998: 91-102 |
| 3 | EE | Slawomir Lasota:
Weak Bisimilarity and Open Maps.
SOFSEM 1998: 381-388 |
| 1997 |
|---|
| 2 | | Slawomir Lasota:
Open maps as a bridge between algebraic observational equivalence and bisimilarity.
WADT 1997: 285-299 |
| 1996 |
|---|
| 1 | | Anna Gambin,
Slawomir Lasota:
On the Semantics of Multistage Interconnection Networks.
SOFSEM 1996: 359-368 |
