Slawomir Lasota

	2009
33		Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota: Partially-Commutative Context-Free Processes. CONCUR 2009: 259-273
32		Sibylle B. Fröschle, Slawomir Lasota: Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. Electr. Notes Theor. Comput. Sci. 239: 17-42 (2009)
31		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. Biology Bioinform. 6(3): 483-494 (2009)
30		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)
	2008
29		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		Slawomir Lasota, Igor Walukiewicz: Alternating timed automata. ACM Trans. Comput. Log. 9(2): (2008)
27		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical relations for monadic types. Mathematical Structures in Computer Science 18(6): 1169-1217 (2008)
	2007
26		Sibylle B. Fröschle, Slawomir Lasota: Causality versus true-concurrency. Theor. Comput. Sci. 386(3): 169-187 (2007)
	2006
25		Slawomir Lasota, David Nowak, Yu Zhang: On Completeness of Logical Relations for Monadic Types. ASIAN 2006: 223-230
24		Slawomir Lasota, Wojciech Rytter: Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. MFCS 2006: 646-657
23		Slawomir Lasota, David Nowak, Yu Zhang: On Completeness of Logical Relations for Monadic Types CoRR abs/cs/0612106: (2006)
22		Sibylle B. Fröschle, Slawomir Lasota: Causality Versus True-Concurrency. Electr. Notes Theor. Comput. Sci. 154(3): 3-18 (2006)
21		Slawomir Lasota: Decidability of performance equivalence for basic parallel processes. Theor. Comput. Sci. 360(1-3): 172-192 (2006)
	2005
20		Sibylle B. Fröschle, Slawomir Lasota: Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. CONCUR 2005: 263-277
19		Slawomir Lasota, Igor Walukiewicz: Alternating Timed Automata. FoSSaCS 2005: 250-265
18		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types CoRR abs/cs/0511006: (2005)
17		Slawomir Lasota, Igor Walukiewicz: Alternating Timed Automata CoRR abs/cs/0512031: (2005)
16		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		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang: Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414
	2003
14		Slawomir Lasota: A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. MFCS 2003: 521-530
13		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		Slawomir Lasota: Decidability of Strong Bisimilarity for Timed BPP. CONCUR 2002: 562-578
11		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		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		Slawomir Lasota: Behavioural Constructor Implementation for Regular Algebras. LPAR 2000: 54-69
6		Slawomir Lasota: Finitary Observations in Regular Algebras. SOFSEM 2000: 402-410
	1999
5		Slawomir Lasota: Coalgebra morphisms subsume open maps. Electr. Notes Theor. Comput. Sci. 19: (1999)
	1998
4		Slawomir Lasota: Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. ICALP 1998: 91-102
3		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

Coauthor Index

1	Wojciech Czerwinski	[33]
2	Martin Dietzfelbinger	[8]
3	Sibylle B. Fröschle	[20] [22] [26] [32] [33]
4	Eugenia Furletova	[29] [31]
5	Anna Gambin	[1] [8] [10] [29] [31]
6	Jean Goubault-Larrecq (Jean Goubault)	[11] [15] [18] [27]
7	Jacek Koronacki	[16]
8	Gregory Kucherov	[29] [31]
9	Wojciech Niemiro	[13] [16]
10	Laurent Noé	[29] [31]
11	David Nowak	[11] [15] [18] [23] [25] [27]
12	Mikhail A. Roytberg	[29] [31]
13	Wojciech Rytter	[24]
14	Ewa Szczurek	[29] [31]
15	Radoslaw Szklarczyk	[10]
16	Jerzy Tiuryn	[10]
17	Jerzy Tyszkiewicz	[10]
18	Igor Walukiewicz	[17] [19] [28]
19	Yu Zhang	[15] [23] [25]

Colors in the list of coauthors