Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Sławomir Lasota
2018
- Sławomir Lasota and Radosław Piórkowski, WQO Dichotomy for 3-Graphs, in: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, 2018, p. 548–564.see in PBN
- Wojciech Czerwiński, Sławomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar and Prakash Saivasan, Regular Separability of Well-Structured Transition Systems, in: 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018, p. 35:1–35:18.see in PBN
- Piotr Hofman and Sławomir Lasota, Linear Equations with Ordered Data, in: 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018, p. 24:1–24:17.see in PBN
- Lorenzo Clemente and Sławomir Lasota, Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms, in: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, p. 118:1–118:14.see in PBN
2017
- Sławomir Lasota, Equivariant algorithms for constraint satisfaction problems over coset templates, Information Processing Letters 118 2017, p. 44–52.see in PBN
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter and Lorenzo ClementeFilip Murlak (ed.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.see in PBN
- Wojciech Czerwiński, Charles Paperman, Lorenzo Clemente and Sławomir Lasota, Separability of Reachability Sets of Vector Addition Systems, in: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, 2017, p. 24:1–24:14.see in PBN
- Wojciech Czerwiński, Charles Paperman, Lorenzo Clemente and Sławomir Lasota, Regular Separability of Parikh Automata, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, p. 117:1–117:13.see in PBN
- Wojciech Czerwiński and Sławomir Lasota, Regular separability of one counter automata, in: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017, p. 1–12.see in PBN
- Ranko Lazić, Lorenzo Clemente, Filip Mazowiecki and Sławomir Lasota, Timed pushdown automata and branching vector addition systems, in: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017, p. 1–12.see in PBN
2016
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak and Szymon Toruńczyk, Homomorphism Problems for First-Order Definable Structures, in: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), 2016, r. 14, p. 14:1–14:15.see in PBN
- Piotr Hofman, Sławomir Lasota, Richard Mayr and Patrick Totzke, Simulation Problems Over One-Counter Nets, Logical Methods In Computer Science 12 (1) 2016.see in PBN
- Diego Figueira, Piotr Hofman and Sławomir Lasota, Relating timed and register automata, Mathematical Structures In Computer Science 26 (6) 2016, p. 993–1021.see in PBN
- Sławomir Lasota, Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, in: Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS 2016, Toruń, Poland, June 19-24, 2016. Proceedings, Springer, 2016, p. 20–36.see in PBN
- Piotr Hofman, Sławomir Lasota, Ranko Lazic, J\'er\^ome Leroux, Sylvain Schmitz and Patrick Totzke, Coverability Trees for Petri Nets with Unordered Data, in: Foundations of Software Science and Computation Structures 19th International Conference, FOSSACS 2016, Springer, 2016, p. 445–461.see in PBN
- Sławomir Lasota and Marcin Poturalski, Undecidability of performance equivalence of Petri nets, Theoretical Computer Science 655 2016, p. 109–119.see in PBN
2015
- Sławomir Lasota and Lorenzo Clemente, Timed pushdown automata revisited, in: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, p. 738––749.see in PBN
- Sławomir Lasota and Lorenzo Clemente, Reachability analysis of first-order definable pushdown systems, in: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, p. 244––259.see in PBN
- Mikołaj Bojańczyk, Sławomir Lasota and Igor Potapov (eds.), Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, Springer, Warsaw 2015.see in PBN
- Grzegorz Anielak, Grzegorz Jakacki and Sławomir Lasota, Incremental Test Case Generation Using Bounded Model Checking: an Application to Automatic Rating, International Journal On Software Tools For Technology Transfer 17 (3) 2015, p. 339–349.see in PBN
2014
- Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.see in PBN
- Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota, Decidability of branching bisimulation on normed commutative context-free processes, Theory Of Computing Systems 55 (1) 2014, p. 136–169.see in PBN
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak and Szymon Toruńczyk, Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, in: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014.see in PBN
2013
- Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota, Reachability problem for weak multi-pushdown automata, Logical Methods In Computer Science 9 (3:13) 2013.see in PBN
- Mikołaj Jakub Rybiński, Zuzanna Szymańska, Sławomir Lasota and Anna Gambin, Modelling the efficacy of hyperthermia treatment, Journal Of The Royal Society Interface 10 (88) 2013, p. 1–10.see in PBN
- Piotr Hofman, Sławomir Lasota, Richard Mayr and Patrick Totzke, Simulation Over One-counter Nets is PSPACE-Complete, in: Proc. FSTTCS'13, 2013.see in PBN
- Mikołaj Bojańczyk, Bartosz Klin, Sławomir Lasota and Szymon Toruńczyk, Turing machines with atoms, in: Proceedings of LICS 2013, 2013, p. 183–192.see in PBN
2012
- Mikołaj Bojańczyk and Sławomir Lasota, A Machine-Independent Characterization of Timed Languages, in: ICALP (2), 2012.see in PBN
- Mikołaj Bojańczyk, Laurent Braud, Bartosz Klin and Sławomir Lasota, Towards nominal computation, in: POPL, 2012.see in PBN
- Wojciech Czerwiński and Sławomir Lasota, Partially-commutative context-free languages, in: DCM, 2012.see in PBN
- Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota, Reachability Problem for Weak Multi-Pushdown Automata, in: CONCUR 2012 – Concurrency Theory, Springer Berlin Heidelberg, 2012, p. 53–68.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, An extension of data automata that captures XPath, Logical Methods In Computer Science 8 (1) 2012.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, Fraenkel-Mostowski Sets with Non-homogeneous Atoms, in: RP, 2012.see in PBN
- Mikołaj Bojańczyk, Laurent Braud, Bartek Klin and Sławomir Lasota, Towards nominal computation, Acm Sigplan Notices 47 (1) 2012, p. 401–412.see in PBN
- Wojciech Czerwiński and Sławomir Lasota, Partially-commutative context-free languages, Electronic Proceedings In Theoretical Computer Science 89 2012, p. 35–48.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, A machine-independent characterization of timed languages, Lecture Notes In Computer Science 7392 2012, p. 92–103.see in PBN
- Paweł Banasik, Anna Gambin, Sławomir Lasota, Michał Lula and Mikołaj Rybiński, Tav4SB: integrating tools for analysis of kinetic models of biological systems, Bmc Systems Biology 6 (25) 2012.see in PBN
- Michał Startek, Sławomir Lasota, Maciej Sykulski, Adam Bułak, Laurent Noe, Gregory Kucherov and Anna Gambin, Efficient alternatives to PSI-BLAST, Bulletin Of The Polish Academy Of Sciences-technical Sciences 2012.see in PBN
2011
- Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota, Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes In Computer Science 6901 2011, p. 528–542.see in PBN
- Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata with group actions, in: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Society, Toronto 2011.see in PBN
- Anna Gambin, Maciej Sykulski, Sławomir Lasota, Michał Startek, Gregory Kucherov and Laurent Noe, Subset seed extension to protein BLAST, in: Proc. Int. Conf. on Bioinformatics Models, Methods and Algorithms Bioinformatics'11., 2011.see in PBN
- Anna Gambin, Sławomir Lasota, Michał Lula and Mikołaj Rybiński, Tav4SB: grid environment for analysis of kinetic models of biological systems, in: International Symposium on Bioinformatics Research and Applications (ISBRA), 2018.see in PBN
- Wojciech Czerwiński, Sibylle Froeschle and Sławomir Lasota, Partially-commutative context-free processes: expressibility and tractability, Information And Computation 209 (5) 2011, p. 782–798.see in PBN
2010
- Diego Figueira, Piotr Hofman and Sławomir Lasota, Relating timed and register automata, in: Proc. Express'2010, 2010.see in PBN
- Wojciech Czerwiński and Sławomir Lasota, Fast equivalence-checking for normed context-free processes, in: FSTTCS, 2010.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, An Extension of Data Automata that Captures XPath, in: LICS, 2010.see in PBN
- Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota and Zdenek Sawa, Non-interleaving bisimulation equivalences on Basic Parallel Processes, Information And Computation 208 (1) 2010, p. 42–62.see in PBN
2009
- Wojciech Czerwiński, Sibylle B. Fröschle and Sławomir Lasota, Partially-Commutative Context-Free Processes, Lecture Notes In Computer Science 5710 2009, p. 259–273.see in PBN
- Sibylle B. Fröschle and Sławomir Lasota, Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences, Electronic Notes In Theoretical Computer Science 239 2009, p. 17–42.see in PBN
- Sławomir Lasota, EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters 109 (15) 2009, p. 850–855.see in PBN
- Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek and Gregory Kucherov, On Subset Seeds for Protein Alignment, Ieee-acm Transactions On Computational Biology And Bioinformatics 6 (3) 2009, p. 483–494.see in PBN
2008
- Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek and Gregory Kucherov, Efficient Seeding Techniques for Protein Similarity Search, in: BIRD, 2008.see in PBN
- Sławomir Lasota and Igor Walukiewicz, Alternating timed automata, Acm Transactions On Computational Logic 9 (2) 2008.see in PBN
- Jean Goubault-Larrecq, Sławomir Lasota and David Nowak, Logical Relations for Monadic Types, Mathematical Structures In Computer Science 18 (6) 2008, p. 1169–1217.see in PBN
2007
- D. Grzebelus, Sławomir Lasota, T. Gambin, G. Kucherov and Anna Gambin, Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula, Bmc Genomics 8 2007, p. 409.see in PBN
- Sibylle Froeschle and Sławomir Lasota, Causality Versus True-Concurrency, Theoretical Computer Science 386 2007, p. 169–187.see in PBN
- Dariusz Grzebelus, Sławomir Lasota, Tomasz Gambin, Gregory Kucherov and Anna Gambin, Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula, Bmc Genomics 8 2007, p. 409.see in PBN
- Sławomir Lasota, David Nowak and Yu Zhang, On completeness of logical relations for monadic types, Lecture Notes In Computer Science 4435 2007, p. 223––230.see in PBN
2006
- Sławomir Lasota, Decidability of Performance Equivalence for Basic Parallel Processes, Theoretical Computer Science 360 (1-3) 2006, p. 172–192.see in PBN
- Sławomir Lasota and Wojciech Rytter, Faster algorithm for bisimulation equivalence of normed context-free processes, Lecture Notes In Computer Science 4162 2006, p. 646–657.see in PBN
- Sibylle Froeschle and Sławomir Lasota, Causality Versus True-Concurrency, Electronic Notes In Theoretical Computer Science 154 (3) 2006, p. 3–18.see in PBN
- Anna Gambin, Sławomir Lasota and Michal Rutkowski, Analyzing stationary states of gene regulatory network using Petri nets, In Silico Biology 6 2006, p. 10.see in PBN
2005
- Anna Gambin, Jan Hidders, Natalia Kwaśnikowska, Sławomir Lasota, Jacek Sroka, Jerzy Paweł Tyszkiewicz and Jan Van den Bussche, Well Constructed Workflows in Bioinformatics, in: Proc. Workshop on Database Issues in Biological Databases 2005, 2005.see in PBN
- Sławomir Lasota and Sibylle Froeschle, Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP, Lecture Notes In Computer Science 3653 2005, p. 263–277.see in PBN
- Sławomir Lasota and Igor Walukiewicz, Alternating Timed Automata, Lecture Notes In Computer Science 3441 2005, p. 250–265.see in PBN
- Jan Hidders, Natalia Kwasnikowska, Sławomir Lasota, Jacek Sroka, Jerzy Tyszkiewicz and Jan Van den Bussche, Petri Net + Nested Relational Calculus = Dataflow, Lecture Notes In Computer Science 3760 2005, p. 220–237.see in PBN
- Jacek Koronacki, Sławomir Lasota and Wojciech Niemiro, Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables, Pattern Recognition 38 (2) 2005, p. 241–250.see in PBN
2002
- Anna Gambin, Sławomir Lasota, Radosław Szklarczyk, Jerzy Tiuryn and Jerzy Tyszkiewicz, Contextual Alignment of Biological Sequences, Bioinformatics 18 (2) 2002, p. 116–127.see in PBN
- Sławomir Lasota, J. Goubault-Larrecq and D. Nowak, Logical Relations for Monadic Types, Lecture Notes In Computer Science 2471 2002, p. 553–568.see in PBN
- Sławomir Lasota, Decidability of strong bisimilarity for timed BPP, Lecture Notes In Computer Science 2421 2002, p. 562–578.see in PBN
- Sławomir Lasota, Coalgebra morphisms subsume open maps, Theoretical Computer Science 280 2002, p. 123–135.see in PBN
You are not logged in | log in
