Publikacje

Sławomir Lasota

Liczba publikacji: 102

2024

• Łukasz Kamiński, Sławomir Lasota , Bi-Reachability in Petri Nets with Data, 35th International Conference on Concurrency Theory, Calgary, Canada, 9 września 2024 - 13 września 2024. Zobacz w PBN
• Arka Ghosh , Sławomir Lasota , Equivariant ideals of polynomials, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn, Estonia, 8 lipca 2024 - 11 lipca 2024, 11 2024, s. 1-14. Zobacz w PBN

2023

• Wojciech Czerwiński , Ismaël Jecker , Sławomir Lasota , Jérôme Leroux, Łukasz Orlikowski, New Lower Bounds for Reachability in Vector Addition Systems, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 18 grudnia 2023 - 20 grudnia 2023. Zobacz w PBN
• Arka Ghosh , Piotr Hofman , Sławomir Lasota , Orbit-finite linear programming, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 czerwca 2023 - 29 czerwca 2023. Zobacz w PBN

2022

• Bartosz Klin , Sławomir Lasota , Anca Muscholl, 33rd International Conference on Concurrency Theory (CONCUR 2022), 33rd International Conference on Concurrency Theory, Warszawa, Poland, 12 września 2022 - 16 września 2022. Zobacz w PBN
• Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski, Determinisability of register and timed automata, Logical Methods in Computer Science, 18 (2) 2022, s. 9:1–9:37. Zobacz w PBN
• Sławomir Lasota , Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem, 39th International Symposium on Theoretical Aspects of Computer Science, Marseille, France, 15 kwietnia 2022 - 18 kwietnia 2022. Zobacz w PBN
• Arka Ghosh , Piotr Hofman , Sławomir Lasota , Solvability of orbit-finite systems of linear equations, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 sierpnia 2022 - 5 sierpnia 2022. Zobacz w PBN

2021

• Matthias Englert, Ranko Lazić, Jérôme Leroux, Sławomir Lasota , Piotr Hofman , Juliusz Straszyński , A lower bound for the coverability problem in acyclic pushdown VAS, Information Processing Letters, 167 2021, s. 106079:1-5. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Łukasz Orlikowski, Improved Lower Bounds for Reachability in Vector Addition Systems, 48th International Colloquium on Automata, Languages and Programming, Glasgow, the United Kingdom of Great Britain and Northern Ireland, 12 lipca 2021 - 16 lipca 2021. Zobacz w PBN
• Bartosz Klin , Sławomir Lasota , Szymon Toruńczyk , Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages, 24th International Conference on Foundations of Software Science and Computation Structures, Luksemburg, Luxembourg, 27 marca 2021 - 1 kwietnia 2021. Zobacz w PBN
• Sławomir Lasota , Mohnish Pattathurajan, Parikh Images of Register Automata, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, India, 14 grudnia 2021 - 17 grudnia 2021, 213 2021, s. 50:1--50:14. Zobacz w PBN
• Marta Juzepczuk, Mohnish Pattathurajan, Piotr Hofman , Sławomir Lasota , Parikh’s theorem for infinite alphabets, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 29 czerwca 2021 - 2 lipca 2021. Zobacz w PBN
• Mikołaj Bojańczyk , Thomas Brihaye, Christoph Haase, Sławomir Lasota , Joel Ouaknine, Igor Potapov, Preface, Information and Computation, 277 2021, s. 104579. Zobacz w PBN
• Sławomir Lasota , Lorenzo Clemente , Reachability relations of timed pushdown automata, Journal of Computer and System Sciences, 117 2021, s. 202-241. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, JÉrôme Leroux, Filip Mazowiecki, The Reachability Problem for Petri Nets Is Not Elementary, JOURNAL OF THE ACM, 68 (1) 2021, s. 1-28. Zobacz w PBN

2020

• Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski, Determinisability of One-Clock Timed Automata, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 września 2020 - 4 września 2020. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazic, Jerome Leroux, Filip Mazowiecki, Reachability in Fixed Dimension Vector Addition Systems with States, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 września 2020 - 4 września 2020. Zobacz w PBN
• Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski, Timed Games and Deterministic Separability, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 lipca 2020 - 11 lipca 2020. Zobacz w PBN
• Radosław Piórkowski, Sławomir Lasota , WQO dichotomy for 3-graphs, Information and Computation, 275 2020, s. 104541. Zobacz w PBN

2019

• Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki, Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems, ACM Transactions on Computational Logic, 20 (3) 2019, s. 1-31. Zobacz w PBN
• Khadijeh Keshvardoost, Bartosz Klin , Sławomir Lasota , Joanna Ochremiak, Szymon Toruńczyk , Definable isomorphism problem, Logical Methods in Computer Science, 15 (4) 2019, s. 14:1–14:19. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Löding, Christof, Radosław Piórkowski, New Pumping Technique for 2-Dimensional VASS, Leibniz International Proceedings in Informatics, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 sierpnia 2019 - 30 sierpnia 2019, 138 2019, s. 62:1--62:14. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Regular Separability of One Counter Automata, Logical Methods in Computer Science, 15 (2) 2019, s. 20:1–20:27. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, Jérôme Leroux, Filip Mazowiecki, The reachability problem for Petri nets is not elementary, 51st ACM Symposium on Theory of Computing, Phoenix, the United States of America, 23 czerwca 2019 - 26 czerwca 2019. Zobacz w PBN

2018

• Sławomir Lasota , Lorenzo Clemente , Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms, 45th International Colloquium on Automata, Languages, and Programming, Praha, Czechia, 9 lipca 2018 - 13 lipca 2018. Zobacz w PBN
• Piotr Hofman , Sławomir Lasota , Linear Equations with Ordered Data, 29th International Conference on Concurrency Theory, Beijing, China, 4 września 2018 - 7 września 2018. Zobacz w PBN
• Wojciech Czerwiński , K. Narayan Kumar, Sławomir Lasota , Roland Meyer, Sebastian Muskalla, Prakash Saivasan, Regular Separability of Well-Structured Transition Systems, 29th International Conference on Concurrency Theory, Beijing, China, 4 września 2018 - 7 września 2018. Zobacz w PBN
• Anna Gambin , Sławomir Lasota , Michał Lula, Mikołaj Rybiński, Tav4SB: grid environment for analysis of kinetic models of biological systems, 2018. Zobacz w PBN
• Sławomir Lasota , Radosław Piórkowski, WQO Dichotomy for 3-Graphs, 21st International Conference on Foundations of Software Science and Computation Structures, Thessaloniki, Greece, 14 kwietnia 2018 - 20 kwietnia 2018. Zobacz w PBN

2017

• Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. Zobacz w PBN
• Sławomir Lasota , Equivariant algorithms for constraint satisfaction problems over coset templates, Information Processing Letters, 118 2017, s. 44-52. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Regular separability of one counter automata, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 czerwca 2017 - 23 czerwca 2017. Zobacz w PBN
• Charles Paperman, Sławomir Lasota , Wojciech Czerwiński , Lorenzo Clemente , Regular Separability of Parikh Automata, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 lipca 2017 - 14 lipca 2017. Zobacz w PBN
• Sławomir Lasota , Charles Paperman, Wojciech Czerwiński , Lorenzo Clemente , Separability of Reachability Sets of Vector Addition Systems, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
• Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki, Timed pushdown automata and branching vector addition systems, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 czerwca 2017 - 23 czerwca 2017. Zobacz w PBN

2016

