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