dblp.uni-trier.dewww.uni-trier.de

Slawomir Lasota Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)