• Piotr Hofman , Sławomir Lasota , Ranko Lazic, J\'er\^ome Leroux, Sylvain Schmitz, Patrick Totzke, Coverability Trees for Petri Nets with Unordered Data, Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, 2016. Zobacz w PBN
• Sławomir Lasota , Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS 2016, Toruń, Poland, 19 czerwca 2016 - 24 czerwca 2016. Zobacz w PBN
• Bartosz Klin , Sławomir Lasota , Joanna Ochremiak, Szymon Toruńczyk , Homomorphism Problems for First-Order Definable Structures, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 13 grudnia 2016 - 15 grudnia 2016. Zobacz w PBN
• Sławomir Lasota , Diego Figueira, Piotr Hofman , Relating timed and register automata, Mathematical Structures in Computer Science, 2016. Zobacz w PBN
• Sławomir Lasota , Richard Mayr, Patrick Totzke, Piotr Hofman , Simulation Problems Over One-Counter Nets, Logical Methods in Computer Science, 2016. Zobacz w PBN
• Sławomir Lasota , Marcin Poturalski, Undecidability of performance equivalence of Petri nets, Theoretical Computer Science, 2016. Zobacz w PBN

2015

• Grzegorz Anielak, Grzegorz Jakacki, 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
• Sławomir Lasota , Lorenzo Clemente, Reachability analysis of first-order definable pushdown systems, 24th EACSL Annual Conference on Computer Science Logic, Berlin, Germany, 7 września 2015 - 10 września 2015. Zobacz w PBN
• Mikołaj Bojańczyk , Sławomir Lasota , Igor Potapov, Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, Reachability Problems, Warsaw, Poland, 2015. Zobacz w PBN
• Sławomir Lasota , Lorenzo Clemente, Timed pushdown automata revisited, 30th Annual ACM/IEEE Symposium on Logic in Computer Science, Kyoto, Japan, 6 lipca 2015 - 10 lipca 2015. Zobacz w PBN

2014

• Mikołaj Bojańczyk , Bartosz Klin , Sławomir Lasota , Automata theory in nominal sets, Logical Methods in Computer Science, 2014. Zobacz w PBN
• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of branching bisimulation on normed commutative context-free processes, Theory of Computing Systems, 2014. Zobacz w PBN
• Bartosz Klin , Sławomir Lasota , Joanna Ochremiak, Szymon Toruńczyk , Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, ACM/IEEE Symposium on Logic in Computer Science, 2014. Zobacz w PBN

2013

• Anna Gambin , Sławomir Lasota , Mikołaj Jakub Rybiński, Zuzanna Szymańska, Modelling the efficacy of hyperthermia treatment, Journal of the Royal Society Interface, 10 (88) 2013, s. 1-10. Zobacz w PBN
• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Reachability problem for weak multi-pushdown automata, Logical Methods in Computer Science, 2013. Zobacz w PBN
• Sławomir Lasota , Piotr Hofman , Richard Mayr, Patrick Totzke, Simulation Over One-counter Nets is PSPACE-Complete, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), 2013. Zobacz w PBN
• Mikołaj Bojańczyk , Bartosz Klin , Sławomir Lasota , Szymon Toruńczyk , Turing machines with atoms, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, the United States of America, 25 czerwca 2013 - 28 czerwca 2013. Zobacz w PBN

2012

• Sławomir Lasota , Mikołaj Bojańczyk , A machine-independent characterization of timed languages, Lecture Notes in Computer Science, International Colloquium on Automata, Languages and Programming, 2012. Zobacz w PBN
• Mikołaj Bojańczyk , Sławomir Lasota , An extension of data automata that captures XPath, Logical Methods in Computer Science, 2012. Zobacz w PBN
• Mikołaj Bojańczyk , Sławomir Lasota , Fraenkel-Mostowski Sets with Non-homogeneous Atoms, 2012. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Partially-commutative context-free languages, Electronic Proceedings in Theoretical Computer Science, 2012. Zobacz w PBN
• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Reachability Problem for Weak Multi-Pushdown Automata, 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, the United Kingdom of Great Britain and Northern Ireland, 4 września 2012 - 7 września 2012. Zobacz w PBN
• Paweł Banasik, Anna Gambin , Sławomir Lasota , Michał Lula, Mikołaj Rybiński, Tav4SB: integrating tools for analysis of kinetic models of biological systems, BMC Systems Biology, 6 2012, s. 25:1-11. Zobacz w PBN
• Laurent Braud, Sławomir Lasota , Bartek Klin, Mikołaj Bojańczyk , Towards nominal computation, ACM SIGPLAN NOTICES, 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Philadelphia, the United States of America, 22 stycznia 2012 - 28 stycznia 2012. Zobacz w PBN

2011

• Mikołaj Bojańczyk , Bartosz Klin , Sławomir Lasota , Automata with group actions, 2011. Zobacz w PBN
• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Wojciech Czerwiński, Sibylle Froeschle, Sławomir Lasota , Partially-commutative context-free processes: expressibility and tractability, Information and Computation, 2011. Zobacz w PBN
• Anna Gambin , Gregory Kucherov, Sławomir Lasota , Laurent Noe, Michał Startek , Maciej Sykulski, Subset seed extension to protein BLAST, Proc. Int. Conf. on Bioinformatics Models, Methods and Algorithms Bioinformatics'11, 2011. Zobacz w PBN

2010

• Mikołaj Bojańczyk , Sławomir Lasota , An Extension of Data Automata that Captures XPath, 2010. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Fast equivalence-checking for normed context-free processes, 2010. Zobacz w PBN
• Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota , Zdenek Sawa, Non-interleaving bisimulation equivalences on Basic Parallel Processes, Information and Computation, 2010. Zobacz w PBN
• Diego Figueira, Piotr Hofman , Sławomir Lasota , Relating timed and register automata, 17th International Workshop on Expressiveness in Concurrency, 2010. Zobacz w PBN

2009

• Sławomir Lasota , EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters, 2009. Zobacz w PBN
• Sibylle B. Fröschle, Sławomir Lasota , Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences, Electronic Notes in Theoretical Computer Science, 2009. Zobacz w PBN
• Eugenia Furletova, Anna Gambin , Gregory Kucherov, Sławomir Lasota , Laurent Noé, Mikhail A. Roytberg, Ewa Szczurek , On Subset Seeds for Protein Alignment, IEEE-ACM Transactions on Computational Biology and Bioinformatics, 2009. Zobacz w PBN
• Wojciech Czerwiński , Sibylle B. Fröschle, Sławomir Lasota , Partially-Commutative Context-Free Processes, Lecture Notes in Computer Science, 2009. Zobacz w PBN

2008

• Sławomir Lasota , Igor Walukiewicz, Alternating timed automata, ACM Transactions on Computational Logic, 2008. Zobacz w PBN
• Eugenia Furletova, Anna Gambin , Gregory Kucherov, Sławomir Lasota , Laurent Noé, Mikhail A. Roytberg, Ewa Szczurek , Efficient Seeding Techniques for Protein Similarity Search, 2008. Zobacz w PBN
• Jean Goubault-Larrecq, Sławomir Lasota , David Nowak, Logical Relations for Monadic Types, Mathematical Structures in Computer Science, 2008. Zobacz w PBN

2007

• Sibylle Froeschle, Sławomir Lasota , Causality Versus True-Concurrency, Theoretical Computer Science, 2007. Zobacz w PBN
• Anna Gambin , Tomasz Gambin, Dariusz Grzebelus, Gregory Kucherov, Sławomir Lasota , Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula, BMC Genomics, 2007. Zobacz w PBN
• Sławomir Lasota , David Nowak, Yu Zhang, On completeness of logical relations for monadic types, Lecture Notes in Computer Science, Advances in Computer Science - ASIAN 2006, 2007. Zobacz w PBN

2006

• Anna Gambin , Sławomir Lasota , Michal Rutkowski, Analyzing stationary states of gene regulatory network using Petri nets, In Silico Biology, 2006. Zobacz w PBN
• Sibylle Froeschle, Sławomir Lasota , Causality Versus True-Concurrency, Electronic Notes in Theoretical Computer Science, 2006. Zobacz w PBN
• Sławomir Lasota , Decidability of Performance Equivalence for Basic Parallel Processes, Theoretical Computer Science, 2006. Zobacz w PBN
• Sławomir Lasota , Wojciech Rytter , Faster algorithm for bisimulation equivalence of normed context-free processes, Lecture Notes in Computer Science, 2006. Zobacz w PBN

2005

• Sławomir Lasota , Igor Walukiewicz, Alternating Timed Automata, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Sibylle Froeschle, Sławomir Lasota , Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Jan Hidders, Natalia Kwasnikowska, Sławomir Lasota , Jacek Sroka , Jerzy Tyszkiewicz , Jan Van den Bussche, Petri Net + Nested Relational Calculus = Dataflow, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Jacek Koronacki, Sławomir Lasota , Wojciech Niemiro , Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables, Pattern Recognition, 2005. Zobacz w PBN
• Jerzy Tyszkiewicz , Sławomir Lasota , Jan Van den Bussche, Anna Gambin , Natalia Kwaśnikowska, Jan Hidders, Jacek Sroka , Well Constructed Workflows in Bioinformatics, Workshop on Database Issues in Biological Databases (DBiBD 2005), 2005. Zobacz w PBN

2004

• Jean Goubault-Larrecq, Sławomir Lasota , David Nowak, Yu Zhang, Complete lax logical relations for cryptographic lambda-calculi, Lecture Notes in Computer Science, 2004. Zobacz w PBN

2003

• Sławomir Lasota , A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Sławomir Lasota , Wojciech Niemiro , A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise, Pattern Recognition, 2003. Zobacz w PBN

2002

• Sławomir Lasota , Coalgebra morphisms subsume open maps, Theoretical Computer Science, 2002. Zobacz w PBN
• Anna Gambin , Sławomir Lasota , Radosław Szklarczyk, Jerzy Tiuryn , Jerzy Tyszkiewicz , Contextual Alignment of Biological Sequences, Bioinformatics, 2002. Zobacz w PBN
• Sławomir Lasota , Decidability of strong bisimilarity for timed BPP, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• J. Goubault-Larrecq, Sławomir Lasota , D. Nowak, Logical Relations for Monadic Types, Lecture Notes in Computer Science, 2002. Zobacz w PBN

2001

• M Dietzfelbiner, A. Gambin, Sławomir Lasota , On different models for packet flow in Multistage Interconnection Networks, Fundamenta Informaticae, 2001. Zobacz w PBN

2000

• Sławomir Lasota , Behavioural constructor implementation for regular algebras, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• Sławomir Lasota , Finitary observations in regular algebras, Lecture Notes in Computer Science, 2000. Zobacz w PBN

1999

• Sławomir Lasota , Coalgebra morphisms subsume open maps, Electronic Notes in Theoretical Computer Science, 1999. Zobacz w PBN

1998

• Sławomir Lasota , Partial-Congruence Factorization of Bisimilarity Induced by Open Maps, Lecture Notes in Computer Science, Automata, Languages and Programming, 25th International Colloquium, ICALP'98, 1998. Zobacz w PBN
• Sławomir Lasota , Weak Bisimilarity and Open Maps, Lecture Notes in Computer Science, SOFSEM '98: Theory and Practice of Informatics, 25th Conference on Current Trends in Theory and Practice of Informatics, 1998. Zobacz w PBN

1997

• Sławomir Lasota , Open maps as a bridge between algebraic observational equivalence and bisimilarity, Lecture Notes in Computer Science, Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT'97, Selected Papers, 1997. Zobacz w PBN

1996

• Anna Gambin , Sławomir Lasota , On the Semantics of Multistage Interconnection Networks, Lecture Notes in Computer Science, SOFSEM '96: Theory and Practice of Informatics, 23rd Seminar on Current Trends in Theory and Practice of Informatics, 1996. Zobacz w PBN