Publikacje

Instytut Informatyki

2008

• Marcin Szczuka, Approximate assessment of risk of classification systems in the presence of granularity, w: CS&P 2008 - Concurrency, Specification and Programing, Humboldt Universitaet zu Berlin, Berlin 2008.zobacz w PBN
• Wojciech Frączak, Wojciech Rytter i Mohammadreza Yazdani, Matching Integer Intervals by Minimal Sets of Binary Words with don't cares, Lecture Notes In Computer Science 5029 2008, s. 217–229.zobacz w PBN
• Filip Murlak, Weak index versus Borel rank, w: STACS, 2008.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription., w: KR: International Conference on the Principles of Knowledge Representation and Reasoning, AAAI Press, 2012, s. 560–570.zobacz w PBN
• Agata Janowska, Paweł Janowski i Wojciech Nabiałek, Timed Promela Semantics, w: CS&P, 2008.zobacz w PBN
• Agnieszka Kozubek i Paweł Urzyczyn, In the search of a naive type theory, Lecture Notes In Computer Science 4941 2008, s. 110–124.zobacz w PBN
• Marcin Szczuka, Risk assessment in granular environments, w: PRICAI 2008 - Pacific Rim International Conference on Artificial Intelligence, Institute of Information Technology, Vietnamese Academy of Sciences and Technology, Vietnam 2008.zobacz w PBN
• Johann A. Makowsky i Damian Niwiński, The Ackermann Award 2008, Lecture Notes In Computer Science 5213 2008, s. 508–512.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Johannes Nowak, A Path Cover Technique for LCAs in Dags, Lecture Notes In Computer Science 5124 2008, s. 222–233.zobacz w PBN
• Jan Hidders i Jacek Sroka, Towards a Calculus for Collection-Oriented Scientific Workflows with Side Effects., w: OTM Conferences, 2008.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Paweł Findeisen i Grzegorz Wolny, Time Distribution in Structural Workflow Nets, Fundamenta Informaticae 85 (1-4) 2008, s. 67–87.zobacz w PBN
• Anh Linh Nguyen i Rajeev Gore, Analytic Cut-free Tableaux for Regular Modal Logics of Agent Beliefs, Lecture Notes In Computer Science 5056 2008, s. 268–287.zobacz w PBN
• Anna Gambin, Piotr Krzyżanowski i Piotr Pokarowski, Aggregation Algorithms for Perturbed Markov Chains with Applications to Networks Modeling, Siam Journal On Scientific Computing 31 (1) 2008, s. 45–73.zobacz w PBN
• Mikołaj Bojańczyk, The Common Fragment of ACTL and LTL, Lecture Notes In Computer Science 4962 2008, s. 172–185.zobacz w PBN
• Paweł Baturo, Marcin Piatkowski i Wojciech Rytter, The Number of Runs in Sturmian Words, w: CIAA, 2008.zobacz w PBN
• Krzysztof Stencel i Patrycja Węgrzynowicz, Implementation Variants of the Singleton Design Pattern., w: OTM Workshops, 2008.zobacz w PBN
• Edward Ochmański i Jerzy Tyszkiewicz (red.), Mathematical Foundations of Computer Science 2008, 33rd International Symposium, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2008.zobacz w PBN
• Sinh Hoa Nguyen, Thanh Nguyen i Hung Son Nguyen, A hybrid system for learning sunspot recognition and classification, w: Proceedings of International Conference on Concurrency, Specification and Programming 2008, Humboldt Universität zu Berlin, Berlin 2008.zobacz w PBN
• Gudmund Skovbjerg Frandsen i Piotr Sankowski, Dynamic Normal Forms and Dynamic Characteristic Polynomial, Lecture Notes In Computer Science 5125 2008, s. 434–446.zobacz w PBN
• 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
• Jean-Sebastien Sereni, Łukasz Kowalik i Riste Skrekovski, Total colouring of plane graphs with maximum degree nine, Siam Journal On Discrete Mathematics 22 (4) 2008, s. 1462––1479.zobacz w PBN
• Daria Walukiewicz-Chrząszcz i Jacek Chrząszcz, Consistency and completeness of rewriting in the Calculus of Constructions, Logical Methods In Computer Science 4 (3:8) 2008, s. 1–20.zobacz w PBN
• Anjana Mahanta i Hung Son Nguyen, Discovery by relation approximation, w: Proceedings of International Workshop on Soft Computing for Knowledge Technology - SCKT’2008(in conjunction with PRICAI 2008, Hanoi University of Technology, Hanoi 2008.zobacz w PBN
• Mikołaj Bojańczyk i Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Lecture Notes In Computer Science 5126 2008, s. 233–245.zobacz w PBN
• Mikołaj Bojańczyk, Tree-Walking Automata, Lecture Notes In Computer Science 5196 2008, s. 1–2.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
• Aleksy Schubert, On the building of affine retractions, Mathematical Structures In Computer Science 18 (4) 2008, s. 753–793.zobacz w PBN
• Anh Linh Nguyen, Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics, Logic Journal Of The Igpl 16 (2) 2008, s. 175–193.zobacz w PBN
• Hung Son Nguyen i Tu Ho, Rough document clustering and the Internet, w: Handbook of Granular Computing, Wiley & Sons, New York 2008.zobacz w PBN
• Grzegorz Falda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Executable Platform Independent Models for Data Intensive Applications, Lecture Notes In Computer Science 5103 2008, s. 301–310.zobacz w PBN
• Jan Hidders, Natalia Kwaśnikowska, Jacek Sroka, Jerzy Tyszkiewicz i Jan Van den Bussche, DFL: A dataflow language based on Petri nets and nested relational calculus, Information Systems 33 (3) 2008, s. 261–284.zobacz w PBN
• Filip Murlak, The Wadge Hierarchy of Deterministic Tree Languages, Logical Methods In Computer Science 4 (4) 2008, s. 1–44.zobacz w PBN
• Aleksy Schubert, Krzysztof Jakubczyk i Jędrzej Fulara, Supplementing Java Bytecode with Specifications, w: Software Engineering Techniques in Progress, Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław 2008.zobacz w PBN
• Richard Cole i Łukasz Kowalik, New Linear-Time Algortihms for Edge-Coloring Planar Graphs, Algorithmica 50 (3) 2008, s. 351–368.zobacz w PBN
• Hung Son Nguyen i Andrzej Skowron, Rough set approach to KDD (Extended abstract), Lecture Notes In Computer Science 5009 2008, s. 19–20.zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, OCL as the Query Language for UML Model Execution, Lecture Notes In Computer Science 5103 2008, s. 311–320.zobacz w PBN
• Michel Bidoit, Donald Sannella i Andrzej Tarlecki, Observational interpretation of Casl specifications, Mathematical Structures In Computer Science 18 (2) 2008, s. 325–371.zobacz w PBN
• Janina Mincer-Daszkiewicz, International Cooperation and Mobility in Higher Education from IT Perspective, w: EUNIS 2008, The 14th International Conference of European University Information Systems, University of Aarhus, Aarhus, Dania 2008, s. 133(abstract).zobacz w PBN
• Tomasz Pieciukiewicz, Krzysztof Stencel i Kazimierz Subieta, Recursive Query Processing in SBQL, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 57–76.zobacz w PBN
• Anh Linh Nguyen i Rajeev Gore, Sound Global Caching for Abstract Modal Tableaux, w: CS&P, 2008.zobacz w PBN
• Marcin Szczuka, Towards approximation of risk, Lecture Notes In Computer Science 5306 2008, s. 320–328.zobacz w PBN
• Michał Adamaszek, Piotr Chrząstowski-Wachtel i Anna Niewiarowska, VIPER, a Student-Friendly Visual Interpreter of Pascal, Lecture Notes In Computer Science 5090 2008, s. 192–203.zobacz w PBN
• Piotr Sankowski, Processor Efficient Parallel Matching, Theory Of Computing Systems 42 (1) 2008, s. 73–90.zobacz w PBN
• Janina Mincer-Daszkiewicz, Zarządzanie tożsamością w systemach internetowych uczelni wyższych, w: Informatyczne Wspomaganie Zarządzania Uczelnią, 2008.zobacz w PBN
• Radosław Adamus, Michał Lentner, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Stack-Based Architecture andStack-Based Query Language, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 77–95.zobacz w PBN
• Anh Linh Nguyen, An Efficient Tableau Prover using Global Caching for the Description Logic ALC, w: CS&P, 2008.zobacz w PBN
• P Sankowski, Perla Kacman i Jacek Majewski, Modeling of bias anomaly in (Ga,Mn)As tunneling magnetoresistance structures, Journal Of Applied Physics 103 2008, s. 1–10.zobacz w PBN
• Krzysztof Diks i Jan Madey, From Top Coders to Top IT Professionals, Lecture Notes In Computer Science 5090 2008, s. 31–40.zobacz w PBN
• Marcin Peczarski, The Gold Partition Conjecture for 6-Thin Posets, Order-a Journal On The Theory Of Ordered Sets And Its Applications 25 (2) 2008, s. 91–103.zobacz w PBN
• Andrzej Szałas, Towards Incorporating Background Theories into Quantifier Elimination, Journal Of Applied Non-classical Logics 18 (2-3) 2008, s. 325–340.zobacz w PBN
• Radosław Adamus, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, SBQL Object Views - Unlimited Mapping and Updatability, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 119–140.zobacz w PBN
• Karolina Majorek, Marcin Jąkalski, Janusz Bujnicki i Łukasz Kozłowski, First Steps of Protein Structure Prediction, w: Prediction of Protein Structures, Functions, and Interactions, 2008, s. 39–62.zobacz w PBN
• Piotr Sankowski, P. Kacman i J. A. Majewski, Self-consistent model of spin dependent tunneling in (Ga,Mn)As structures, Physica E-low-dimensional Systems & Nanostructures 40 (6) 2008, s. 1944–1946.zobacz w PBN
• Mikołaj Bojańczyk, Luc Segoufin i Howard Straubing, Piecewise Testable Tree Languages, w: LICS, 2008.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Colcombet, Tree-Walking Automata Do Not Recognize All Regular Languages, Siam Journal On Computing 38 (2) 2008, s. 658–701.zobacz w PBN
• Dov M. Gabbay, Renate Schmidt i Andrzej Szałas, Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications, College Publications, London, 2008.zobacz w PBN
• Grzegorz Fałda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Object Oriented Database Prototype as a Model Execution Engine for Executable UML, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 167–178.zobacz w PBN
• Andrzej Piotr Janusz, Similarity Relation in Classification Problems, w: Proceedings of RSCTC 2008, 2008, s. 211–222.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Rough sets and granular computing in hierarchical learning, w: Handbook of Granular Computing, Wiley & Sons, New York 2008.zobacz w PBN
• Piotr Sankowski, Algebraic Graph Algorithms, Lecture Notes In Computer Science 5162 2008, s. 68–82.zobacz w PBN
• Dariusz R. Kowalski i Adam Malinowski, How to meet in anonymous network, Theoretical Computer Science 399 (1-2) 2008, s. 141–156.zobacz w PBN
• Paweł Parys, Systems of Equations Satisfied in All Commutative Finite Semigroups., w: FoSSaCS, 2008.zobacz w PBN
• Radosław Adamus, Marcin Daczkowski, Tomasz Kowalski, Michał Lentner, Tomasz Pieciukiewicz, Mariusz Trzaska, Tomasz Wardziak, Jacek Wiślicki, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Overview of the Project ODRA, w: Proceedings of the First International Conference on Object Databases - ICOODB 2008, Tribun EU, Brno 2008, s. 179–197.zobacz w PBN
• Marek Stępień i Jerzy Paweł Tyszkiewicz, Computer Algorithm to Detect Similar Administrative Documents from the Ur III Archives, w: Proceedings of the 51st Rencontre Assyriologique International, Held at The Oriental Institute of The University of Chicago, July 18 – 22, 2005, Chicago 2008.zobacz w PBN
• Mikołaj Bojańczyk i Paweł Parys, XPath Evaluation in Linear Time, w: PODS, 2008.zobacz w PBN
• Sławomir Lasota i Igor Walukiewicz, Alternating timed automata, Acm Transactions On Computational Logic 9 (2) 2008.zobacz w PBN
• Paweł Urzyczyn i Morten Heine Soerensen, Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions, Journal Of Symbolic Logic 73 (3) 2008, s. 919–932.zobacz w PBN
• Grzegorz Fałda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Platform-Independent Programming of Data-Intensive Applications Using UML, Lecture Notes In Computer Science 5082 2008, s. 103–115.zobacz w PBN
• Patryk Czarnik i Aleksy Schubert, Extending Operational Semantics of the Java Bytecode, w: Trustworthy Global Computing, 2008, s. 57–72.zobacz w PBN
• Krzysztof Stencel i Patrycja Węgrzynowicz, Visitor Pattern Revisited for Recognition, w: ADBIS (local proceedings), 2008.zobacz w PBN
• Jan Małuszyński, Andrzej Szałas i Aida Vitória, Paraconsistent Logic Programs with Four-Valued Rough Sets, Lecture Notes In Computer Science 5306 2008, s. 41–51.zobacz w PBN
• Maxime Crochemore i Wojciech Rytter, Squares and Repetitions, w: Encyclopedia of Algorithms, 2008.zobacz w PBN
• Piotr Sankowski, P. Kacman i J. A. Majewski, Modeling of bias anomaly in (Ga,Mn)As structures, Journal Of Applied Physics 103 (10) 2008, s. 103709–103702.zobacz w PBN
• Patrycja Węgrzynowicz i Krzysztof Stencel, Detection of Diverse Design Pattern Variants, w: APSEC, 2008.zobacz w PBN
• Piotr Wasilewski i Dominik Ślęzak, Foundations of Rough Sets from Vagueness Perspective, w: Rough Computing. Theories, Technologies and Applications, Information Science Reference, USA 2008.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, Deterministic 7/8-Approximation for the Metric Maximum TSP, w: APPROX-RANDOM, 2008.zobacz w PBN
• Aida Vitória, Andrzej Szałas i Jan Małuszyński, Four-Valued Extension of Rough Sets, Lecture Notes In Computer Science 5009 2008, s. 106–114.zobacz w PBN
• Marcin Mucha, Maximum Matching, w: Encyclopedia of Algorithms, 2008.zobacz w PBN
• Andrzej Tarlecki, T. Mossakowski, A. Haxthausen i D. Sannella, CASL --- The Common Algebraic Specification Language, w: Logics of Specification Languages, Springer, 2008.zobacz w PBN
• Jakub Radoszewski, Przemysława Kanarek i Adam Iwanicki (red.), XV Olimpiada Informatyczna 2007/2008, Komitet Główny Olimpiady Informatycznej, Warszawa 2008.zobacz w PBN
• Piotr Hofman i Marcin Pilipczuk, A few new facts about the EKG sequence, Journal Of Integer Sequences 11 2008.zobacz w PBN
• Hung Son Nguyen i Andrzej Skowron, A rough granular computing in discovery of process models from data and domain knowledge, Journal Of Chongqing University Of Post And Telecommunications 20 (3) 2008, s. 341–347.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, Observability Concepts in Abstract Data Type Specification, 30 Years Later, w: Concurrency, Graphs and Models, 2008.zobacz w PBN
• Naveen Garg, Anupam Gupta, Stefano Leonardi i Piotr Sankowski, Stochastic analyses for online combinatorial optimization problems, w: SODA, 2008.zobacz w PBN
• Ewa Madalińska-Bugaj i Anh Linh Nguyen, Generalizing the QSQR Evaluation Method for Horn Knowledge Bases, w: New Challenges in Applied Intelligence Technologies, 2008.zobacz w PBN
• Agata Janowska, Paweł Janowski i Dobiesław Wróblewski, Translation of Intermediate Language to Timed Automata with Discrete Data, Fundamenta Informaticae 85 (1-4) 2008, s. 235–248.zobacz w PBN
• Jakub Radoszewski, Jakub Łącki i Marcin Kubica (red.), Baltic Olympiad in Informatics 2008, Task and Solutions, 2008.zobacz w PBN
• Krzysztof Diks, Marcin Kubica, Jakub Radoszewski i Krzysztof Stencel, A Proposal for a Task Preparation Process, Olympiads In Informatics 2 2008, s. 64–74.zobacz w PBN
• Hung Son Nguyen, Andrzej Skowron i Jaroslaw Stepaniuk, Discovery of changes along trajectories generated by process models induced from data and domain knowledge, w: Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P 2008), Gross Vaeter, Germany, September 29-October 1, 2008, Humboldt Universitaet zu Berlin, Berlin 2008.zobacz w PBN
• María Victoria Cengarle, Alexander Knapp, Andrzej Tarlecki i Martin Wirsing, A Heterogeneous Approach to UML Semantics, w: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2008.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman i Tomasz Waleń, Improved Algorithms for the Range Next Value Problem and Applications, w: STACS, 2008.zobacz w PBN
• Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski i Mohit Singh, Set Covering with our Eyes Closed., w: FOCS, 2008.zobacz w PBN
• Agata Janowska, Paweł Janowski i Wojciech Nabiałek, Translation of Timed Promela to Timed Automata with Discrete Data, Fundamenta Informaticae 85 (1-4) 2008, s. 409–424.zobacz w PBN
• Marcin Pilipczuk i Jakub Wojtaszczyk, The negative association property for the absolute values of random variables equidistributed on a gene ralized Orlicz ball, Positivity 12 2008, s. 421–474.zobacz w PBN

2007

• Kenneth Revett i Marcin Szczuka, Analysis of a Lymphoma/Leukemia Dataset Using Rough Sets, Lecture Notes In Computer Science 4413 2007, s. 229–239.zobacz w PBN
• Juhani Karhumaki, Yury Lifshits i Wojciech Rytter, Tiling Periodicity, Lecture Notes In Computer Science 4580 2007, s. 295–306.zobacz w PBN
• Mikołaj Bojańczyk, A new algorithm for testing if a regular language is locally threshold testable, Information Processing Letters 104 (3) 2007, s. 91–94.zobacz w PBN
• Jacek Chrząszcz i Daria Walukiewicz-Chrząszcz, Towards rewriting in Coq, Lecture Notes In Computer Science 4600 2007, s. 113–131.zobacz w PBN
• Wojciech Plandowski, Palindromes in Mathematics, w: XXth Symposium on Photonics Applications in Astronomy, Communications,Industry and High Energy Physics Applications, Warszawa 2007.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Hierarchical Rough Classifiers, Lecture Notes In Computer Science 4585 2007, s. 40–50.zobacz w PBN
• Costas Iliopoulos, M. Rahman i Wojciech Rytter, Algorithms for Two Versions of LCS Problem for Indeterminate Strings, w: 18th International Workshop on Combinatorial Algorithms, London 2007.zobacz w PBN
• Henrik Bjorklund i Mikołaj Bojańczyk, Bounded Depth Data Trees, Lecture Notes In Computer Science 4596 2007, s. 862–874.zobacz w PBN
• Artur Czumaj, Mirosław Kowaluk i Andrzej Lingas, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science 380 (1) 2007, s. 37–46.zobacz w PBN
• Rajeev Gore i Anh Linh Nguyen, EXPTIME Tableaux for ALC Using Sound Global Caching, w: Proceedings of Description Logics 2007, Bozen-Bolzano University Press, Bozen-Bolzano 2007.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, Learning Concept Approximation from the pair-wise Space, w: Concurrency, Specification and Programming Workshop 2007, Zakład Graficzny Uniwersytetu Warszawskiego, Warszawa 2007.zobacz w PBN
• Wojciech Rytter, Parallel algorithms on strings, w: Handbook of Parallel Computing: Models, Algorithms and Applications, Chapman and Hall, Dordrecht 2007.zobacz w PBN
• Henrik Bjorklund i Mikołaj Bojańczyk, Shuffle Expressions and Words with Nested Data, Lecture Notes In Computer Science 4708 2007, s. 750–761.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication, Lecture Notes In Computer Science 4698 2007, s. 265–274.zobacz w PBN
• Krzysztof Diks, Marcin Kubica i Krzysztof Stencel, Polish Olympiad in Informatics - 14 Years of Experience, w: Olympiads in Informatics, Institute of Mathematics and Informatics, Lithuania 2007.zobacz w PBN
• Patrick Doherty, Witold Lukaszewicz i Andrzej Szałas, Communication between agents with heterogeneous perceptual capabilities, Information Fusion 8 (1) 2007, s. 56–69.zobacz w PBN
• Jing Yao, Pawan Lingras, Wei-Zhi WU, Marcin Szczuka, Nick Cercone i Dominik Ślęzak (red.), Rough Sets and Knowledge Technology Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007, pp. 1-668, Springer, Heidelberg 2007.zobacz w PBN
• Wojciech Fraczak, Wojciech Rytter i Mohammadreza Yazdani, TCAM representations of intervals of integers encoded by binary trees, w: 18th International Workshop on Combinatorial Algorithms, College Publications, London 2007.zobacz w PBN
• Piotr Hoffman i Mikołaj Bojańczyk, Reachability in Unions of Commutative Rewriting Systems Is Decidable, Lecture Notes In Computer Science 4393 2007, s. 622–633.zobacz w PBN
• Eryk Kopczyński, Omega-Regular Half-positional winning conditions, Lecture Notes In Computer Science 4646 2007, s. 41–53.zobacz w PBN
• Janina Mincer-Daszkiewicz, Electronic Student Identity Cards at the University of Warsaw, w: Eunis 2007, The 13th International Conference of European University Information Systems, Grenoble 2007, s. 34.zobacz w PBN
• D. Gabbay i Andrzej Szałas, Second-order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals, Studia Logica 87 2007, s. 37–50.zobacz w PBN
• Jan Maluszynski, Andrzej Szałas i Aida Vitória, A Four-Valued Logic for Rough Set-Like Approximate Reasoning, Lecture Notes In Computer Science Transactions On Rough Sets 6 2007, s. 176–190.zobacz w PBN
• Marcin Szczuka, Daniel Howard, Dominik Ślęzak, Haeng-kon Kim, Tai-hoon Kim, Il-seok Ko, Geuk Lee i Peter M.A. Sloot (red.), Advances in Hybrid Information Technology: zbiór wybranych, poprawionych i rozszerzonych artykułów z konferencji ICHIT’2006, pp.1-668, Springer, Heidelberg 2007.zobacz w PBN
• Marcin Konrad Dziubiński, Rineke Verbrugge i Barbara Dunin-Kęplicz, Complexity issues in multiagent logics, Fundamenta Informaticae 75 (1) 2007, s. 239–262.zobacz w PBN
• Łukasz Kowalik, Adjacency Queries in Dynamic Sparse Graphs, Information Processing Letters 102 (5) 2007, s. 191–195.zobacz w PBN
• Agata Janowska i Wojciech Penczek, Path Compression in Timed Automata, Fundamenta Informaticae 79 (3-4) 2007, s. 379–399.zobacz w PBN
• Marek Stępień, Jerzy Tyszkiewicz i Wojciech Jaworski, Water transport in Sumer in the kingdom of the III Dynasty of Ur, w: Proceedings of the ECML/PKDD'2007 Discovery Challenge, Uniwersytet Warszawski, Warszawa 2007.zobacz w PBN
• Hung Son Nguyen (red.), Proceedings of the ECML/PKDD 2007 Discovery Challenge Workshop during 18th European Conference on Machine Learning and 11th European Conference on Principles of Practice and Knowledge Discovery in Databases, Zakład Graficzny Uniwersytetu Warszawskiego, Warszawa 2007.zobacz w PBN
• P. Doherty, Barbara Dunin-Kęplicz i Andrzej Szałas, Dynamics of Approximate Information Fusion, Lecture Notes In Computer Science 4585 2007, s. 668–677.zobacz w PBN
• Richard Cole, Łukasz Kowalik i Riste Skrekovski, A Generalization of Kotzig's Theorem and its Application, Siam Journal On Discrete Mathematics 21 (1) 2007, s. 93–106.zobacz w PBN
• Jacques Duparc i Filip Murlak, On the topological complexity of weakly recognizable tree languages, Lecture Notes In Computer Science 4639 2007, s. 261–273.zobacz w PBN
• Agata Janowska i Paweł Janowski, Translation of Intermediate Language to Timed Automata with Discrete Data, w: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'07), Warszawa 2007.zobacz w PBN
• Anh Linh Nguyen i Rajeev Gore, Analytic Cut-free Tableaux for Regular Modal Logics of Agent Beliefs, w: Pre-proceedings of the 8th International Workshop on Computational Logic in Multi-Agent Systems CLIMA VIII, 2007.zobacz w PBN
• Janusz Józef Dutkowski i Anna Gambin, On consensus biomarker selection, Bmc Bioinformatics 8 2007, s. S5.zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Equivalence of simple functions, Theoretical Computer Science 376 (1) 2007, s. 42–51.zobacz w PBN
• Barbara Dunin-Kęplicz i Andrzej Szałas, Towards Approximate BGI Systems, Lecture Notes In Computer Science 4696 2007, s. 277–287.zobacz w PBN
• Andre Arnold, Jacques Duparc, Filip Murlak i Damian Niwiński, On the topological complexity of tree languages, w: Logic and automata: History and Perspectives, Amsterdam University Press, Amsterdam 2007.zobacz w PBN
• Janusz Dutkowski i Anna Gambin, On consensus biomarker selection, Bmc Bioinformatics 8 (Suppl. 5) 2007, s. 1–13.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
• A. Arnold i D. Niwiński, Continuous Separation of Game Languages, Fundamenta Informaticae Vol. 81, nr 1-3 2007, s. 19–28.zobacz w PBN
• Adam Wierzbicki, Krzysztof Rządca i Denis Trystram, Fair Game-Theoretic Resource Management in Dedicated Grids, w: Cluster Computing and the Grid, 2007. CCGRID 2007. Seventh IEEE International Symposium on, IEEE, 2007, s. 343–350.zobacz w PBN
• Wojciech Rytter, The number of runs in a string: improved analysis of the linear upper bound, Information And Computation 205 (9) 2007, s. 1459–1469.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge (red.), Proceedings of the Third Workshop on Formal Approaches to Multi-agent Systems, Durham University, Durham 2007.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality, Lecture Notes In Computer Science 4619 2007, s. 589–600.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physica Status Solidi C-conferences 4 (2) 2007, s. 493–496.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Paweł Findeisen i Grzegorz Wolny, Time Distribution in Structural Workflow Nets, w: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'07), Uniwersytet Warszawski, Warszawa 2007.zobacz w PBN
• Martyna Barczuk i Jerzy Tyszkiewicz, Magik - nowoczesne narzędzie dla badacza literatury, Teksty Drugie 3 2007, s. 224–228.zobacz w PBN
• Janina Mincer-Daszkiewicz, Na studia z KReM-em, Forum Akademickie 7-8 2007, s. 67–69.zobacz w PBN
• Anna Gambin, Janusz Dutkowski, Jakub Karczmarski, Bogusław Kluge, Krzysztof Kowalczyk, Jerzy Ostrowski, Jarosław Poznański, Jerzy Tiuryn, Magda Bakun i Michał Dadlez, Automated reduction and interpretation of multidimensional mass spectra for analysis of complex peptide mixtures, International Journal Of Mass Spectrometry 260 2007, s. 20–30.zobacz w PBN
• P. Doherty i A. Szałas, A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 179–193.zobacz w PBN
• Marcin Grynberg, Li Zhanwen, Ewa Maria Szczurek i Adam Godzik, Putative type IV secretion genes in Bacillus anthracis, Trends In Microbiology 15 (5) 2007.zobacz w PBN
• Michał Drabikowski, Szymon Nowakowski i Jerzy Tiuryn, Library of Local Descriptors Models the Core of Proteins Accurately, Proteins-structure Function And Bioinformatics 69 (3) 2007, s. 499–510.zobacz w PBN
• Marcin Konrad Dziubiński, Rineke Verbrugge i Barbara Dunin-Kęplicz, Reducing the complexity of logics for multiagent systems, w: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems, ACM Press, New York, NY, USA 2007, s. 1082–1084.zobacz w PBN
• Anna Gambin i P. Wojtalewicz, CTX-BLAST - context sensitive version of protein BLAST, Bioinformatics 23 (13) 2007, s. 1686–1688.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Vertical spin transport in semiconductor heterostructures, Low Temperature Physics 33 2007, s. 187.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Why is Teaching Programming so Important and so Difficult?, w: Proceedings of conference DIDINFO 2007, University of Matej Bel, Banska Bystrica 2007.zobacz w PBN
• Lech Banachowski i Krzysztof Stencel, Systemty zarządzania bazami danych, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 2007.zobacz w PBN
• Ł. Bolikowski i A. Gambin, New Metrics for Phylogenies, Fundamenta Informaticae Vol. 78, nr 2 2007, s. 199–216.zobacz w PBN
• M. Barczuk i J. Tyszkiewicz, 'Magik': a scholar's modern tool, Teksty Drugie Array 2007, s. 224–228.zobacz w PBN
• Jerzy Tiuryn i Damian Wójtowicz, Evolution of gene families based on gene duplication, loss, accumulated change, and innovation, Journal Of Computational Biology 14 (4) 2007, s. 479–495.zobacz w PBN
• Anna Gambin, Janusz Dutkowski, Jakub Karczmarski, Bogusław Kluge, Krzysztof Kowalczyk, Jerzy Ostrowski, Jarosław Poznański, Jerzy Tiuryn, M. Bakun i Michał Lech Dadlez, Automated reduction and interpretation of multidimensional mass spectra for analysis of complex peptide mixtures, International Journal Of Mass Spectrometry 260 2007, s. 20–30.zobacz w PBN
• Anna Gambin i Ewa Szczurek, No-regret boosting, Lecture Notes In Computer Science 4431 2007, s. 422–431.zobacz w PBN
• Krzysztof Diks i Piotr Sankowski, Dynamic Plane Transitive Closure, Lecture Notes In Computer Science 4698 2007, s. 594–604.zobacz w PBN
• Piotr Sankowski, Faster dynamic matchings and vertex connectivity, w: SODA 2007, SIAM Ź, Louisiana 2007.zobacz w PBN
• Magdalena Kaliszewska, Aneta Sobczak, Tomasz Pieciukiewicz i Krzysztof Stencel, Technologie internetowe, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 2007.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physical Review B 75 2007, s. 45306.zobacz w PBN
• Jerzy Tiuryn, Damian Wójtowicz i Ryszard Rudnicki, A Discrete Model of Evolution of Small Paralog Families, Mathematical Models & Methods In Applied Sciences 17 (6) 2007, s. 933–956.zobacz w PBN
• Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz i Jan Van den Bussche, A Formal Model of Dataflow Repositories, Lecture Notes In Computer Science 4544 2007, s. 105–121.zobacz w PBN
• Anh Linh Nguyen, Foundations of Modal Deductive Databases, Fundamenta Informaticae 79 (1) 2007, s. 85–135.zobacz w PBN
• Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz i Jan Van den Bussche, Database Query Processing Using Finite Cursor Machines, Lecture Notes In Computer Science 4353 2007, s. 284–298.zobacz w PBN
• S. Leonardi i Piotr Sankowski, Network Formation Games with Local Coalitions, w: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC 2007), Oregon 2007.zobacz w PBN
• Marcin Kubica, Powódź, w: XIV Olimpiada Informatyczna 2006/2007, Komitet Główny Olimpiady Informatycznej, Warszawa 2007.zobacz w PBN
• Paweł Górecki i Jerzy Tiuryn, URec: a system for unrooted reconciliation, Bioinformatics 23 (4) 2007, s. 511–512.zobacz w PBN
• Andrzej Tarlecki, Toward specifications for reconfigurable component systems, Lecture Notes In Computer Science 4546 2007, s. 24–28.zobacz w PBN
• Rajeev Gore i Anh Linh Nguyen, EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies, Lecture Notes In Computer Science 4548 2007, s. 133–148.zobacz w PBN
• Thorsten Altenkirch i Paweł Urzyczyn (red.), Special Issue on the 7th International Conference on Typed Lambda Calculi and Applications, TLCA '05, IOS Press, Amsterdam 2007.zobacz w PBN
• Mikołaj Bojańczyk, Two-way unary temporal logic over trees, w: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Los Alamitos, California 2007.zobacz w PBN
• Marcin Kubica, Koleje, w: XIV Olimpiada Informatyczna 2006/2007, Komitet Główny Olimpiady Informatycznej, Warszawa 2007.zobacz w PBN
• Dominik Ślęzak i Piotr Wasilewski, Granular sets. Foundations and case study of tolerance spaces, Lecture Notes In Computer Science (4039) 2007, s. 461–469.zobacz w PBN
• Paweł Górecki i Jerzy Tiuryn, Inferring phylogeny from whole genomes, Bioinformatics 23 2007, s. 116–122.zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel i Kazimierz Subieta, Implementing OCL as a Database Query Language, Lecture Notes In Computer Science 4805 2007, s. 17–18.zobacz w PBN
• Anh Linh Nguyen, Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity, Lecture Notes In Computer Science 4670 2007, s. 438–439.zobacz w PBN
• M. Sorensen i Paweł Urzyczyn, Sequent Calculus, Dialogues, and Cut-Elimination,, w: Reflections on Type Theory, Lambda Calculus, and the Mind, Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday, Radboud University, Nijmegen 2007.zobacz w PBN
• Jacek Chrząszcz i Jakub Sakowicz, Papuq: a Coq assistant, w: Proceedings of Workshop on Proof Assistants and Types in Education (PATE'07), Paris 2007.zobacz w PBN
• Janina Mincer-Daszkiewicz, Dobór oprogramowania dla uczelni wyższych, w: Panel dyskusyjny "Neutralność technologiczna i byty pokrewne" Trzynaste Forum Teleinformatyki, Legionowo 2007.zobacz w PBN
• M. Dziubiński, R. Verbrugge i B. Dunin-Kęplicz, Complexity Issues in Multiagent Logics, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 239–262.zobacz w PBN
• Janusz Dutkowski i Jerzy Tiuryn, Identification of functional modules from conserved ancestral protein-protein interactions, Bioinformatics 23 2007, s. 149–158.zobacz w PBN
• Radoslaw Adamus, Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Implementing a P2P Network Through Updatable Database Views, Lecture Notes In Computer Science 4805 2007, s. 35–36.zobacz w PBN
• Christian Haack, Erik Poll, Jan Schaefer i Aleksy Schubert, Immutable Objects for a Java-Like Language, Lecture Notes In Computer Science 4421 2007, s. 347–362.zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Querying Workflows over Distributed Systems, w: WEBIST 2007 - 3rd International Conference on Web Information Systems and Technologies, Proceedings, INSTICC Press, Setubal 2007, s. 251–254.zobacz w PBN
• Mikołaj Rybiński i Anna Gambin, Details of the JAK-STAT Signaling Pathway Model, Acta Biochimica Polonica 54 (Suppl. 3) 2007, s. 63–64.zobacz w PBN
• Lars Arge, Christian Cachin, Tomasz Jurdziński i Andrzej Tarlecki (red.), Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings., Springer, 2007.zobacz w PBN
• Łukasz Bolikowski i Anna Gambin, New Metrics for Phylogenies, Fundamenta Informaticae 78 (2) 2007, s. 199–216.zobacz w PBN
• Bartek Wilczyński i Jerzy Tiuryn, Reconstruction of Mammalian Cell Cycle Regulatory Network from Microarray Data using Stochastic Logical Networks, Lecture Notes In Computer Science 4695 2007, s. 121–135.zobacz w PBN
• 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
• C. Iliopoulos, Marcin Kubica, M. Rahman i Tomasz Waleń, Algorithms for Computing the Longest Parameterized Common Subsequence, Lecture Notes In Computer Science 4580 2007, s. 265–273.zobacz w PBN
• Mikołaj Bojańczyk, Forest Expressions, Lecture Notes In Computer Science 4646 2007, s. 146–160.zobacz w PBN
• Jakub Pawlewicz i Łukasz Lew, Improving Depth-First PN-Search: 1+ε trick, w: Computers and Games 2006, Springer Berlin Heidelberg, 2007, s. 160–170.zobacz w PBN
• Marcin Szczuka i Dominik Ślęzak, Rough Neural Networks for Complex Concepts, Lecture Notes In Computer Science 4482 2007, s. 574–582.zobacz w PBN
• Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Efficient Computation of Throughput Values of Context-Free Languages, Lecture Notes In Computer Science 4783 2007, s. 203–213.zobacz w PBN
• Sibylle Froeschle i Sławomir Lasota, Causality Versus True-Concurrency, Theoretical Computer Science 386 2007, s. 169–187.zobacz w PBN
• Marcin Peczarski, The Ford--Johnson algorithm still unbeaten for less than 47 elements, Information Processing Letters 101 2007, s. 126–128.zobacz w PBN
• Anh Linh Nguyen, Weakening Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity, w: Proceedings of Automated Deduction: Decidability, Complexity, Tractability, Bremen 2007.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

• Piotr Sankowski, Perła Kacman, Jacek Majewski i J. Dietl, Tight-binding model of spin-polarized tunnelling in (Ga,Mn)As-basek structures, Physica E-low-dimensional Systems & Nanostructures 32 2006, s. 275–378.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Colcombet, Tree-walking automata cannot be determinized, Theoretical Computer Science 350 (3) 2006, s. 164–173.zobacz w PBN
• Sławomir Lasota, Decidability of Performance Equivalence for Basic Parallel Processes, Theoretical Computer Science 360 (1-3) 2006, s. 172–192.zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Optimization of Queries Invoking Views by Query Tail Absorption, Lecture Notes In Computer Science 4243 2006, s. 129–138.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Colcombet, Bounds in w-Regularity, w: Annual IEEE Symposium on Logic in Computer Science, Seattle 2006.zobacz w PBN
• Marta Łuksza, Bogusław Kluge, Jerzy Ostrowski, Jakub Karczmarski i Anna Gambin, Efficient Model-Based Clustering for LC-MS Data, Lecture Notes In Computer Science 4175 2006, s. 32–43.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i T. Dietl, Theory of spin-dependent tunneling and resonant tunneling in layered structures based on (Ga,Mn)As, Physica Status Solidi C-conferences 3 2006, s. 4188–4191.zobacz w PBN
• Mikołaj Bojańczyk, Mathias Samuelides, Thomas Schwentick i Luc Segoufin, Expressive Power of Pebble Automata, Lecture Notes In Computer Science 4052 2006, s. 7–16.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
• Ryszard Rudnicki, Jerzy Tiuryn i Damian Wójtowicz, A model for the evolution of paralog families in genomes, Journal Of Mathematical Biology 53 (5) 2006, s. 759–770.zobacz w PBN
• Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin i Claire David, Two-Variable Logic on Words with Data, w: Annual IEEE Symposium on Logic in Computer Science, IEEE, Seattle 2006.zobacz w PBN
• Janina Mincer-Daszkiewicz, Central Registry for Results of Maturity Examinations for Student Admission Systems in Poland, w: EUNIS 2006, The 12th International Conference of European University Information Systems, University of Tartu, Tartu, Estonia 2006, s. 486–492.zobacz w PBN
• Henryk Michalewski i Wiesław Kubiś, Small Valdivia compact spaces, Topology And Its Applications 153 (14) 2006, s. 2560–2573.zobacz w PBN
• Jacek Chrząszcz i Daria Walukiewicz-Chrząszcz, Consistency and completeness of rewriting in the Calculus of Constructions, Lecture Notes In Computer Science 4130 2006, s. 619–631.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
• Paweł Górecki i Jerzy Tiuryn, DLS-trees: a model of evolutionary scenarios, Theoretical Computer Science 359 (1-3) 2006, s. 378–399.zobacz w PBN
• Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick i Luc Segoufin, Two-variable logic on data trees and XML reasoning, w: ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, Chicago 2006.zobacz w PBN
• Tomasz Pieciukiewicz, Krzysztof Stencel i Kazimierz Subieta, Object-Oriented Programming with Recursive Queries, w: DBA'06 Proceedings of the 24th IASTED international conference on Database and applications, ACTA Press, Anaheim 2006, s. 228–233.zobacz w PBN
• Piotr Hoffman i Bartosz Klin, Careful With That Computer: On Creating Maps by Multidimensional Scaling of Papyri in Katja Mueller's Recent Studies on the Topography of the Fayum, The Journal Of Juristic Papyrology XXXVI 2006, s. 67–90.zobacz w PBN
• P. Claire, J. Paddon, Derek Willis, Sinh Hoa Nguyen, Trung Nguyen i Hung Son Nguyen, Learning sunspot classification, Fundamenta Informaticae 72 (1-3) 2006, s. 295–309.zobacz w PBN
• Norbert Dojer, Learning Bayesian Networks Does Not Have to Be NP-Hard, Lecture Notes In Computer Science 4162 2006, s. 305–314.zobacz w PBN
• Dariusz Kowalski i Adam Malinowski, How to meet in anonymous network, Lecture Notes In Computer Science 4056 2006, s. 44–58.zobacz w PBN
• Jacek Sroka, Grzegor Kaczor, Jerzy Tyszkiewicz i Andrzej Kierzek, XQTav: an XQuery processor for Taverna environment, Bioinformatics 22 (10) 2006, s. 1280–1281.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Should We Teach Programming Everyone?, w: Information Technologies at School; Selected Papers from 2nd International Conference, Vilnius 2006.zobacz w PBN
• Krzysztof Kaczmarski, Piotr Habela, Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Transparency in Object-Oriented Grid Database Systems, Lecture Notes In Computer Science 3911 2006, s. 675–682.zobacz w PBN
• Tom Verhoeff, Gyula Horvath, Krzysztof Diks i Gordon Cormack, A proposal for an IOI Syllabus, Teaching Mathematics And Computer Science 4 (1) 2006, s. 193–216.zobacz w PBN
• Dominik Ślęzak, Association Reducts: Complexity and Heuristics, w: Rough Sets and Current Trends in Computing, 5h International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Springer, Japonia 2006, s. 157–164.zobacz w PBN
• Hung Son Nguyen, Approximate Boolean reasoning: foundations and applications in data mining, Lecture Notes In Computer Science 4100 2006, s. 334–506.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
• Marcin Mucha i Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Algorithmica 45 (1) 2006, s. 3–20.zobacz w PBN
• Andrzej Szałas i Jerzy Tyszkiewicz, On the Fixpoint Theory of Equality and its Applications, Lecture Notes In Computer Science 4136 2006, s. 388–401.zobacz w PBN
• Jacek Chrząszcz i Jean-Pierre Jouannaud, From OBJ to ML to COQ, Lecture Notes In Computer Science 4060 2006, s. 216–234.zobacz w PBN
• Bartek Wilczyński i Jerzy Tiuryn, Regulatory Network Reconstruction using Stochastic Logical Networks, Lecture Notes In Computer Science 4210 2006, s. 142–154.zobacz w PBN
• Michał Bassa, Robert Dąbrowski, Marcin Engel, Janusz Jabłonowski i Piotr Krzyżanowski, Przysposobienie informatyczne, Warszawa 2006.zobacz w PBN
• Hung Son Nguyen, Knowledge discovery by relation approximation: a rough set approach, Lecture Notes In Computer Science 4062 2006, s. 103–106.zobacz w PBN
• Anna Gambin, K. Bożek, Bartosz Wilczynski i Jerzy Tiuryn, Automated modeling of genetic control in Arabidopsis thaliana, Journal Of Fruit And Ornamental Plant Research 14 2006, s. 163–171.zobacz w PBN
• Piotr Sankowski, Weighted Bipartite Matching in Matrix Multiplication Time, Lecture Notes In Computer Science 4052 2006, s. 274–285.zobacz w PBN
• P. Kolman i Tomasz Waleń, Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set, Lecture Notes In Computer Science 4368 2006, s. 281–291.zobacz w PBN
• Agata Janowska i Wojciech Penczek, Static Path Compression in Timed Systems, w: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'06), Humboldt University, Berlin 2006.zobacz w PBN
• Bartek Wilczyński, Tr. Hvidsten, A. Kryshtafovych, Jerzy Tiuryn, J. Komorowski i K. Fidelis, Using local gene expression similarities to discover regulatory binding site modules, Bmc Bioinformatics 7 2006, s. 505.zobacz w PBN
• Krzysztof Stencel, Półmocna kontrola typów w językach programowania baz danych, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 2006.zobacz w PBN
• A. Janowska i P. Janowski, Slicing of Timed Automata with Discrete Data, Prace Instytutu Podstaw Informatyki Polskiej Akademii Nauk Nr 990 2006, s. 1–29.zobacz w PBN
• Patrick Doherty, Martin Magnusson i Andrzej Szałas, Approximate databases: a support tool for approximate reasoning, Journal Of Applied Non-classical Logics 16 (1-2) 2006, s. 87–118.zobacz w PBN
• Hung Son Nguyen, Sinh Hoa Nguyen i Trung Nguyen, Ontology driven concept approximation, Lecture Notes In Computer Science 4259 2006, s. 547–556.zobacz w PBN
• Anna Gambin, Jerzy Tiuryn i Jerzy Tyszkiewicz, Alignment with context dependent scoring function, Journal Of Computational Biology 13 (1) 2006, s. 81–101.zobacz w PBN
• Filip Murlak, The Wadge Hierarchy of Deterministic Tree Languages, Lecture Notes In Computer Science 4052 2006, s. 428–442.zobacz w PBN
• Damian Wójtowicz i Jerzy Tiuryn, On genome evolution with accumulated change and innovation, Lecture Notes In Computer Science 4205 2006, s. 40–50.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge, Awareness as a vital ingredient of teamwork, w: Proceedings of 5th International Joint Conference on Autonomous Agents and Autonomous Systems (AAMAS 2006), ACM, Hakodate Japan 2006.zobacz w PBN
• Krzysztof Diks, Stefan Dobrev i Andrzej Pelc, Exploring planar graphs using unoriented maps, Journal Of Interconnection Networks 7 2006, s. 353–373.zobacz w PBN
• Janina Mincer-Daszkiewicz, Jak USOS z IRK-ą i CUS-iem radzą sobie na uczelniach wyższych, Kwartalnik Nauk O PrzedsiĘbiorstwie 9 2006, s. 4.zobacz w PBN
• Andrzej Szałas, Second-order reasoning in description logics, Journal Of Applied Non-classical Logics 16 (3-4) 2006, s. 517–530.zobacz w PBN
• Jan Bazan, Rafał Latkowski i Marcin Szczuka, Missing Tempalate Decomposition Metod and its Implementation in Rough Set Exploration System, Lecture Notes In Computer Science 4259 2006, s. 254–263.zobacz w PBN
• Norbert Dojer, Anna Gambin, A. Mizera, Bartosz Wilczyński i Jerzy Tiuryn, Applying Dynamic Bayesian Networks to Perturbed Gene Expression Data, Bmc Bioinformatics 7 2006, s. 249.zobacz w PBN
• Anh Linh Nguyen, Multimodal Logic Programming, Theoretical Computer Science 360 2006, s. 247–288.zobacz w PBN
• Damian Wójtowicz i Jerzy Tiuryn, On genome evolution with innovation, Lecture Notes In Computer Science 4162 2006, s. 801–811.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge (red.), Proceedings of FAMAS'06, Second International Workshop on Formal Approaches to Multi-Agent Systems, Riva del Garda Italy 2006.zobacz w PBN
• Salvatore Greco, Yutaka Hata, Shoji Hirano, Inuiguchi Masahiro, Hung Son Nguyen i Roman Slowinski (red.), Rough Sets and Current Trends in Computing, 5h International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Springer, Japonia 2006.zobacz w PBN
• Stella Orłowska i Andrzej Szałas, Quantifier Elimination in Elementary Set Theory, w: Relational Methods in Computer Science, 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers, Springer, 2006, s. 237–248.zobacz w PBN
• Kenneth Revett, Marcin Szczuka, Pari Jahankhani i Vassilis Kodogiannis, Attribute Selection for EEG Signal Classification Using Rough Sets and Neural Networks, Lecture Notes In Computer Science 4259 2006, s. 408–417.zobacz w PBN
• Anna Gambin, Janusz Dutkowski, Jakub Karczmarski, Bogusław Kluge, K. Kowalczyk, J. Ostrowski, J. Poznanski, Jerzy Tiuryn, M. Bakun i M. Dadlez, Automated reduction and interpretation of multidimensional mass spectra for analysis of complex peptide mixtures, International Journal Of Mass Spectrometry 260 (1) 2006, s. 20–30.zobacz w PBN
• Anh Linh Nguyen, The Data Complexity of MDatalog in Basic Modal Logics, Lecture Notes In Computer Science 4162 2006, s. 729–740.zobacz w PBN
• Wojciech Rytter, The Number of Runs in a String: Improved Analysis of the Linear Upper Bound, Lecture Notes In Computer Science 3884 2006, s. 184–195.zobacz w PBN
• Piotr Sankowski, P. Kacman, J. Majewski i T. Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physical Review B 75 2006, s. 45306.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge, Collective attitudes for teamwork in dynamic environments, w: Semantyka Kategorii Aspektu i Czasu, Polska Akademia Nauk, Warszawa 2006.zobacz w PBN
• Katarzyna Bozek, Anna Gambin, Bartosz Wilczyński i Jerzy Tiuryn, Automated modelling of genetic control in Arabidopsis thaliana, Journal Of Fruit And Ornamental Plant Research 14 2006.zobacz w PBN
• Ewa Orłowska, Alberto Policriti i Andrzej Szałas (red.), Algebraic and relational deductive tools, 2006.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz, Andrzej Skowron i Andrzej Szałas, Knowledge Representation Techniques: Rough Set Approach, Springer, Heidelberg 2006.zobacz w PBN
• Eryk Kopczyński, Half-Positional Determinacy of Infinite Games, Lecture Notes In Computer Science 4052 2006, s. 336–347.zobacz w PBN
• Anh Linh Nguyen, A Bottom-up Method for the Deterministic Horn Fragment of the Description Logic ALC, Lecture Notes In Computer Science 4160 2006, s. 346–358.zobacz w PBN
• Artur Czumaj i Wojciech Rytter, Broadcasting algorithms in radio networks with unknown topology, Journal Of Algorithms-cognition Informatics And Logic 60 (2) 2006, s. 115–143.zobacz w PBN
• Anh Linh Nguyen, On the Deterministic Horn Fragment of Test-free PDL, w: Advances in Modal Logic, King's College Publications, London 2006.zobacz w PBN
• Janusz Jabłonowski, Changes in Computer Science Teaching at Warsaw University, w: International Conference on Computer Systems and Technologies, Veliko Turnovo 2006.zobacz w PBN
• Karina Luksza i Hung Son Nguyen, On application of rough sets to Bayesian network construction from data, w: Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-06), Edition E.D.K, Paris 2006.zobacz w PBN
• Marek Chrobak, C. Durr, W. Jawor, Łukasz Kowalik i Maciej Kurowski, A Note on Scheduling Equal-Length Jobs to Maximize Throughput, Journal Of Scheduling 9 (1) 2006, s. 71–73.zobacz w PBN
• Anh Linh Nguyen, Reasoning about Epistemic States of Agents by Modal Logic Programming, Lecture Notes In Computer Science 3900 2006, s. 37–56.zobacz w PBN
• Wojciech Rytter, The structure of subword graphs and suffix trees of Fibonacci words, Theoretical Computer Science 363 2006, s. 211–223.zobacz w PBN
• M. Sorensen i Paweł Urzyczyn, Lectures on the Curry-Howard Isomorphism, Elsevier, Amsterdam 2006.zobacz w PBN
• Marcin Peczarski, An improvement of the tree code construction, Information Processing Letters 99 2006, s. 92–95.zobacz w PBN
• Thanh Nguyen i Hung Son Nguyen, A Hybrid System for Learning Sunspot Recognition and Classification, w: Proceedings of ICHIT, IEEE, xx 2006.zobacz w PBN
• Łukasz Kowalik, Improved Edge Coloring with Three Colors, Lecture Notes In Computer Science 4271 2006, s. 90–101.zobacz w PBN
• Anh Linh Nguyen, Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming, Fundamenta Informaticae 70 (4) 2006, s. 351–366.zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Prime normal form and equivalence of simple grammars, Theoretical Computer Science 363 (2) 2006, s. 124–134.zobacz w PBN
• Paweł Urzyczyn, Predicates as Types, w: Proof Technology and Computation, IOS Press, Amsterdam 2006.zobacz w PBN
• Marcin Peczarski, The gold partition conjecture, Order-a Journal On The Theory Of Ordered Sets And Its Applications 23 2006, s. 89–95.zobacz w PBN
• Janina Mincer-Daszkiewicz, Dla kogo jest KReM? O systemie automatycznej kwalifikacji kandydatów na studia, Forum Akademickie 6 2006, s. 48–49.zobacz w PBN
• Kenneth Revett i Marcin Szczuka, Analysis of a Lymphoma/Leukemia Dataset Using Rough Sets, w: 2006 International Conference on Hybrid Information Systems, ICHIT’2006, IEEE Computer Society Pres, Los Alamitos 2006.zobacz w PBN
• Łukasz Kowalik, Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures, Lecture Notes In Computer Science 4288 2006, s. 557–566.zobacz w PBN
• Don Sannella i Andrzej Tarlecki, Horizontal composability revisited, Lecture Notes In Computer Science 4060 2006, s. 296–316.zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Equivalence of Functions Represented by Simple Context-Free Grammars with Output, Lecture Notes In Computer Science 4036 2006, s. 71–82.zobacz w PBN
• P. Kralovic i Paweł Urzyczyn (red.), Mathematical Foundations of Computer Science 31st Int. Symposium, Springer, Berlin 2006.zobacz w PBN
• Anna Gambin, Janusz Dutkowski, Jakub Karczmarski, Bogusław Kluge, K. Kowalczyk, J Ostrowski, Jarosław Poznański, Jerzy Tiuryn, M. Bakun i Michał Dadlez, Automated reduction and interpretation of multidimensional mass spectra for analysis of complex peptide mixtures, International Journal Of Mass Spectrometry 260 2006, s. 20–30.zobacz w PBN
• Salvatore Greco, Yutaka Hata, Shoji Hirano, Masahiro Inuiguchi, Sadaaki Miyamoto, Hung Son Nguyen i Roman Slowinski (red.), Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, w: Proceedings, Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Springer, Berlin 2006.zobacz w PBN
• S. Bereg, Marcin Kubica, Tomasz Waleń i B. Zhu, RNA multiple structural alignment with longest common subsequences, Journal Of Combinatorial Optimization 13 (2) 2006, s. 179–188.zobacz w PBN
• Michał Lentner, Krzysztof Stencel i Kazimierz Subieta, Semi-Strong Static Type Checking of Object-Oriented Query Languages, Lecture Notes In Computer Science 3831 2006, s. 399–408.zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice, Lecture Notes In Computer Science 4094 2006, s. 90–101.zobacz w PBN
• Jacek Chrząszcz i Aleksy Schubert, ESC/Java2 as a tool to ensure security in the source code of Java applications, w: Proceedings of SET'2006, Springer, New York 2006.zobacz w PBN
• Rineke Verbrugge i Barbara Dunin-Kęplicz, Collective attitudes for teamwork in dynamic environments / Barbara Dunin-Kęplicz, Rineke Verbrugge., Studia Kognitywne 7 2006, s. Array.zobacz w PBN
• Geuk Lee, Dominik Ślęzak, Peter Slot, Tai Kim, Il Ko, Haeng Kim i Marcin Szczuka (red.), 2006 International Conference on Hybrid Information Systems, ICHIT’2006 ICHIT 2006 – Proceedings, vol I, II, SERC – Security Engineering Research Center, Korea 2006.zobacz w PBN
• Marcin Kubica, R. Rizzi, St, Vialette i Tomasz Waleń, Approximation of RNA Multiple Structural Alignment, Lecture Notes In Computer Science 4009 2006, s. 211–222.zobacz w PBN
• Łukasz Kowalik i Maciej Kurowski, Oracles for Bounded Length Shortest Paths in Planar Graphs, Acm Transactions On Algorithms 2 (3) 2006, s. 335–363.zobacz w PBN
• Stefan Dziembowski, On Forward-Secure Storage, Lecture Notes In Computer Science 4117 2006, s. 251–270.zobacz w PBN
• Jacek Chrząszcz, Tomasz Stachowicz, Andrzej Gąsienica-Samek i Aleksy Schubert, Minik: A tool for maintaining proper Java code structure, w: Proceedings of SET'2006, Springer, New York 2006.zobacz w PBN
• Piotr Sankowski i Perła Kacman, Spin-Dependent Phenomena in (Ga,Mn)As Heterostructures, Acta Physica Polonica A 110 (2) 2006, s. 139–150.zobacz w PBN
• Krzysztof Onak i Paweł Parys, Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders, w: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, 2006, s. 379–388.zobacz w PBN
• Thomas Colcombet i Damian Niwiński, On the positional determinacy of edge-labeled games, Theoretical Computer Science 352 (3) 2006, s. 190–196.zobacz w PBN
• Agata Janowska i Paweł Janowski, Slicing of Timed Automata with Discrete Data, Fundamenta Informaticae 72 (3) 2006, s. 181–195.zobacz w PBN
• Piotr Habela, Krzysztof Stencel i Kazimierz Subieta, Three-Level Object-Oriented Database Architecture Based on Virtual Updateable Views, Lecture Notes In Computer Science 4243 2006, s. 80–89.zobacz w PBN
• Stefan Dziembowski, Intrusion-Resilience Via the Bounded-Storage Model, Lecture Notes In Computer Science 3876 2006, s. 207–224.zobacz w PBN
• Maciej Cielecki, Jędrzej Fulara, Krzysztof Jakubczyk, Lukasz Jancewicz, Jacek Chrząszcz i Aleksy Schubert, Propagation of JML non-null annotations in Java programs, w: Proceedings of PPPJ'2006, Mannheim University Press, Mannheim 2006.zobacz w PBN
• Wojciech Plandowski, An efficient algorithm for solving word equations, Symposium On Theory Of Computing 38 2006, s. 467–476.zobacz w PBN
• A. Zdyb, J. M. Olchowik i M. Mucha, Dependence of GaAs and Si surface energy on the misorientation angle of crystal planes, Materials Science-poland Vol. 24, No. 4 2006, s. 1109–1114.zobacz w PBN

2005

• 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
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Intelligent Data Integration Middleware Based on Updateable Views, Lecture Notes In Computer Science 3490 2005, s. 29–39.zobacz w PBN
• Sinh Hoa Nguyen, Trung Nguyen i Hung Son Nguyen, Rough Set Approach to Sunspot Classification Problem and Granular Computing, 10th International Conference; RSFDGrC 2005, Regina, Canada, August 31-September 3, 2005, Proceedings, Part II, Lecture Notes In Computer Science 3642 2005, s. 263–272.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge, Creating common beliefs in rescue situations, w: Proceedings of Monitoring security and rescue techniques in multiagent systems, Springer Verlag, Berlin 2005.zobacz w PBN
• Thomas Colcombet i Mikołaj Bojańczyk, Tree-walking automata do not recognize all regular languages, Symposium On Theory Of Computing 37 2005, s. 234–243.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
• T. Hvidsten, B. Wilczyński, A. Kryshtafovych, Jerzy Tiuryn, J. Komorowski i K. Fidelis, Discovering regulatory binding site modules using rule-based learning, Genome Research 15 2005, s. 856–866.zobacz w PBN
• Hung Son Nguyen, Approximate Boolean Reasoning Approach to Rough Sets and Data Mining, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31 - September 3, 2005, Proceedings, Part II, Lecture Notes In Computer Science 3642 2005, s. 12–22.zobacz w PBN
• Marcin Konrad Dziubiński, Rineke Verbrugge i Barbara Dunin-Kęplicz, Complexity of a theory of collective attitudes in teamwork, w: Proceedings of the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IEEE Computer Society, Los Alamitos 2005, s. 579–586.zobacz w PBN
• Anh Linh Nguyen i Rajeev Gore, Completeness of Hyper-Resolution via the Semantics of Disjunctive Logic Programs, Lecture Notes In Computer Science 95 (2) 2005, s. 363–369.zobacz w PBN
• Piotr Chrząstowski-Wachtel i Jerzy Tyszkiewicz, A Maple Package for Conditional Event Algebras, Lecture Notes In Computer Science 3301 2005, s. 131–151.zobacz w PBN
• Dominik Ślęzak, E. Menasalvas-Ruiz, Ch. Liau i Marcin Szczuka (red.), Proceedings of International Workshop on Rough Sets and Soft Computing in Intelligent Agent and Web Technologies, 2005 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 19 September 2005, Compiegne, France, Universite de Technologie Compiegne, Compiegne, France 2005.zobacz w PBN
• Anna Gambin i Rafał Otto, Contextual multiple sequence alignment, Journal Of Biomedicine And Biotechnology 2 2005, s. 124–131.zobacz w PBN
• Rafał Hryniów, Michał Lentner, Krzysztof Stencel i Kazimierz Subieta, Types and Type Checking in Stack-Based Query Languages, Prace Instytutu Podstaw Informatyki Polskiej Akademii Nauk Nr 984 2005, s. 1–60.zobacz w PBN
• Andrzej Huczko, Hubert Lange, Jarosław Andrzej Paszek, Michał Bystrzejewski, Stanisław CUDZIŁO, S Gachet, M Monthioux, Y. Q. Zhu, H. W. Kroto i D. R. M. Walton, A Simple Route to New 1D Nanostructures, w: Intelligence in a Small Materials World. Selected Papers from IPMM-2003 The Fourth International Conference on Intelligent Processing and Manufacturing of Materials, DEStech Publications, Inc., Lancaster, Pennsylvania 17601 USA 2005, s. 721–729.zobacz w PBN
• Anh Linh Nguyen, On Modal Deductive Databases, Lecture Notes In Computer Science 3631 2005, s. 43–57.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
• Barbara Dunin-Kęplicz, Andrzej Jankowski, Andrzej Skowron i Marcin Szczuka (red.), Monitoring, Security and Rescue Tasks in Multiagent Systems, Springer Verlag, Heidelberg 2005.zobacz w PBN
• Janusz Jabłonowski, Some Notes on Generics in C#, w: Proceedings of the International Conference on Computer Systems and Technologies, Bulgarian chapter of ACM, Varna 2005.zobacz w PBN
• Janina Mincer-Daszkiewicz i Przemysław Baszkiewicz, Jak USOS współpracuje z CUS czyli o autoryzacji użytkowników w serwisach internetowych UW, Uniwersytet Warszawski. Pismo Uczelni 4 (25) 2005, s. 28–30.zobacz w PBN
• Rajeev Gore i Anh Linh Nguyen, A Tableau System with Automaton-Labelled Formulae for Regular Grammar Logics, Lecture Notes In Computer Science 3702 2005, s. 138–152.zobacz w PBN
• Hung Son Nguyen, Marta Łuksza, Ewa Mąkosa i Jan Komorowski, An Approach to Mining Data with Continuous Decision, w: Intelligent Information Processing and Web Mining, Proceedings of the International IIS:IIPWM'05, Springer, Berlin 2005.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Improving Rough Classifiers Using Concept Ontology, Lecture Notes In Computer Science 3518 2005, s. 312–322.zobacz w PBN
• Anh Linh Nguyen, On the Complexity of Fragments of Modal Logics, w: Advances in Modal Logic, King's College, London 2005.zobacz w PBN
• Anh Linh Nguyen, An SLD-Resolution Calculus for Basic Serial Multimodal Logics, Lecture Notes In Computer Science 3722 2005, s. 151–165.zobacz w PBN
• Chi Ngo i Hung Son Nguyen, A method of web search result clustering based on rough sets, w: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, IEEE Computer Society Press, Berlin 2005.zobacz w PBN
• Agata Janowska i Paweł Janowski, Slicing of Timed Automata with Discrete Data, w: Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P'05), Wydawnictwa Uniwersytetu Warszawskiego, Warszawa 2005.zobacz w PBN
• Anh Linh Nguyen, Reasoning about Epistemic States of Agents by Modal Logic Programming, w: Pre-proceedings of the 6th International Workshop on Computational Logic in Multi-Agent Systems CLIMA VI, London 2005.zobacz w PBN
• Filip Murlak, On deciding topological classes of deterministic tree languages, Lecture Notes In Computer Science 3634 2005, s. 428–442.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Learning Concept Approximation from Uncertain Decision Tables, w: Advances in Soft Computing, Springer Verlag, Heidelberg 2005.zobacz w PBN
• Costas Iliopoulos, James MCHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter i Marie-France Sagot, A first approach to finding common motifs with gaps, International Journal Of Foundations Of Computer Science 16 (6) 2005, s. 1145–1155.zobacz w PBN
• Jerzy Jaromczyk, Mirosław Kowaluk i Neil Moore, On visualization of complex image-based markup, w: International Conference on Computer Vision and Graphics, Springer Verlag, Berlin 2005.zobacz w PBN
• Juhani Karhumäki, Wojciech Plandowski i Wojciech Rytter, On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science 337 (1-3) 2005, s. 105–118.zobacz w PBN
• Hung Son Nguyen i Marcin Szczuka (red.), Rough Sets In Knowledge Discovery and Data Mining - A tutorial, w: Tutorial Notes of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, VAST - Wietnamska Akademia Nauk i Technologii, Hanoi, Wietnam 2005.zobacz w PBN
• F. Coenen, P. Leng, A. Pagourtzis, Wojciech Rytter i D. Souliou, Improved methods for extracting frequent itemsets from interin-support trees, w: 25th International Conference on Innovative Techniques and Applications of Artificial Intelligence, Springer, London 2005.zobacz w PBN
• Paweł Urzyczyn (red.), Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Springer Verlag, Berlin 2005.zobacz w PBN
• H. Kepa, C. Majkrzak, Piotr Sankowski, P. Kacman i T. Giebultowicz, Neutron diffraction and reflectivity studies of Eu chalogenide based superlattices, Journal Of Alloys And Compounds 401 2005, s. 238–248.zobacz w PBN
• Piotr Sankowski, Shortest Paths in Matrix Multiplication Time, Lecture Notes In Computer Science 3669 2005, s. 770–778.zobacz w PBN
• Michał Drabikowski, Krzysztof Fidelis, Andriy Kryshtafovych i Jerzy Tiuryn, Local Descriptors' Library Models the Core of Protein Structures Accurately, w: RECOMB 2005 Poster Abstracts, Ź Broad Institute of MIT and Harvard Ź, Boston USA 2005.zobacz w PBN
• P. Van Dorpe, W. Van Roy, J. De Boeck, G. Borghs, Piotr Sankowski, P. Kacman, J. Majewski i T. Dietl, Voltage controlled spin injection in (Ga,Mn)As/(Al,Ga)As Zener diode, Physical Review B 72 2005, s. 205322.zobacz w PBN
• Martin Hofmann i Paweł Urzyczyn (red.), Typed Lambda Calculi and Applications 2003, Selected Papers, IOS Press, Amsterdam 2005.zobacz w PBN
• Jerzy Paweł Tyszkiewicz, Krótkie rozmowy między sumerologiem a matematykiem, Delta 5 (372) 2005, s. 1–3.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, Fast split selection method and its application in decision tree construction from large databases, International Journal Of Intelligent Systems 2 2005, s. 149–160.zobacz w PBN
• Piotr Sankowski, Subquadratic Algorithm for Dynamic Shortest Distances, Lecture Notes In Computer Science 3595 2005, s. 461–470.zobacz w PBN
• Wojciech Ziarko i Xiaohua HuDominik Ślęzak, JingTao Yao i James F. Peters (red.), Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Proceedings of the 10th International Conference, RSFDGrC 2005, Regina, Canada, September 1-3, 2005, Part I, Springer Verlag, Berlin 2005.zobacz w PBN
• Piotr Sankowski i P. Kacman, Interlayer Exchange Coupling in (Ga,Mn)As-based Superlattices, Physical Review B 71 2005, s. 201303.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Sound Markings in Structured Nets, w: Proceedings of the International Workshop on Concurrency, Specificationand Programming (CS&P'05), Wydawnictwa Uniwersytetu Warszawskiego, Warszawa 2005.zobacz w PBN
• Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin i Piotr Hoffman, Amalgamation in the semantics of CASL, Theoretical Computer Science 331 2005, s. 215–247.zobacz w PBN
• Michał Grabowski i Andrzej Szałas, A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies, w: Advances in Web Intelligence, Springer, 2005, s. 183–189.zobacz w PBN
• Till Mossakowski, Don Sannella i Andrzej Tarlecki, A Simple Refinement Language for CASL, Lecture Notes In Computer Science 3423 2005, s. 162–185.zobacz w PBN
• Jan Bazan i Marcin Szczuka, The rough set exploration system, Lecture Notes In Computer Science 3400 2005, s. 37–56.zobacz w PBN
• Aleksy Schubert, A self-dependency constraint in the simply typed lambda calculus, Lecture Notes In Computer Science 3623 2005, s. 352–364.zobacz w PBN
• Marcin Szczuka, Techniques for managing rule –based concept approximation, w: Proceedings of International Workshop on Rough Sets and Soft Computing in Intelligent Agent and Web Technologies, 2005 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 19 September 2005, Compiegne, France, Universite de Technologie Compiegne, Compiegne, France 2005.zobacz w PBN
• Andrzej Gasienica-Samek, Tomasz Stachowicz, Jacek Chrząszcz i Aleksy Schubert, KOTEK: Clustering of The Enterprise Code, w: Software Engineering: Evolution and Emerging Technologies, IOS Press, Amsterdam 2005.zobacz w PBN
• Bartosz Klin, From bialgebraic semantics to congruence formats, Electronic Notes In Theoretical Computer Science 128 (1) 2005, s. 3–37.zobacz w PBN
• Stefan Jackowski i Janina Mincer-Daszkiewicz, Przez Internet na studia, Forum Akademickie 3 2005, s. 41–43.zobacz w PBN
• Patrick Doherty, Witold Lukaszewicz i Andrzej Szałas, Similarity, Approximations and Vagueness, w: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Proceedings of the 10th International Conference, RSFDGrC 2005, Regina, Canada, September 1-3, 2005, Part I, Springer Verlag, Berlin 2005, s. 541–550.zobacz w PBN
• Teodor Knapik, Damian Niwiński, Paweł Urzyczyn i Igor Walukiewicz, Unsafe Grammars and Panic Automata, Lecture Notes In Computer Science 3580 2005, s. 1450–1461.zobacz w PBN
• Piotr Cybula, Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Optimization of Distributed Queries in Grid Via Caching, Lecture Notes In Computer Science 3762 2005, s. 387–396.zobacz w PBN
• Dominik Ślęzak, Marcin Szczuka i Jakub Wróblewski, Feedforward concept networks, w: Monitoring, Security, and Rescue Tasks in Multiagent Systems, Springer Verlag, Heidelberg 2005.zobacz w PBN
• Razvan Diaconescu, Joseph Goguen, Till Mossakowski i Andrzej Tarlecki, What is a logic?, w: Logica Universalis, Birkhauser, Basel 2005.zobacz w PBN
• Bartosz Klin, The least fibred lifting and the expressivity of coalgebraic modal logic, Lecture Notes In Computer Science 3629 2005, s. 247–262.zobacz w PBN
• Wlodzimierz Drabent i Mirosława Miłkowska, Proving Correctness and Completeness of Normal Programs - A Declarative Approach, Theory And Practice Of Logic Programming 5 (6) 2005, s. 669–711.zobacz w PBN
• Jacek Brzezinski, Piotr Dunin-Keplicz i Barbara Dunin-Kęplicz, Collectively cognitive agents in cooperative teams, Lecture Notes In Computer Science 3451 2005, s. 191–208.zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Distributed Query Optimization in the Stack-Based Approach, Lecture Notes In Computer Science 3726 2005, s. 904–909.zobacz w PBN
• Anna Gambin i Piotr Slonimski, Hierarchical clustering based upon contextual alignment of proteins: a different way to approach phylogeny, Comptes Rendus Biologies 328 (1) 2005, s. 11–22.zobacz w PBN
• Ian Hayes, John Fitzgerald i Andrzej Tarlecki (red.), FM 2005: Formal Methods, International Symposium of Formal Methods Europe, Springer-Verlag, Berlin 2005.zobacz w PBN
• Bartosz Klin, Vladimiro Sassone i Pawel Sobocinski, Labels from reductions, towards a general theory, Lecture Notes In Computer Science 3629 2005, s. 30–50.zobacz w PBN
• 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
• Anna Gambin i Damian Wójtowicz, Almost FPRAS for Lattice Models of Protein Folding (Extended Abstract), Lecture Notes In Computer Science 3503 2005, s. 534–544.zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Implementation of Federated Databases Through Updatable Views, Lecture Notes In Computer Science 3470 2005, s. 610–619.zobacz w PBN
• Włodzimierz Drabent i Mirosława Miłkowska, Proving Correctness and Completeness of Normal Programs - A Declarative Approach, Theory And Practice Of Logic Programming 5 (6) 2005, s. 669–711.zobacz w PBN
• Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz i Jan Van den Bussche, The Semijoin Algebra and the Guarded Fragment, Journal Of Logic, Language And Information 14 (3) 2005, s. 331–343.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
• R. Diaconescu, J. Goguen, T. Mossakowski i A. Tarlecki, What is a logics?, Brkhauser, 2005.zobacz w PBN
• Janina Mincer-Daszkiewicz, Computer system support for the Bologna process at Warsaw University, w: EUNIS 2005, The 11th International Conference of European University Information Systems, The University of Manchester, Manchester 2013.zobacz w PBN
• Lutz Schroeder, Till Mossakowski, Andrzej Tarlecki, Piotr Hoffman i Bartosz Klin, Amalgamation in the semantics of CASL, Theoretical Computer Science 331 (1) 2005, s. 215–247.zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, A flexible grid infrastructure for data analysis, Lecture Notes In Computer Science 3528 2005, s. 480–485.zobacz w PBN
• Hung Son Nguyen i Marcin Szczuka (red.), Proceedings of International Workshop on Rough Set Techniques in Knowledge Discovery and Data Mining - RSKD 2005, Wietnamska Akademia Nauk i Technologii, Hanoi, Wietnam 2005.zobacz w PBN
• Hung Son Nguyen, Rough Set Approach to Learning in Multi Agent Systems, w: 2005 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, University of Technology of Compiegne, Compiegne, France 2005.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, LCA Queries in Directed Acyclic Graphs, Lecture Notes In Computer Science 3580 2005, s. 241–248.zobacz w PBN
• Tomasz Pieciukiewicz, Krzysztof Stencel i Kazimierz Subieta, Usable Recursive Queries, Lecture Notes In Computer Science 3631 2005, s. 17–28.zobacz w PBN
• Jan Bazan, Rafał Latkowski i Marcin Szczuka, DIXER- Distributed executor for rough sets exploration systems, Lecture Notes In Computer Science 3642 2005, s. 39–47.zobacz w PBN
• Norbert Dojer, Clones of Modes, w: Contributions to General Algebra, Verlag Johannes Heyn, Klagenfurt 2005.zobacz w PBN
• Piotr Wasilewski, Concept Lattices vs. Approximation Spaces, Lecture Notes In Computer Science 1 (3641) 2005, s. 114–123.zobacz w PBN

2004

• Chi Ngo i Hung Son Nguyen, Tolerance rough set approach to clustering web search results, w: Knowledge Discovery in Databases: Proceedings of PKDD 2004, J.-F.Boulicaut, F.Esposito, F.Gianotti, and D.Pedreschi (eds.), Springer, Berlin, Niemcy 2004.zobacz w PBN
• Ran Canetti, Ivan Damgard, Stefan Dziembowski, Yuval Ishai i Tal Malkin, Adaptive versus Non-Adaptive Security of Multi-Party Protocols, Journal Of Cryptology 17 (3) 2004, s. 153–207.zobacz w PBN
• Don Sannella i Andrzej Tarlecki, Foundations. In: CASL User Manual, Lecture Notes In Computer Science 2900 2004, s. 125–129.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge (red.), Multiagent Systems, IOS Press, Amsterdam 2004.zobacz w PBN
• Lech Banachowski, Elżbieta Mrówka-Matejewska i Krzysztof Stencel, Systemy baz danych. Wykłady i ćwiczenia, Polsko-Japońska Wyższa Szkoła Technik Komputerowych, Warszawa 2004.zobacz w PBN
• Trung Nguyen, Claire, P. Willis, Derek, J. Paddon i Hung Son Nguyen, On learning of sunspot classification, w: Intelligent Information Systems, Proceedings of IIPWM’04,, Springer, Berlin, Niemcy 2004.zobacz w PBN
• Jean Goubault-Larrecq, Sławomir Lasota, David Nowak i Yu Zhang, Complete lax logical relations for cryptographic lambda-calculi, Lecture Notes In Computer Science 3210 2004, s. 400–414.zobacz w PBN
• Aleksy Schubert, On the Building of Affine Retractions, Lecture Notes In Computer Science 3210 2004, s. 205–219.zobacz w PBN
• Paweł Górecki i Jerzy Tiuryn, On the structure of reconciliations, Lecture Notes In Computer Science 3388 2004, s. 42–54.zobacz w PBN
• Janusz Jabłonowski, Typy uogólnione w Javie, w: VI Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwa Naukowo Techniczne, Warszawa 2004.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, On the Correspondence between Approximations and Similarity, w: Rough Sets and Current Trends in Computing, Springer, 2004, s. 143–152.zobacz w PBN
• Andrzej Jankowski, Andrzej Skowron i Marcin Szczuka (red.), Proceedings of the International Workshop on Monitoring Security, and Rescue Tasks in Multiagent Systems, 2004, 1-180, Warsaw University, Płock, Polska 2004.zobacz w PBN
• Marek Karpinski, Mirosław Kowaluk i Andrzej Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae 62 (3) 2004, s. 369–375.zobacz w PBN
• Jerzy Tiuryn, Ryszard Rudnicki i Damian Wójtowicz, A Case Study of Genome Evolution: From Continuous to Discrete Time Model, Lecture Notes In Computer Science 3153 2004, s. 1–24.zobacz w PBN
• Jerzy Tiuryn i Damian Wójtowicz, A Markovian model of genome evolution: distribution of paralogs, w: RECOMB 2004, Currents in Computational Molecular Biology, University of California at San Diego, San Diego 2004.zobacz w PBN
• Krzysztof Stencel, Systemy operacyjne. Wykłady i ćwiczenia, Polsko-Japońska Wyższa Szkoła Technik Komputerowych, Warszawa 2004.zobacz w PBN
• Anna Gambin i Piotr Slonimski, Hierarchical clustering based upon contextual alignment of proteins: a different way to approach phylogeny, w: Comptes Rendus Biologies, Academie des Sciences, Paris 2004.zobacz w PBN
• Patrick Doherty, Andrzej Szałas i Witold Łukaszewicz, Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities, w: Principles of Knowledge Representation and Reasoning, AAAI Press, 2004, s. 459–468.zobacz w PBN
• Hubert Baumeister, Maura Cerioli, Anne Haxthausen, Till Mossakowski, Peter Mosses, Don Sannella i Andrzej Tarlecki, CASL Semantics, Lecture Notes In Computer Science 2960 2004, s. 115–273.zobacz w PBN
• Łukasz Kowalik, Fast 3-Coloring Triangle-Free Planar Graphs, Lecture Notes In Computer Science 3221 2004, s. 436–447.zobacz w PBN
• Bazyli Blicharski i Krzysztof Stencel, A Flexible Database Authorization System, w: Proc. of the IASTED International Conference on Databases and Applications (DBA 2004), Innsbruck 2004.zobacz w PBN
• Andrzej Tarlecki, Software Specification and Development in Heterogeneous Environments, w: Proceedings 1st International Workshop on Combination of Logics: Theoryand Applications CombLog'04, Instituto Superior Tecnico, Lisboa, Lisbon 2004.zobacz w PBN
• Krzysztof Diks, Krzysztof Onak i Tomasz Waleń (red.), XI Olimpiada Informatyczna 2003/2004, Komitet Główny Olimpiady Informatycznej, Warszawa 2004.zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Hanna Kozankiewicz, Michał Lentner, Krzysztof Stencel i Kazimierz Subieta, Data-Intensive Grid Computing Based on Updatable Views, Prace Instytutu Podstaw Informatyki Polskiej Akademii Nauk Nr 974 2004, s. 1–56.zobacz w PBN
• Patrick Doherty, Steve Kertes, Martin Magnusson i Andrzej Szałas, Towards a Logical Analysis of Biochemical Pathways, w: Logics in Artificial Intelligence, 2004, s. 667–679.zobacz w PBN
• Michel Bidoit, Don Sannella i Andrzej Tarlecki, Toward component-oriented formal software development: an algebraic approach, Lecture Notes In Computer Science 2941 2004, s. 75–90.zobacz w PBN
• Krzysztof Ciebiera i Piotr Sankowski, Improving Web Sites by Automatic Source Code Analysis and Modification, Lecture Notes In Computer Science 3140 2004, s. 579–580.zobacz w PBN
• Jerzy Jaromczyk, Mirosław Kowaluk i Neil Moore, A web interface to image-based concurrent markup using maps, w: Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), ACM, USA 2004.zobacz w PBN
• Andrzej Tarlecki, Editorial, Information Processing Letters 90 2004, s. 1–2.zobacz w PBN
• Patrick Doherty, Steve Kertes, Martin Magnusson i Andrzej Szałas, Towards a Logical Analysis of Biochemical Reactions, w: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, 2004, 2004, s. 997–998.zobacz w PBN
• Mikołaj Bojańczyk i Igor Walukiewicz, Characterizing EF and EX Tree Logics, Lecture Notes In Computer Science 3170 2004, s. 131–145.zobacz w PBN
• Agata Janowska i Paweł Janowski, Slicing Timed Systems, Fundamenta Informaticae 60 2004, s. 187–210.zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel i Kazimierz Subieta, Integration of heterogeneous resources through updatable views, w: Proceedings of the Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, WETICE, IEEE, Modena 2004, s. 309–314.zobacz w PBN
• Jerzy Marcinkowski i Andrzej Tarlecki (red.), Computer Science Logic. 18th International Workshop, Springer, Berlin 2004.zobacz w PBN
• P. Sankowski, H. Kępa, P. Kacman, A. Sipatov, C. Majkrzak i T. Giebultowicz, Interlayer Coupling in EuS-Based Superlattices Deduced from Neutron Scattering Experiments, Acta Physica Polonica A 105 2004, s. 607–614.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities, w: FUSION 2004, 2004, s. 175–182.zobacz w PBN
• Henryk Kępa, Piotr Sankowski, Perła Kacman, A Sipatov, C Majkrzak i T Giebultowicz, Antiferromagnetic interlayer coupling in EuS/YbSe superlattices, Journal Of Magnetism And Magnetic Materials 272-276 (Part 1) 2004, s. 323–324.zobacz w PBN
• Mikołaj Bojańczyk, A Bounding Quantifier, Lecture Notes In Computer Science 3210 2004, s. 41–55.zobacz w PBN
• Dirk Leinders, Jerzy Tyszkiewicz i Jan Van den Bussche, On the expressive power of semijoin queries, Information Processing Letters 91 (2) 2004, s. 93–98.zobacz w PBN
• Marcin Mucha i Piotr Sankowski, Maximum Matchings via Gaussian Elimination, w: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, USA 2004.zobacz w PBN
• Anh Linh Nguyen, On the Complexity of Fragments of Modal Logics, w: Preliminary Conference Proceedings of the 5th International Conference on Advances in Modal Logic 2004, University of Manchester, Manchester 2004.zobacz w PBN
• Piotr Sankowski, Henryk Kępa, P Kacman, A Sipatov, C Majkrzak i T Giebultowicz, Interlayer coupling in EuS-based superlattices deduced from neutron scattering experiments, Acta Physica Polonica A 105 (6) 2004, s. 607–614.zobacz w PBN
• Mikołaj Bojańczyk i Thomas Colcombet, Tree-Walking Automata Cannot Be Determinized, Lecture Notes In Computer Science 3142 2004, s. 246–256.zobacz w PBN
• Anh Linh Nguyen, MProlog: An Extension of Prolog for Modal Logic Programming, Lecture Notes In Computer Science 3132 2004, s. 469–470.zobacz w PBN
• Wojciech Rytter, Trees of minimum weighted path length, w: Handbook of data structures and applications, Chapman and Hall, USA 2004.zobacz w PBN
• Mirosław Kowaluk i Jerzy Jaromczyk (red.), Proc. 18th Eur. Worksh. Computational Geometry (EWCG 2002), Elsevier, Amsterdam 2004.zobacz w PBN
• J. Bazan, Marcin Szczuka i M. Wojnarski, On the evolution of rough set exploration system; S. Tsumoto et al. (Eds.): Rough sets current trends in computing, RSCTC 2004, Lecture Notes In Computer Science 3066 2004, s. 592–601.zobacz w PBN
• Viviana Bono, Jerzy Tiuryn i Paweł Urzyczyn, Type inference for nested self types, Lecture Notes In Computer Science 3085 2004, s. 99–114.zobacz w PBN
• Anh Linh Nguyen, The Modal Logic Programming System MProlog, Lecture Notes In Computer Science 3229 2004, s. 266–278.zobacz w PBN
• Piotr Sankowski, Dynamic Transitive Closure via Dynamic Matrix Inverse, w: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, USA 2004.zobacz w PBN
• Dominik Ślęzak, Marcin Szczuka i Jakub Wróblewski, Harnessing classifier networks - towards hierarchical concept construction, Lecture Notes In Computer Science 3066 2004, s. 554–560.zobacz w PBN
• Jacek Chrząszcz, Modules in Coq Are and Will Be Correct, Lecture Notes In Computer Science 3085 2004, s. 130–146.zobacz w PBN
• Anh Linh Nguyen, Negative Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming, Lecture Notes In Computer Science 3229 2004, s. 565–577.zobacz w PBN
• Paweł Górecki, Reconciliation problems for duplication, loss and horizontal gene transfer, w: Eighth Annual International Conference on Research in Computational Molecular Biology, ACM Press New York, New York 2004.zobacz w PBN
• Jerzy Tyszkiewicz i Stanisław Tyszkiewicz, An introduction to chemometrics for food science, Polish Journal Of Food And Nutrition Sciences 13/54 2004.zobacz w PBN
• Jan Bazan, Hung Son Nguyen i Andrzej Skowron, Rough Set Methods in Approximation of Hierarchical Concepts; S. Tsumoto et al. (Eds.): Rough Sets and Current Trends in Computing RSCTC 2004, Lecture Notes In Computer Science 3066 2004, s. 342–351.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, Solving Word Equations in Two Variables, Lecture Notes In Computer Science 3142 2004, s. 408–419.zobacz w PBN
• Krzysztof Ciebiera, Janina Mincer-Daszkiewicz i Tomasz Waleń, New Course Registration Module for the University Study-Oriented System, w: EUNIS 2004, The Tenth International Conference of European University Information Systems, University of Ljubljana, Faculty of Computer and Information, Bled, Slovenia 2004, s. 247–252.zobacz w PBN
• Patrick Doherty, Jarosław Kachniarz i Andrzej Szałas, Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases, w: Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies, S.K.Pal, L..Polkowski, A.Skowron (Eds), Springer, Berlin 2004, s. 219–250.zobacz w PBN
• J. Bazan, Hung Son Nguyen i Marcin Szczuka, A view on rough set concept approximations, Fundamenta Informaticae 59 (2-3) 2004, s. 107–118.zobacz w PBN
• Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis i Andrzej Pelc, Tree exploration with little memory, Journal Of Algorithms-cognition Informatics And Logic 51 (1) 2004, s. 38–63.zobacz w PBN
• Marcin Mucha i Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Lecture Notes In Computer Science 3221 2004, s. 532–543.zobacz w PBN
• Anna Gambin i Bronisław Kluge, Statistical Significance of Contextual Alignment, w: Proc. 4th European Conference on Computational Biology ECCB 2004, University of Glasgow, Glasgow 2004.zobacz w PBN
• M. Karpinski, M. Kowaluk i A. Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae Vol. 62, nr 3,4 2004, s. 369–375.zobacz w PBN
• P. Doherty, Witold Łukaszewicz, Andrzej Skowron i Andrzej Szałas, Approximate transducers and trees: a technique for combining rough and crisp knowledge, w: Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies, In: S. K. Pal, L. Polkowski, A. Skowron (Eds.), Springer, Berlin, Niemcy 2004.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Dynamics of collective attitudes during teamwork, Lecture Notes In Computer Science 3071 2004, s. 107–122.zobacz w PBN
• Marcin Peczarski, New Results in Minimum-Comparison Sorting, Algorithmica 40 2004, s. 133–145.zobacz w PBN
• Janusz Jabłonowski, Typy uogólnione w Javie, w: VI Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwa Naukowo Techniczne, Warszawa 2004.zobacz w PBN
• Stefan Jackowski i Janina Mincer-Daszkiewicz, Uniwersytecki System Obsługi Studiów z perspektywy uzytkowników - Program dla wszystkich, Forum Akademickie (4) 2004, s. 1.zobacz w PBN
• Hung Son Nguyen, On exploring soft discretization of continuous attributes, w: Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies, S.K.Pal, L..Polkowski, A.Skowron (Eds), Springer, Berlin 2004.zobacz w PBN
• Sinh Hoa Nguyen, Jan Bazan, Andrzej Skowron i Hung Son Nguyen, Layered Learning for Concept Synthesis, Lecture Notes In Computer Science 3100 2004, s. 193–214.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Tuning machine for Cooperative Problem Solving, Fundamenta Informaticae 63 (2) 2004, s. 283–307.zobacz w PBN
• Wojciech Plandowski, Satisfiability of word equations with constants is in PSPACE, Journal Of The Acm 51 (3) 2004, s. 483–496.zobacz w PBN
• Janusz Jabłonowski, Some Remarks on Teaching of Programming, w: Technologies - CompSysTech'2004, Proceedings of the conference by Bulgarian Chapter of ACM, Bulgaria 2004.zobacz w PBN
• Stefan Jackowski i Janina Mincer-Daszkiewicz, Uniwersytecki System Obsługi Studiów z perspektywy uzytkowników - Sprawne zarządzanie, Forum Akademickie (5) 2004, s. 1.zobacz w PBN
• James Peters, Andrzej Skowron, Jerzy Grzymała-Busse, Bożena Kostek, Roman Świniarski i Marcin Szczuka (red.), Transactions on Rough Sets I, Lecture Notes in Computer Science Journal Subseries, Springer Verlag, Berlin, Niemcy 2004.zobacz w PBN
• Stefan Dziembowski i Ueli Mauer, On Generating the Initial Key in the Bounded-Storage Model, Lecture Notes In Computer Science 3207 2004, s. 126–137.zobacz w PBN
• Wojciech Rytter, Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input, Lecture Notes In Computer Science 3142 2004, s. 15–27.zobacz w PBN
• Janina Mincer-Daszkiewicz, Student Admission System for Warsaw University, w: EUNIS 2004, The Tenth International Conference of European University Information Systems, University of Ljubljana, Faculty of Computer and Information, Bled, Slovenia 2004, s. 328–336.zobacz w PBN
• Norbert Dojer, A New Presentation of Existential Varieties, w: Contributions to General Algebra, Verlag Johannes Heyn, Klagenfurt 2004.zobacz w PBN
• Stefan Jackowski i Janina Mincer-Daszkiewicz, Dyplomy w sieci, Uniwersytet Warszawski. Pismo Uczelni 4 (20) 2004, s. 41–43.zobacz w PBN
• Sinh Hoa Nguyen i Hung Son Nguyen, Rough set approach to approximation of concepts from taxonomy, w: Proceedings of Knowledge Discovery and Ontologies Workshop (KDO-04) at ECML/PKDD 2004, University of Pisa, Pisa, Italy 2004.zobacz w PBN
• Stefan Dziembowski i Ueli Mauer, Optimal Randomizer Efficiency in the Bounded-Storage Model, Journal Of Cryptology 17 (1) 2004, s. 5–26.zobacz w PBN
• Marek Chrobak, Leszek Gasieniec i Wojciech Rytter, A randomized algorithm for gossiping in radio networks, Networks 43 (2) 2004, s. 119–124.zobacz w PBN
• Zofia Adamowicz, Sergei Artemov, Damian Niwiński, Ewa Orłowska, Anna Romanowska i Jan Woleński (red.), Provinces of logic determined. Essays in the memory of Alfred Tarski, Elsevier, Amsterdam 2004.zobacz w PBN
• Stefan Jackowski i Janina Mincer-Daszkiewicz, Elektroniczna immatrykulacja, Uniwersytet Warszawski. Pismo Uczelni 3 (19) 2004, s. 20–22.zobacz w PBN
• Wojciech Legierski i Paweł Parys, Planowanie zajęć metodami programowania z ograniczeniami, w: Automatyzacja Procesów Dyskretnych, WNT, Warszawa 2004, s. 125–132.zobacz w PBN
• N. Dojer, Applying term rewriting to partial algebra theory, Fundamenta Informaticae Vol. 63, nr 4 2004, s. 375–384.zobacz w PBN

2003

• Andrzej Skowron i Marcin Szczuka (red.), Proceedings of the Workshop on Rough Sets in Knowledge Discovery and Soft Computing at ETAPS’2003, Electronic Notes in Computer Science, Elsevier 2003.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Evolution of collective commitments during teamwork, Fundamenta Informaticae 56 (4) 2003, s. 329–371.zobacz w PBN
• Daria Walukiewicz-Chrząszcz, Termination of rewriting in the Calculus of Constructions, Journal Of Functional Programming 13 (2) 2003, s. 339–414.zobacz w PBN
• Paweł Górecki, Maximum likelihood estimation for duplication, loss model, w: Currents in Computational Molecular Biology RECOMB 2003, Berlin 2003.zobacz w PBN
• Jan Bazan, James F. Peters, Andrzej Skowron, Hung Son Nguyen i Marcin Szczuka, Rough Set Approach to Pattern Extraction from Classifiers, Electronic Notes In Theoretical Computer Science 82 (4) 2003, s. 1–10.zobacz w PBN
• Marcin Szczuka, Dominik Ślęzak i Jakub Wróblewski, Constructing extensions of bayesian classifiers with use of normalizing neural networks, Lecture Notes In Computer Science 2871 2003, s. 408–416.zobacz w PBN
• Juhani Karhumaeki, Jan Manuch i Wojciech Plandowski, A defect theorem for bi-infinite words, Theoretical Computer Science 292 (1) 2003, s. 237–243.zobacz w PBN
• Aala Gibbons, Aris Pagourtzis, Igor Potapov i Wojciech Rytter, Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique, Computer Journal 46 (4) 2003, s. 391–400.zobacz w PBN
• Paweł Górecki, Single step reconciliation algorihm for duplication, loss and horizontal gene transfer model, w: Proceedings of the ECCB 2003, European Conference on Computational Biology, Paris 2003.zobacz w PBN
• Łukasz Kowalik i Maciej Kurowski, Short Path Queries in Planar Graphs in Constant Time, Symposium On Theory Of Computing 35 2003, s. 143–148.zobacz w PBN
• W. Kosiński, P. Prokopowicz i D. Ślęzak, Ordered Fuzzy Numbers, Bulletin Of The Polish Academy Of Sciences. Mathematics 51 (3) 2003, s. 329–341.zobacz w PBN
• B. Dunin-Kęplicz i R. Verbrugge, Evolution of Collective Commitment during Teamwork, Fundamenta Informaticae Vol. 56, nr 4 2003, s. 329–371.zobacz w PBN
• J Peters, S Ramanna i Marcin Szczuka, Towards a line-crawling robot obstacle classification system: a rough set approach, Lecture Notes In Computer Science 2639 2003, s. 303–307.zobacz w PBN
• Juhani Karhumaeki, Wojciech Plandowski i Wojciech Rytter, The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics 125 (2-3) 2003, s. 235–254.zobacz w PBN
• Boualem Benatallah, Piotr Chrząstowski-Wachtel, Rachid Hamadi, Milton ODell i Adi Susanto, A Petri Net-based Hierarchical Workflow Designer, w: IEEE Proceedings from the Third International Conference on Application of Concurrency to System Design, IEEE Computer Society, Los Alamitos, California 2003.zobacz w PBN
• Dexter Kozen i Jerzy Tiuryn, Substructural Logic and Partial Correctness, w: ACM Transactions on Computational Logic, New York 2003.zobacz w PBN
• Witold Kosiński, Piotr Prokopowicz i Dominik Ślęzak, Counting with fuzzy numbers, Modelowanie Inżynierskie (20) 2003, s. 221–225.zobacz w PBN
• Jan Bazan, Hung Son Nguyen, Andrzej Skowron i Marcin Szczuka, A view on rough set concept approximations, Lecture Notes In Computer Science 2639 2003, s. 181–188.zobacz w PBN
• Juhani Karhumaeki, Arto Lepisto i Wojciech Plandowski, Locally periodic versus globally periodic infinite words, Journal Of Combinatorial Theory Series A 100 (2) 2003, s. 1–10.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Boualem Benatallah, Rachid Hamadi, Adi Susanto i Milton ODell, A Top-Down Petri Net-Based Approach for Dynamic WOrkflow Modeling, Lecture Notes In Computer Science 2678 2003, s. 336–353.zobacz w PBN
• Agnes Szczepek, Jerzy Tiuryn i Bartosz Wilczynski, Designing DNA-microarray Probes Opimized for Hybridization Probability, w: Currents in Computtaional Molecular Biology (RECOMB), Berlin 2003.zobacz w PBN
• Dominik Ślęzak, Jakub Wróblewski i Marcin Szczuka, Neural network architecture for synthesis of the probabilistic rule based classfiers, Electronic Notes In Theoretical Computer Science 82(4) 2003, s. 250–262.zobacz w PBN
• Łukasz Kowalik, Short Cycles in Planar Graphs, Lecture Notes In Computer Science 2880 2003, s. 284–296.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Calibrating collective commitments, Lecture Notes In Computer Science 2691 2003, s. 73–83.zobacz w PBN
• Dexter Kozen i Jerzy Tiuryn, Substructural Logic and Partial Correctness, Acm Transactions On Computational Logic 4 (3) 2003, s. 355–378.zobacz w PBN
• P. Sankowski i P. Kacman, Interlayer Coupling in EuS-Based Superlattices (Dependence on the Energy Structure of Non-Magnetic Layer), Acta Physica Polonica A 103 2003, s. 621–628.zobacz w PBN
• Dominik Ślęzak i Jakub Wróblewski, Order Based Genetic Algorithms for the Search of Approximate Entropy Reducts, w: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing: 9th International Conference, RSFDGrC 2003, Chongqing, China, May 26–29, 2003 Proceedings, Springer Verlag, Heidelberg 2003, s. 308–311.zobacz w PBN
• Jan Bazan, Hung Son Nguyen, James Peters, Andrzej Skowron i Marcin Szczuka, Rough set approach to pattern extraction from classifiers, In: Proceedings of the Workshop on Rough Sets in Knowledge Discovery and Soft Computing at ETAPS’2003, Electronic Notes In Theoretical Computer Science 82(4) 2003, s. 20–29.zobacz w PBN
• Marcin Kubica, Temporal Approach to Specification of Pointer Data-Structures, Lecture Notes In Computer Science 2621 2003, s. 231–245.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Dialogue in teamwork, w: Proceedings of The 10th ISPE International Conference onConcurrent Engineering: Research and Applications, A.A. Balkema Publishers, Madeira, Portugal 2003.zobacz w PBN
• Till Mossakowski, Anne Haxthausen, Donald Sannella i Andrzej Tarlecki, CASL --- The Common Algebraic Specification Language: semantics and proof theory, Computing And Informatics 22 2003, s. 285–321.zobacz w PBN
• Dominik Ślęzak i Wojciech Ziarko, Variable Precision Bayesian Rough Set Model, w: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing: 9th International Conference, RSFDGrC 2003, Chongqing, China, May 26–29, 2003 Proceedings, Springer Verlag, Heidelberg 2003, s. 312–315.zobacz w PBN
• Sławomir Lasota i Wojciech Niemiro, A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise, Pattern Recognition 36 (4) 2003, s. 931–941.zobacz w PBN
• Sławomir Lasota, A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes, Lecture Notes In Computer Science 2747 2003, s. 521–530.zobacz w PBN
• Janina Mincer-Daszkiewicz, Teaching Software Engineering by Developing Commodity Software, w: Education and Information Systems: Technologies and Applications, International Institute of Informatics and Systematics, Orlando, Florida, USA 2003, s. 449–454.zobacz w PBN
• Tomasz Michalak i Jerzy Wilkin, Rynek, społeczeństwo obywatelskie, państwo a sytuacja grup zmarginalizowanych, w: W stronę aktywnej polityki społecznej, Instytut Spraw Publicznych, Warszawa 2003.zobacz w PBN
• J Bazan, Hung Son Nguyen, J Peters, Andrzej Skowron i Marcin Szczuka, Rough set approach to pattern extraction from classifiers, In: Proceedings of the Workshop on Rough Sets in Knowledge Discovery and Soft Computing at ETAPS’2003, Electronic Notes In Theoretical Computer Science 82(4) 2003, s. 20–29.zobacz w PBN
• Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz i Andrzej Szałas, Preface, Fundamenta Informaticae 57 (2-4) 2003.zobacz w PBN
• Anh Linh Nguyen, A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs, Fundamenta Informaticae 55 (1) 2003, s. 63–100.zobacz w PBN
• Janina Mincer-Daszkiewicz, Deploying University Study-Oriented System at Polish Universities, w: EUNIS 2003, 9th International Conference of European University Information Systems, Universiteit van Amsterdam, Amsterdam, the Netherlands 2003, s. 513–517.zobacz w PBN
• Lech Banachowski, Agnieszka Chądzyńska-Krasowska, Krzysztof Matejewski, Elżbieta Mrówka-Matejewska i Krzysztof Stencel, Bazy danych. Wykłady i ćwiczenia, Wydawnictwo Polsko-Japońskiej Wyższej Szkoły Technik Komputerowych, Warszawa 2003.zobacz w PBN
• Andrzej Szałas, On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems, w: Fundamentals of Computation Theory, Springer, 2003, s. 423–431.zobacz w PBN
• Mikołaj Bojańczyk, 1-Bounded TWA Cannot Be Determinized, Lecture Notes In Computer Science 2914 2003, s. 62–73.zobacz w PBN
• Damian Niwiński i Igor Walukiewicz, A gap property of deterministic tree languages, Theoretical Computer Science 303 2003, s. 215–231.zobacz w PBN
• Szymon Nowakowski, Andriey Kryshtafovych, Krzysztof Fidelis i Jerzy Tiuryn, Detecting Local Structure in proteins by Analyzing Motif Sequence Signatures, w: Proceedings of the European Conference on Computational Biology in Conjunction with the French National Conference on Bioinformatics, Paris 2003.zobacz w PBN
• Miroslaw Makaros i Krzysztof Stencel, Elastyczny system kontroli uprawnien użytkowników baz danych, w: Problemy i metody inżynierii oprogramowania, Wydawnictwa Naukowo-Techniczne, Warszawa 2003.zobacz w PBN
• P. Doherty, M. Grabowski, W. Łukaszewicz i A. Szałas, Towards a Framework for Approximate Ontologies, Fundamenta Informaticae Vol. 57, nr 2-4 2003, s. 147–165.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Tolerance Spaces and Approximative Representational Structures, w: KI 2003: Advances in Artificial, Springer, 2003, s. 475–489.zobacz w PBN
• J. Jaromczyk i Mirosław Kowaluk, Sets of lines and cutting out polyhedral objects, Computational Geometry-theory And Applications 25 2003, s. 67–95.zobacz w PBN
• Mikołaj Bojańczyk, The Finite Graph Problem for Two-Way Alternating Automata, Theoretical Computer Science 298 (3) 2003, s. 511–528.zobacz w PBN
• Wojciech Plandowski, Test Sets for Large Families of Languages, Lecture Notes In Computer Science 2710 2003, s. 75–94.zobacz w PBN
• Andrzej Tarlecki, Abstract specification theory: an overview, w: Models, Algebras, and Logics of Engineering Software, IOS Press, Washington 2003.zobacz w PBN
• Krzysztof Ciebiera i Piotr Sankowski, Inteligentny system dopasowania struktury pasmowej dla modelu ciasnego wiązania, w: V Krajowa Konferencja Naukowa Inżynieria Wiedzy i Systemy Ekspertowe 2003, Wrocław 2003.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Information Granules for Intelligent Knowledge Structures, w: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing: 9th International Conference, RSFDGrC 2003, Chongqing, China, May 26–29, 2003 Proceedings, Springer Verlag, Heidelberg 2003, s. 405–412.zobacz w PBN
• Wojciech Legierski i Paweł Parys, System for Solving Timetabling Problems, w: Proceedings of the AI-METH 2003 Symposium on Methods of Artificial Intelligence, 2003, s. 76–77.zobacz w PBN
• Jacek Chrząszcz, Implementation of Modules in the Coq System, Lecture Notes In Computer Science 2758 2003, s. 270–286.zobacz w PBN
• Wojciech Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science 299 (1-3) 2003, s. 763–774.zobacz w PBN
• Krzysztof Ciebiera i Tomasz Waleń, Large scale programming contest system, w: EUNIS 2003, 9th International Conference of European University Information Systems, Universiteit van Amsterdam, Amsterdam, the Netherlands 2003.zobacz w PBN
• Krzysztof Diks i Krzysztof Onak (red.), X Olimpiada Informatyczna 2002/2003, Komitet Główny Olimpiady Informatycznej, Warszawa 2003.zobacz w PBN
• Adam Krawczyk i Henryk Michalewski, An example of a topological group, Topology And Its Applications 127 2003, s. 325–330.zobacz w PBN
• Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Relations between delta-matching and matching with don, Information Processing Letters 85 (5) 2003, s. 227–233.zobacz w PBN
• Wojciech Rytter, On maximal suffices and constant space versions of KMP algorithm, Theoretical Computer Science 302 2003, s. 211–222.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, A tuning machine for collective commitments, w: Proceedings of The First International Workshop on Formal Approaches to Multi-Agent Systems, Uniwersytet Warszawski, Warszawa 2003.zobacz w PBN
• Łukasz Kowalik, Opracowanie zadania "Przemytnicy", w: X Olimpiada Informatyczna 2002/2003, Komitet Główny Olimpiady Informatycznej, Warszawa 2003.zobacz w PBN
• Barbara Dunin-Kęplicz i Rineke Verbrugge (red.), Workshop on Formal Approaches to Multi-agent Systems, 2003.zobacz w PBN
• Henryk Michalewski, Condensations of projective sets onto compacta, Proceedings Of The American Mathematical Society 131(11) 2003, s. 3601–3606.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski i Wojciech Rytter, Occurrence and substring heuristics for delta-matching, Fundamenta Informaticae 56 (1) 2003, s. 1–21.zobacz w PBN
• Piotr Sankowski, Alternative Algorithm for Counting All Matchings in Graphs, Lecture Notes In Computer Science 2607 2003, s. 427–438.zobacz w PBN
• Anna Gambin i Damian Wójtowicz, Almost FPRAS for Lattice Models of Protein Folding, w: Currents in Computational Molecular Biology 2003, Berlin 2003.zobacz w PBN
• Piotr Dembinski, Agata Janowska, Paweł Janowski, Wojciech Penczek, Agata Połrola, Maciej Szreter, Bożena Woźna i Andrzej Zbrzeźny, Verics: weryfikator dla automatów czasowych i specyfikacji zapisanych w języku Estelle, w: Materiały X Konferencji Systemów Czasu Rzeczywistego, Instytut Informatyki Politechniki Sląskiej, Gliwice 2003.zobacz w PBN
• M. Crochemore, C.S. Iliopoulos, T. Lecroq, Y.J. Pinzon, W. Plandowski i W. Rytter, Occurrence and Substring Heuristics for [ro]-Matching, Fundamenta Informaticae Vol. 56, nr 1,2 2003, s. 1–21.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, On Mutual Understanding among Communicating Agents, w: Workshop on Formal Approaches to Multi-agent Systems, 2003, s. 83–97.zobacz w PBN
• Robert Benkoci, Marek Chrobak, Lawrence Larmore i Wojciech Rytter, Faster algorithms for k-medians in trees, Lecture Notes In Computer Science 2747 2003, s. 218–227.zobacz w PBN
• Piotr Sankowski, Multisampling: a New Approach to Uniform Sampling and Approximate Counting, Lecture Notes In Computer Science 2832 2003, s. 740–751.zobacz w PBN
• Agata Janowska i Paweł Janowski, Slicing Timed Systems, w: Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P, Wydawnictwa Uniwersytetu Warszawskiego, Warszawa 2003.zobacz w PBN
• Janusz Jabłonowski, Programowanie zespołowe – przegląd doswiadczeñ na przykładzie Zespołowego Projektu Programistycznego, w: Problemy i metody Inżynierii Oprogramowania, Wydawnictwa Naukowo-Techniczne, Warszawa 2003.zobacz w PBN
• Hung Son Nguyen, On the decision table with maximal number of reducts, Electronic Notes In Theoretical Computer Science 82 2003, s. 197–204.zobacz w PBN
• Artur Czumaj, Leszek Gasieniec, Daya Gaur, Ramesh Krishnamurti, Wojciech Rytter i Michele Zito, On polynomial-time approximation algorithms for the variable length scheduling problem, Theoretical Computer Science 302 2003, s. 489–495.zobacz w PBN
• Piotr Sankowski i Perla Kacman, Interlayer Coupling in EuS-based Superlattices (Dependence on the Energy Structure of Non-magnetic Layer), Acta Physica Polonica A 103 (6) 2003, s. 621–628.zobacz w PBN
• Jan Madey, Jose Fiadeiro i Andrzej Tarlecki (red.), Special Issue to Honour Professor W.M. Turski, Elsevier, Amsterdam 2003.zobacz w PBN
• Luis Filippe Andrade, Paolo Baldan, Hubert Baumeister, Roberto Bruni, Andrea Corradini, Rocco De Nicolo, Jose Luis Fiadeiro, Fabio Gadducci, Stefania Gnesi, Piotr Hoffman, Nora Koch, Piotr Kosiuczenko, Alessandro Lapadula, Diego Latella, Antonia Lopes, Michele Loreti, Mieke Massink, Franco Mazzanti, Ugo Montanari, Cristovao Oliveira, Rosario Pugliese, Andrzej Tarlecki, Michel Wermelinger, Martin Wirsing i Artur Zawłocki, AGILE: Software Architecture for Mobility., w: Recent Trends in Algebraic Development Techniques, 16th International Workshop, WADT 2002, Frauenchiemsee, Germany, September 24-27, 2002, Revised Selected Papers., Springer, 2003, s. 1–33.zobacz w PBN
• Hung Son Nguyen i S Nguyen, Analysis of STULONG Data by Rough Set Exploration System (RSES), w: Proceedings of ECML/PKDD-2003 Discovery Challenge Workshop, Ruder Boskovic Institute, Zagreb 2003.zobacz w PBN
• Piotr Dembinski, Agata Janowska, Paweł Janowski, Wojciech Penczek, Agata Polrola, Maciej Szreter, Bozena Wozna i Andrzej Zbrzezny, Verics: A Tool for Verifying Timed Automata and Estelle Specifications, Lecture Notes In Computer Science 2619 2003, s. 278–283.zobacz w PBN
• Paweł Urzyczyn, A simple proof of undecidability of strong normalization, Mathematical Structures In Computer Science 13 2003, s. 5–13.zobacz w PBN
• Rafał Otto i Anna Gambin, Contextual Multiple Sequence Alignment (Context helps in aligning orphan genes, w: Currents in Computational Molecular Biology 2003, RECOMB, Berlin 2003.zobacz w PBN

2002

• Andrzej Skowron i Marcin Szczuka, Approximate reasoning schemes: classifiers for computing with words, w: Soft methods in Probability, Statistics and Data Analysis P.Grzegorzewski, O.Hryniewicz, M.A.Gil (Eds.),, Physica-Verlag, Heidelberg 2002.zobacz w PBN
• Marek Chrobak, Leszek Gasieniec i Wojciech Rytter, Fast broadcasting and gossiping in radio networks, Journal Of Algorithms-cognition Informatics And Logic 43 (2) 2002, s. 177–189.zobacz w PBN
• Barbara Dunin-Kęplicz i Ewdard Nawarecki (red.), From theory to practice in multi-agent systems, Selected papers from The Second International Workshop of Central and Eastern Europe on Multi-Agent Systems, Springer, Berlin 2002.zobacz w PBN
• Hung Son Nguyen i H Wang, Pattern extraction methods for text classification, w: Technologies for Constructing Intelligent Systems I, Physica VerlagŚpringer, Berlin, Heidelberg 2002.zobacz w PBN
• Krzysztof Diks, E. Kranakis, D. Krizanc i A. Pelc, The impact of information on broadcasting time in linear radio networks, Theoretical Computer Science 287 (2) 2002, s. 449–471.zobacz w PBN
• Tero Harju, Juhani Karhumaki i Wojciech Plandowski, Independent systems of equations, w: Algebraic Combinatorics on Words, Cambridge University Press, Cambridge 2002.zobacz w PBN
• Hung Son Nguyen, A soft decision tree, w: Intelligent Information Systems Advances in Soft Computing, M.A. Kłopotek, S. Wierzchoń, M. Michalewicz (Eds.); Proc. IIS, Springer-Verlag, Berlin, Heidelberg 2002.zobacz w PBN
• Barbara Dunin-Kęplicz i R. Verbrugge, Collective intentions, Fundamenta Informaticae 51 (3) 2002, s. 271–295.zobacz w PBN
• Barbara Dunin-Kęplicz i R. Verbrugge, Evolution of collective commitments during reconfiguration, w: Proceedings of The First International Joint Conference on Autonomous Agents and Multiagent Systems AAMAS, ACM Press, New York 2002.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, Lazy classification method based on Boolean reasoning approach, w: Proceedings of the Workshop in Concurrency, Specification and Programming, Humboldt Universitat zu Berlin, Berlin, Niemcy 2002.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Three heuristics for delta-matching: delta-BM algorithms, Lecture Notes In Computer Science 2373 2002, s. 178–189.zobacz w PBN
• Janusz Jabłonowski, Computer Aided Development of Correct Programs, w: ComSysTech, Bulgarian chapter of ACM, Sofia 2002.zobacz w PBN
• D. Ślęzak, Approximate Entropy Reducts, Fundamenta Informaticae 53 (3,4) 2002, s. 365–390.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, An application of approximated entropy measures in decision tree induction, w: Proceedings of the Conference of Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU, Universite de Savoie, Savoie, Francja 2002.zobacz w PBN
• Anh Linh Nguyen, Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief, Lecture Notes In Computer Science 2381 2002, s. 206–220.zobacz w PBN
• Jerzy Tiuryn, Hoare logic: from first-order to propositional formalism, w: Proofs and System-Reliability, Kluwer Academic Publishers, Dordrecht 2002.zobacz w PBN
• Janina Mincer-Daszkiewicz, Tworzenie i wdrażanie produkcyjnego oprogramowania w środowisku akademickim, w: IV Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwo Nakom, Poznań 2002, s. 225–236.zobacz w PBN
• Stefan Dziembowski i Ueli Maurer, Tight Security Proofs for the Bounded-Storage Model, Symposium On Theory Of Computing 34 2002, s. 341–350.zobacz w PBN
• Jerzy Tiuryn i Viviana Bono, Products and Polymorphic Subtypes, Fundamenta Informaticae 51 (1,2) 2002, s. 13–41.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
• Piotr Chrząstowski-Wachtel, Recovery Nets: Model for Dynamic Workflows, w: Proceedings of the International Workshop on Concurrency, Specificationand Programming, Humboldt University, Berlin 2002.zobacz w PBN
• Krzysztof Diks i Krzysztof Onak (red.), IX Olimpiada Informatyczna 2001/2002, Komitet Główny Olimpiady Informatycznej, Warszawa 2002.zobacz w PBN
• Mikołaj Bojańczyk, Two-way alternating automata and finite models, Lecture Notes In Computer Science 2380 2002, s. 833–844.zobacz w PBN
• Sławomir Lasota, Coalgebra morphisms subsume open maps, Theoretical Computer Science 280 2002, s. 123–135.zobacz w PBN
• Anna Gambin i Jerzy Tyszkiewicz, Substitution tables for contextual alignment, w: Journees Ouvertes Biologie Informatique Mathematique, INRIA, Rennes 2002.zobacz w PBN
• Andrzej Tarlecki, Michel Bidoit i Don Sannella, Architectural Specifications in CASL, Formal Aspects Of Computing 13 2002, s. 252–273.zobacz w PBN
• Damian Niwiński, Mu-calculus via games, Lecture Notes In Computer Science 2471 2002, s. 27–43.zobacz w PBN
• Krzysztof Diks, Łukasz Kowalik i Maciej Kurowski, A new 3-color criterion for planar graphs, Lecture Notes In Computer Science 2573 2002, s. 138–149.zobacz w PBN
• Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski i Wojciech Rytter, On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN
• V. Bono i J. Tiuryn, Products and Polymorphic Subtypes, Fundamenta Informaticae Vol. 51, nr 1,2 2002, s. 13–41.zobacz w PBN
• 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
• A. Pagourtzis, I. Potapov i Wojciech Rytter, Observations on Parallel Computation of Transitive and Max-Closure Problems, Lecture Notes In Computer Science 2474 2002, s. 217–225.zobacz w PBN
• M. Bidoit, D. Sannella i Andrzej Tarlecki, Toward Component-Oriented Formal Software Development: an Algebraic Approach, w: Proc. 9th Monterey Software Engineering Workshop 2002"Radical Innovations of Software and System Engineering in the Future", Universita Ca Foscari di Venezia, Venice 2002.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
• Marcin Peczarski, Sorting 13 Elements Requires 34 Comparisons, Lecture Notes In Computer Science 2461 2002, s. 785–794.zobacz w PBN
• Jerzy Jaromczyk i Mirosław Kowaluk, A kinetic view of the shooter problem, w: Proc. of the 18th European Workshop on Computational Geometry, Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego, Warszawa 2002.zobacz w PBN
• Maxime Crochemore, C. Iliopoulos, C. Makris, Wojciech Rytter, A. Tsakalidis i K. Tsichlas, Approximate string matching with gaps, Nordic Journal Of Computing 9 2002, s. 54–65.zobacz w PBN
• Jerzy Tiuryn i Paweł Urzyczyn, The subtyping problem for second-order types is undecidable, Information And Computation 179 2002, s. 1–18.zobacz w PBN
• Andrzej Tarlecki, E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brueckner, P. Mosses i D. Sannella, CASL: The Common Algebraic Specification Language, Theoretical Computer Science 286 (2) 2002, s. 153–196.zobacz w PBN
• Wojciech Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Lecture Notes In Computer Science 2373 2002, s. 20–31.zobacz w PBN
• Janina Mincer-Daszkiewicz, Student Management Information System for Polish Universities, w: EUNIS 2002, The Eight International Conference of European University Information Systems, FEUP edicoes, Universidade do Porto, Porto 2002, s. 275–281.zobacz w PBN
• Egidio Astesiano, Michel Bidoit, Hélène Kirchner, Bernd Krieg-Brückner, Peter D. Mosses, Donald Sannella i Andrzej Tarlecki, CASL: the Common Algebraic Specification Language, Theoretical Computer Science 286 2002, s. 153–196.zobacz w PBN
• Teodor Knapik, Damian Niwiński i Paweł Urzyczyn, Higher-order pushdown trees are easy, Lecture Notes In Computer Science 2303 2002, s. 205–222.zobacz w PBN
• Wojciech Plandowski, P. Berman, M. Karpinski i L. Larmore, The complexity of pattern matching of highly compressed two-dimensional texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN
• Wojciech Rytter, On maximal suffices and constant space versions of KMP algorithm, Lecture Notes In Computer Science 2286 2002, s. 196–208.zobacz w PBN
• Andrzej Szałas, Second-Order Quantifier Elimination in Modal Contexts, w: Logics in Artificial Intelligence, Springer, 2002, s. 223–232.zobacz w PBN
• Jan Bazan, A Osmólski, Andrzej Skowron, Marcin Szczuka, Dominik Ślęzak i Jakub Wróblewski, Rough set approach to the survival analysis, Lecture Notes In Computer Science 2475 2002, s. 522–529.zobacz w PBN
• M. Bidoit, D. Sannella i Andrzej Tarlecki, Global Development via Local Observational Construction Steps, Lecture Notes In Computer Science 2420 2002, s. 1–24.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, On word equations in one variable, Lecture Notes In Computer Science 2420 2002, s. 212–221.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, CAKE: A Computer-Aided Knowledge Engineering Technique, w: Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI'2002, IOS Press, 2002, s. 220–224.zobacz w PBN
• J Peters i Marcin Szczuka, Rough Neurocomputing: a survey of basic models of neurocomputation,, Lecture Notes In Computer Science 2475 2002, s. 308–315.zobacz w PBN
• Jerzy Tyszkiewicz, Michał Bielecki, J. Hidders, J. Paredaens i J. Van den Bussche, Navigating with a browser, Lecture Notes In Computer Science 2380 2002, s. 764–775.zobacz w PBN
• Krzysztof Diks, Pierre Fraigniaud, E. Kranakis i Andrzej Pelc, Tree exploration with little memory, w: ACM-SIAM Symposium on Discrete Algorithms, ACM, San Francisco 2002.zobacz w PBN
• J Bazan, Marcin Szczuka i J Wróblewski, A new version of rough set exploration system, Lecture Notes In Computer Science 2475 2002, s. 397–404.zobacz w PBN
• Wojciech Rytter, Phillip Bradford, Mordecai Golin i Lawrence Larmore, Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property, Journal Of Algorithms-cognition Informatics And Logic 42 (2) 2002, s. 277–303.zobacz w PBN
• Krzysztof Diks i Wojciech Rytter (red.), Mathematical Foundations of Computer Science 2002, 27th International Symposium, Springer, Berlin 2002.zobacz w PBN
• B. Dunin-Kęplicz i R. Verbrugge, Collective Intentions, Fundamenta Informaticae Vol. 51, nr 3 2002, s. 271–295.zobacz w PBN
• Hung Son Nguyen, Scalable classification mathod based on rough sets, Lecture Notes In Computer Science 2475 2002, s. 433–440.zobacz w PBN
• Bogdan Chlebus, Leszek Gasieniec, Alan Gibbons, Wojciech Rytter i Andrzej Pelc, Deterministic broadcasting in ad hoc radio networks, Distributed Computing 15 2002, s. 27–38.zobacz w PBN
• Anna Doros, Agata Janowska i Paweł Janowski, From Specification Languages to Timed Automata, w: Proceedings of the International Workshop on Concurrency, Specificationand Programming, Humboldt University, Berlin 2002.zobacz w PBN

2001

• Wojciech Rytter, I. Potapov i A. Pagourtzis, PVM computation of transitive closure: the dependency graph approach, Lecture Notes In Computer Science (2131) 2001, s. 249–259.zobacz w PBN
• Marcin Szczuka, Refining classifiers with neural networks, International Journal Of Intelligent Systems 16 2001, s. 39–55.zobacz w PBN
• Marcin Kubica i Paweł Wolff, Łańcuch, w: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• W. Pohl i Tomasz Waleń, Mars maps, Kwartalnik Nauk O PrzedsiĘbiorstwie 2001, s. 31–36.zobacz w PBN
• Henryk Michalewski, An answer to a question of Arhangel'skii, Commentationes Mathematicae Universitatis Carolinae 42 (3) 2001, s. 545–550.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas, w: Proceedings of Seventeenth International Joint Conference on Artificial Intelligence, 2001, s. 145–154.zobacz w PBN
• Jerzy Tyszkiewicz, Computability by Sequences of Queries, Fundamenta Informaticae 48 (4) 2001, s. 389–414.zobacz w PBN
• Marcin Szczuka i P Wojdyłło, Neuro-wavelet classifiers for EEG signals based on rough set methods, Neurocomputing 36 (1-4) 2001, s. 103–122.zobacz w PBN
• Adam Malinowski, Wojciech Rytter i Paweł Wolff, Porównywanie naszyjników, w: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• V. Leppanen i Tomasz Waleń, Postman, Kwartalnik Nauk O PrzedsiĘbiorstwie 2001, s. 23–26.zobacz w PBN
• A. Czumaj, I. Finch, L. Gąsieniec, A. Gibbons, P. Leng, Wojciech Rytter i M. Zito, Efficient web searching using temporal factors, Theoretical Computer Science 262 (1) 2001, s. 569–582.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Jerzy Tyszkiewicz, A. Hoffmann i A. Ramer, Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker, Information Processing Letters 79 (4) 2001, s. 155–160.zobacz w PBN
• Hung Son Nguyen, On Efficient Construction of Decision Trees from Large Databases, w: 10th International Symposium on Intelligent Communications of the formation Systems, Instytut Podstaw Informatyki PAN, Warszawa 2001.zobacz w PBN
• Wojciech Rytter i Piotr Sankowski, Spokojna komisja, w: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• Mikołaj Bojańczyk, The finite graph problem for two-way alternating automata, Lecture Notes In Computer Science (2030) 2001, s. 88–103.zobacz w PBN
• Hung Son Nguyen, On Searching for best partition in large databases., w: Proceedings of Workshops on Concurrency, Specification and Programming., Uniwersytet Warszawski, Warszawa 2001.zobacz w PBN
• T Śmigielski i Marcin Mucha, Mapa gęstości, w: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• Wojciech Rytter, L. Larmore i M. Chrobak, The k-median problems for directed trees, Lecture Notes In Computer Science 2136 2001, s. 260–269.zobacz w PBN
• Wojciech Plandowski, J. Karhumaki i F. Mignosi, On the expressibility of languages by word equations with a bounded number of variables, Bulletin Of The Belgian Mathematical Society-simon Stevin 8 (2) 2001, s. 293–305.zobacz w PBN
• F. Dignum, Barbara Dunin-Kęplicz i L. Verbrugge, Agent theory for team formation by dialogue. W: C. Castelfranchi and Y. Lesperance (eds.) Intelligent Agents VII: Agent Theories, Architectures and Languages., Lecture Notes In Computer Science 1986 2001, s. 150–166.zobacz w PBN
• Anna Gambin, Sławomir Lasota i M. Dietzfelbinger, On different models for packet flow in multistage interconnection networks, Fundamenta Informaticae 46 (4) 2001, s. 287–314.zobacz w PBN
• Barbara Dunin-Kęplicz, F. Brazier, J. Treur i R. Verbrugge, Modelling Internal Dynamic Behaviour of BDI Agents, w: Dynamics of Management of Reasoning Processes, Kluwer Academic Publishers, Dordrecht 2001.zobacz w PBN
• Piotr Pokarowski i Anna Gambin, A new combinatorial algorithm for large Markov chains., w: Computer Algebra in Scientific Computing-CASC 2001, Springer-Verlag, Berlin 2001.zobacz w PBN
• Mirosława Miłkowska i W. Drabent, Proving correctness and completeness of normal programs - A declarative approach, Lecture Notes In Computer Science (2237) 2001, s. 284–299.zobacz w PBN
• Stella Orłowska i Andrzej Szałas (red.), Relational Methods for Computer Science Applications, Springer Physica Verlag, 2001.zobacz w PBN
• Marcin Kubica (red.), The 7th Baltic Olympiad in Informatics, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• Wojciech Plandowski, Wojciech Rytter i J. Karhumaki, On the complexity of decidable cases of commutation problem for languages, Lecture Notes In Computer Science (2138) 2001, s. 193–203.zobacz w PBN
• J. Kachniarz i Andrzej Szałas, On a Static Verification of Integrity Constraints in Relational Databases, w: Relational Methods for Computer Science Applications, Springer Physica Verlag, 2001.zobacz w PBN
• Grazyna Mirkowska, Andrzej Salwicki, Marian Srebrny i Andrzej Tarlecki, First order specifications of programmable data types, Siam Journal On Computing 30 2001, s. 2084–2096.zobacz w PBN
• Andrzej Tarlecki, Piotr Hoffman, B. Klin, A. Schroeder i T. Mossakowski, Checking amalgamability conditions for CASL architectural specifications, Lecture Notes In Computer Science (2136) 2001, s. 451–463.zobacz w PBN
• J. GirardPaweł Urzyczyn (red.), Special Issue of Fundamenta Informaticae, IOS Press, Amsterdam 2001.zobacz w PBN
• Anna Gambin i Piotr Pokarowski, A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain (Extended Abstract), Lecture Notes In Computer Science 2138 2001, s. 384–388.zobacz w PBN
• Krzysztof Stencel i Lech Banachowski, Bazy danych. Projektowanie aplikacji na serwerze, Akademicka Oficyna Wydawnicza EXIT, Warszawa 2001.zobacz w PBN
• Damian Niwiński, Paweł Urzyczyn i T. Knapik, Deciding monadic theories of hyperalgebraic trees, Lecture Notes In Computer Science (2044) 2001, s. 253–267.zobacz w PBN
• Damian Niwiński i A. Arnold, Rudiments of Mu-calculus, North-Holland, Elsevier, Amsterdam 2001.zobacz w PBN
• Adam Bałaban i Marcin Kubica, Specyfikacja i weryfikacja programów operujących na wskaźnikowych strukturach danych, w: III Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwo MIKOM, Warszawa 2001.zobacz w PBN
• Anh Linh Nguyen, The modal query language MDatalog, Fundamenta Informaticae 46 (4) 2001, s. 315–342.zobacz w PBN
• Marcin Benke, Some tools for computer-assisted theorem proving in Martin-L"of type theory, w: R.J. Boulton, P.B. Jackson, 14th International Conference on Theorem Proving in Higher Order Logics, University Edinburgh, Edinburgh 2001.zobacz w PBN
• Mirosława Miłkowska i W. Drabent, Deklaratywne podejście do wnioskowania o programach w języku logiki, w: III Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwo MIKOM, Warszawa 2001.zobacz w PBN
• Wojciech Rytter, M. Chrobak i L. Gąsieniec, A randomized algorithm for gossiping in radio networks, Lecture Notes In Computer Science 2108 2001, s. 483–492.zobacz w PBN
• Jerzy Tyszkiewicz, F. Neven, M. Otto i Jan Van den Bussche, Adding for-loops to first order logic, Information And Computation 168 (2) 2001, s. 156–186.zobacz w PBN
• Barbara Dunin-Kęplicz i T Nawarecki (red.), Proceedings of the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems, CEEMAS, Kraków 2001.zobacz w PBN
• Marcin Engel, Wykorzystanie systemów wspomagających dowodzenie do weryfikacji wewnętrznej spójności specyfikacji, w: III Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwo MIKOM, Warszawa 2001.zobacz w PBN
• Andrzej Tarlecki, Piotr Hoffman, B. Klin, A. Schroeder i T. Mossakowski, Semantics of architectural specifications in CASL, Lecture Notes In Computer Science (2029) 2001, s. 253–266.zobacz w PBN
• F. Dignum, Barbara Dunin-Kęplicz i R. Verbrugge, Creating collective intention through dialogue, Logic Journal Of The Igpl 9 (1) 2001, s. 289–303.zobacz w PBN
• Janina Mincer-Daszkiewicz, Tworzenie produkcyjnego oprogramowania w środowisku akademickim, w: III Krajowa Konferencja Inżynierii Oprogramowania, Wydawnictwo MIKOM, Warszawa 2001.zobacz w PBN
• Andrzej Tarlecki, T. Mossakowski i L. Schroeder, Amalgamation in CASL via enriched signatures, Lecture Notes In Computer Science (2076) 2001, s. 993–1004.zobacz w PBN
• Barbara Dunin-Kęplicz i R. Verbrugge, A reconfiguration algorithm for distributed problem solving, Modelling And Simulation In Materials Science And Engineering 18 2001, s. 227–246.zobacz w PBN
• Krzysztof Diks i Tomasz Waleń (red.), VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• M Dietzfelbiner, A. Gambin i S. Lasota, On different models for packet flow in Multistage Interconnection Networks, Fundamenta Informaticae Vol. 46, nr 4 2001, s. 287–314.zobacz w PBN
• Aleksy Schubert, The complexity of beta-Reduction in low orders, Lecture Notes In Computer Science (2044) 2001, s. 400–414.zobacz w PBN
• Hung Son Nguyen, Andrzej Skowron i J Stepaniuk, Granular Computing: A Rough Set Approach, Computational Intelligence 17 (3) 2001, s. 514–544.zobacz w PBN
• Wojciech Guzicki, J. Wróblewski i Marcin Mucha, Gorszy Goldbach, w: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• Anh Linh Nguyen, Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5, Studia Logica 69 (1) 2001, s. 41–57.zobacz w PBN
• Jerzy Tiuryn, A sequent calculus for subtyping polymorphic types, Information And Computation 164 (164) 2001, s. 345–369.zobacz w PBN
• Hung Son Nguyen, On Efficient Handling of Continuous Attributes in Large Data Bases, Fundamenta Informaticae 48 (1) 2001, s. 61–81.zobacz w PBN
• Marcin Kubica i Marcin Sawicki, Bank, w: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.zobacz w PBN
• M. Opmanis i Piotr Sankowski, Box of mirrors, Kwartalnik Nauk O PrzedsiĘbiorstwie 2001, s. 13–16.zobacz w PBN

2000

• Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk i Wojciech Plandowski, Algorithms for the parallel alternating direction access machine, Theoretical Computer Science 245 (2) 2000, s. 151–173.zobacz w PBN
• Anh Linh Nguyen, Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5, Lecture Notes In Computer Science 1847 2000, s. 341–351.zobacz w PBN
• J. M. Olchowik, A. Zdyb, D. Szymczuk, J. Mucha, K. Zabielski, W. Sadowski i M. Mucha, Analysis of crystallisation of GaAs/Si heterostructures, Opto-electronics Review Vol. 8, nr 4 2000, s. 393–397.zobacz w PBN
• Jerzy Tyszkiewicz i E Rosen, SO(AE*) sentences and their asymptotic probabilities, Mathematical Logic Quarterly 46 2000, s. 435–452.zobacz w PBN
• Daria Walukiewicz-Chrząszcz, Termination of Rewriting in the Calculus of Constructions, w: Proceedings of the Workshop on Logical Frameworks and Meta-languages (Part of the LICS`2000), IEEE, Santa Barbara, California, 2000.zobacz w PBN
• Henryk Michalewski, Homogeneity of $\scr K(\bold Q)$, Tsukuba Journal Of Mathematics 24 (2) 2000, s. 297–302.zobacz w PBN
• Barbara Dunin-Kęplicz, R Verbrugge i F Dignum, Dialogue in team formation, Lecture Notes In Computer Science 1916 2000, s. 264–280.zobacz w PBN
• Aleksy Schubert, Type inference for first order logic, Lecture Notes In Computer Science 1784 2000, s. 297–314.zobacz w PBN
• Damian Niwiński i Andre Arnold, O abstrakcyjnym podejściu do rachunku punktów stałych, w: Materiały z konferencji: Informatyka teoretyczna - metody analizy informacji niekompletnej i rozproszonej, Politechnika Białostocka, Białystok 2000.zobacz w PBN
• I Duentsch, G Gediga i Hung Son Nguyen, Rough Set Data Analysis in the KDD Process, w: Proc. of 8th International Conference IPMU, Universidad Politechnica de Madrid, Madrid, Spain 2000.zobacz w PBN
• Jerzy Tyszkiewicz, A simple construction for tournaments with every k players beaten by a single player, American Mathematical Monthly 107 2000, s. 53–54.zobacz w PBN
• Wojciech Plandowski i L. Ilie, Two-Variable Word Equations, Rairo-theoretical Informatics And Applications 34 2000, s. 467–501.zobacz w PBN
• Mirosława Miłkowska, Wspomaganie walidacji specyfikacji wymagań w języku Spill, w: II Krajowa Konferencja Inżynierii Oprogramowania, Katedra Informatyki Akademii Górniczo-Hutniczej w Krakowie, Kraków 2000.zobacz w PBN
• Hung Son Nguyen, On Efficient Construction of Decision tree from Large Databases, w: Proc. of the Second International Conference on Rough Sets and Current Trends in Computing, Springer-Verlag, Berlin 2000.zobacz w PBN
• Hung Son Nguyen i H Wang, Pattern Extraction Method for Text Classification, w: Proceedings of the International Conference IPMU, Universidad Politechnica de Madrid, Spain, Madrid, Spain 2000.zobacz w PBN
• Janina Mincer-Daszkiewicz, Formalna weryfikacja modułów programistycznych w podejściu funkcyjnym, w: II Krajowa Konferencja Inżynierii Oprogramowania, Katedra Informatyki Akademii Górniczo-Hutniczej w Krakowie, Kraków 2000, s. 55–63.zobacz w PBN
• Dominik Ślęzak, Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis, Fundamenta Informaticae 44 (3) 2000, s. 291–319.zobacz w PBN
• Krzysztof Diks i Andrzej Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes,, Algorithmica 28 (1) 2000, s. 37–50.zobacz w PBN
• Hung Son Nguyen, Andrzej Skowron i Marcin Szczuka, Situation identification by unmanned aerial vehicle, w: Proceedings of the Second International Conference RSTC, Springer-Verlag, Berlin 2000.zobacz w PBN
• Bogdan Chlebus, L Gąsieniec, A Gibbons, A Pelc i Wojciech Rytter, Deterministic broadcasting in unknown radio networks, w: Proc. 11-th ACM-SIAM Symp. on Discrete Algorithms, ACM, San Francisco, California 2000.zobacz w PBN
• Krzysztof Diks i Tomasz Waleń (red.), VII Olimpiada Informatyczna 1999/2000, Komitet Główny Olimpiady Informatycznej, Warszawa 2000.zobacz w PBN
• Witold Łukaszewicz, Andrzej Szałas i P. Dohery, Efficient reasoning using the local closed-world assumption, Lecture Notes In Computer Science 1904 2000, s. 49–58.zobacz w PBN
• Barbara Dunin-Kęplicz, F Dignum i R Verbrugge, Creating collective intention through dialogue, w: Proceedings of International Conference on Formal and Applied Practical Reasoning FAPR, Imperial College, London 2000.zobacz w PBN
• Krzysztof Diks, Czy P <> NP? - wyzwanie dla algorytmikow XXI wieku,, Delta 12 2000, s. 3–5.zobacz w PBN
• Marcin Engel, Janina Mincer-Daszkiewicz i Artur Kret, Towards automated consistency checking of module interface specifications, Fundamenta Informaticae 42 (3-4) 2000, s. 251–278.zobacz w PBN
• Agata Janowska i M Pakuła, Model checking of Estelle specifications with SPI, w: . Workshop Concurrency, Specification and Programming, Humboldt Universitat, Berlin 2000.zobacz w PBN
• Wojciech Plandowski, Wojciech Rytter i j Karhumaki, Pattern matching for images generated by finite automata, Nordic Journal Of Computing 7 (1) 2000, s. 1–13.zobacz w PBN
• Aleksy Schubert i K Fujita, Partially typed terms between Church-style and Curry-style, Lecture Notes In Computer Science 1872 2000, s. 505–520.zobacz w PBN
• J Kachniarz i Andrzej Szałas, On rule-based approach to the construction of logical transformers, w: First International Workshop on Rule-Based Programming, ACM, Montreal, Canada 2000.zobacz w PBN
• Andrzej Tarlecki, F Honsell, J Longley i D Sannella, Constructive data refinement in typed lambda calculus, Lecture Notes In Computer Science 1784 2000, s. 161–177.zobacz w PBN
• Jerzy Tiuryn i D Kozen, On the completeness of propositional Hoare Logic, w: 5th Int. Seminar Relational Methods in Computer Science, Universite Laval, Quebec, Canada 2000.zobacz w PBN
• Wojciech Plandowski, J Karhumaki i F Mignosi, The expressibility of languages and relations by word equations, Journal Of The Acm 47 (3) 2000, s. 483–505.zobacz w PBN
• Andrzej Tarlecki, Towards heterogeneous specifications, w: . Intl. Conference Frontiers of Combining Systems FroCoS, Research Studies Press, Amsterdam 2000.zobacz w PBN
• Sławomir Lasota, Behavioural constructor implementation for regular algebras, Lecture Notes In Computer Science 1955 2000, s. 54–69.zobacz w PBN
• Wojciech Rytter, M Chrobak i L Gąsieniec, Fast broadcasting and gossiping in radio networks, w: Proc. 41 IEEE Symposium on Foundations of Computer Sciencs, IEEE, Londyn 2000.zobacz w PBN
• Sławomir Lasota, Finitary observations in regular algebras, Lecture Notes In Computer Science 1963 2000, s. 400–408.zobacz w PBN
• Mirosław Kowaluk i J Jaromczyk, The face-wise continuity in hot wire cutting of polyhedral sets, w: Proceedinngs 16th European Workshop on Computational Geometry, Ben Gurion University, Eilat, Israel, 2000.zobacz w PBN
• Jerzy Tyszkiewicz, Małgorzata Moczurad i Marek Zaionc, Statistical properties of simple types, Mathematical Structures In Computer Science 10 2000, s. 575–594.zobacz w PBN
• Jerzy Tiuryn, Dexter Kozen i David Harel, Dynamic Logic, The MIT Press, Cambridge, MA 2000.zobacz w PBN
• Anh Linh Nguyen, Constructing the Least Models for Positive Modal Logic Programs, Fundamenta Informaticae 42 (1) 2000, s. 29–60.zobacz w PBN
• Jerzy Tiuryn (red.), Proc. Foundations of Software Science and Computation Structures, Springer Verlag, Berlin 2000.zobacz w PBN

1999

• Sławomir Lasota, Coalgebra morphisms subsume open maps, Electronic Notes In Theoretical Computer Science 19 (Complete) 1999, s. 23–38.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, Algebraic Preliminaries, w: Algebraic Foundations of Systems Specification, Springer, 1999, s. 13–30.zobacz w PBN
• Hung Son Nguyen i Sinh Hoa Nguyen, Rough Sets and Association rule Generation, Fundamenta Informaticae 40 (4) 1999, s. 383–405.zobacz w PBN
• Damian Niwiński i Marek Witold Zawadowski, Logic, algebra, and computer science. Helena Rasiowa in memoriam., 1999.zobacz w PBN
• Andrzej Tarlecki, Institutions: An Abstract Framework for Formal Specifications, w: Algebraic Foundations of Systems Specification, Springer, 1999, s. 105–130.zobacz w PBN
• Anh Linh Nguyen, A New Space Bound for the Modal Logics K4, KD4 and S4, Lecture Notes In Computer Science 1672 1999, s. 321–331.zobacz w PBN
• Krzysztof Diks i Grzegorz Jakacki (red.), VI Olimpiada Informatyczna 1998/99, Komitet Główny Olimpiady Informatycznej, Warszawa 1999.zobacz w PBN
• P Doherty, J Kachniarz i Andrzej Szałas, Meta-queries on deductive databases, Fundamenta Informaticae 40 (1) 1999, s. 17–30.zobacz w PBN
• Anna Gambin i Adam Malinowski, Randomized Gossiping by Packets in Faulty Networks, Lecture Notes In Computer Science 1725 1999, s. 387–394.zobacz w PBN
• Anna Gambin, On Approximation of the Number of Bases of Exchange Preserving Matroids, Lecture Notes In Computer Science 1672 1999, s. 332–342.zobacz w PBN
• Jan Madey i Janina Mincer-Daszkiewicz, Wspomaganie tworzenia poprawnego oprogramowania w podejściu funkcyjnym, w: I Krajowa Konferencja Inżynierii Oprogramowania, Katedra Informatyki Politechniki Lubelskiej, Lublin 1999, s. 171–184.zobacz w PBN
• Andreas Nonnengart i Andrzej Szałas, A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, w: Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Springer Physica Verlag, 1999, s. 89–108.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Declarative PTIME Queries for Relational Databases using Quantifier Elimination, Journal Of Logic And Computation 9 (5) 1999, s. 737–758.zobacz w PBN
• Andreas Nonnengart, Hans Juergen Ohlbach i Andrzej Szałas, Elimination of Predicate Quantifiers, w: Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, 1999, s. 159–181.zobacz w PBN
• Donald Sannella i Andrzej Tarlecki, Algebraic Methods for Specification and Formal Development of Programs, Acm Computing Surveys 31 (3es) 1999, s. 10.zobacz w PBN

1998

• Sławomir Lasota, Weak Bisimilarity and Open Maps, Lecture Notes In Computer Science 1521 1998, s. 381–388.zobacz w PBN
• Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik i Andrzej Szałas, Wnioskowanie w logikach nieklasycznych. Automatyzacja wnioskowania, Akademicka Oficyna Wydawnicza, Warszawa 1998.zobacz w PBN
• Sławomir Lasota, Partial-Congruence Factorization of Bisimilarity Induced by Open Maps, Lecture Notes In Computer Science 1443 1998, s. 91–102.zobacz w PBN
• P. Doherty, Witold Łukaszewicz i Andrzej Szałas, General Domain Circumscription and its effective reductions, Fundamenta Informaticae Vol. 36, nr 1 1998, s. 23–55.zobacz w PBN
• Aleksy Schubert, Second-Order Unification and Type Inference for Church-Style Polymorphism, w: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '98), 1998, s. 279–288.zobacz w PBN
• Anna Gambin i Adam Malinowski, Randomized Meldable Priority Queues, Lecture Notes In Computer Science 1521 1998, s. 344–350.zobacz w PBN
• Krzysztof Diks i Grzegorz Jakacki (red.), V Olimpiada Informatyczna 1997/1998, Komitet Główny Olimpiady Informatycznej, Warszawa 1998.zobacz w PBN
• Henryk Michalewski, Game-theoretic approach to the hereditary Baire property of Cp(Nf), Bulletin Of The Polish Academy Of Sciences. Mathematics Vol. 46, no 2 1998, s. 135–140.zobacz w PBN

1997

• Sławomir Lasota, Open maps as a bridge between algebraic observational equivalence and bisimilarity, Lecture Notes In Computer Science 1376 1997, s. 285–299.zobacz w PBN
• Michal Iglewski i Janina Mincer-Daszkiewicz, Internal design of modules specified in the trace assertion method, Science Of Computer Programming 28 (2-3) 1997, s. 139–170.zobacz w PBN
• Aleksy Schubert, Linear Interpolation for the Higher-Order Matching Problem, w: TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings, 1997, s. 441–452.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Krzysztof Diks i Grzegorz Jakacki (red.), IV Olimpiada Informatyczna 1996/1997, Komitet Główny Olimpiady Informatycznej, Warszawa 1997.zobacz w PBN
• Stefan Kahrs, Donald Sannella i Andrzej Tarlecki, The definition of Extended ML: A gentle introduction, Theoretical Computer Science 173 1997, s. 445–484.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Computing Circumscription Revisited, Journal Of Automated Reasoning 18 (3) 1997, s. 297–336.zobacz w PBN

1996

• Anna Gambin i Sławomir Lasota, On the Semantics of Multistage Interconnection Networks, Lecture Notes In Computer Science 1996.zobacz w PBN
• Bogdan Chlebus, Anna Gambin i Piotr Indyk, Shared-Memory Simulation on a FaultyMemory DMM, Lecture Notes In Computer Science 1099 1996, s. 586–597.zobacz w PBN
• Wojciech Penczek i Andrzej Szałas (red.), Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, Springer, 1996.zobacz w PBN
• Marcin Benke, A logical approach to complexity bounds for subtype inequalities, w: Gödel'96: Logical foundations of mathematics, computer science and physics---Kurt Gödel's legacy, Brno, Czech Republic, August 1996, Springer Verlag, Berlin 1996, s. 195–204.zobacz w PBN
• Andrzej Szałas, On Natural Deduction in First-Order Fixpoint Logics, Fundamenta Informaticae 26 (1) 1996, s. 81–94.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae 28 (3-4) 1996, s. 261–271.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, General Domain Circumscription in its First-Order Reduction, w: Practical Reasoning, International Conference on Formal and Applied Practical Reasoning, FAPR '96, Bonn, Germany, June 3-7, 1996, Proceedings, Springer, 1996, s. 93–109.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Explaining Explanation Closure, w: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, Springer, 1996, s. 521–530.zobacz w PBN

1995

• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, Computing Circumscription Revisited: Preliminary Report, w: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, 1995, s. 1502–1508.zobacz w PBN
• Leonard Bolc i Andrzej Szałas (red.), Time and Logic. A Computational Approach, UCL Press Ltd., London 1995.zobacz w PBN
• Andrzej Szałas, Temporal Logic: A Standard Approach, w: Time and Logic. A Computational Approach, UCL Press Ltd., London 1995, s. 1–50.zobacz w PBN
• Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik i Andrzej Szałas, Wnioskowanie w logikach nieklasycznych. Podstawy teoretyczne, 1995.zobacz w PBN
• Henryk Michalewski i Roman Pol, On a Hurewicz-type theorem and a selection theorem of Michael, Bulletin Of The Polish Academy Of Sciences. Mathematics 43 (4) 1995, s. 273–275(1996).zobacz w PBN

1994

• Andrzej Szałas, Genetic Algorithms for Decision Problems, w: Proceedings of the 6th International Conference AIICSR, World Scientific Publishing, 1994, s. 383–390.zobacz w PBN
• Bogdan Chlebus, Anna Gambin i Piotr Indyk, PRAM Computations Resilient to Memory Faults, Lecture Notes In Computer Science 855 1994, s. 401–412.zobacz w PBN
• Andrzej Szałas, On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic, Journal Of Applied Non-classical Logics 4 (2) 1994, s. 119–127.zobacz w PBN

1993

• Andrzej Szałas, On the Correspondence between Modal and Classical Logic: An Automated Approach, Journal Of Logic And Computation 3 (6) 1993, s. 605–620.zobacz w PBN

1992

• Andrzej Szałas, Axiomatizing Fixpoint Logics, Information Processing Letters 41 (4) 1992, s. 175–180.zobacz w PBN
• Andrzej Szałas, Zarys dedukcyjnych metod automatycznego wnioskowania, Akademicka Oficyna Wydawnicza, Warszawa 1992.zobacz w PBN

1991

• Janina Mincer-Daszkiewicz, Program I/O behavior: models and their applications, Journal Of Systems And Software 14 (1) 1991, s. 51–62.zobacz w PBN
• Andrzej Szałas, On Strictly Arithmetical Completeness in Logics of Programs, Theoretical Computer Science 79 (2) 1991, s. 341–355.zobacz w PBN
• Andrzej Szałas i Jolanta Warpechowska, Loglan, WNT, Warszawa 1991.zobacz w PBN

1990

• Zbigniew Witold Jurkiewicz i Marek Jerzy Lao, Język programowania LISP, PWN, 1990.zobacz w PBN

1989

• Uwe Petermann i Andrzej Szałas, On Temporal Logic for Distributed Systems and Its Application to Processes Communicating by Interrupts, Fundamenta Informaticae 12 (2) 1989, s. 191–204.zobacz w PBN

1988

• Andrzej Szałas, An Incompleteness Result in Process Algebra, Information Processing Letters 29 (2) 1988, s. 67–70.zobacz w PBN
• Leszek Holenderski i Andrzej Szałas, Propositional Description of Finite Cause-Effect Structures, Information Processing Letters 27 (3) 1988, s. 111–117.zobacz w PBN
• Andrzej Szałas, Towards the Temporal Approach to Abstract Data Types, Fundamenta Informaticae 11 (1) 1988, s. 49–64.zobacz w PBN
• Leszek Holenderski i Andrzej Szałas, Incompleteness of First-Order Temporal Logic with Until, Theoretical Computer Science 57 1988, s. 317–325.zobacz w PBN

1987

• Jim R. Cunningham, Andreas Nonnengart i Andrzej Szałas, A Compositional Method for the Design and Proof of Asynchronous Processes, w: Proc. 4th. Annual Conf. ESPRIT'87, Part I, North-Holland, 1987, s. 566–580.zobacz w PBN
• Andrzej Szałas, A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time, Theoretical Computer Science 54 1987, s. 199–214.zobacz w PBN
• Andrzej Szałas, Arithmetical Axiomatization of First-Order Temporal Logic, Information Processing Letters 26 (3) 1987, s. 111–116.zobacz w PBN

1986

• Andrzej Szałas, Concerning the Semantic Consequence Relation in First-Order Temporal Logic, Theoretical Computer Science 47 (3) 1986, s. 329–334.zobacz w PBN

1985

• Janina Mincer-Daszkiewicz i Zbigniew Weiss, Reference String Sampling Method with Dynamically Changing Parameters, Performance Evaluation 5 (4) 1985, s. 257–269.zobacz w PBN
• Uwe Petermann i Andrzej Szałas, A Note on PCI - Distributed Processes Communicating by Interrupts, Acm Sigplan Notices 20 (3) 1985, s. 37–46.zobacz w PBN
• Andrzej Szałas i Danuta Szczepańska, Exception Handling in Parallel Computations, Acm Sigplan Notices 20 (10) 1985, s. 95–104.zobacz w PBN

1984

• Andrzej Szałas, On an Application of Algorithmic Theory of Stacks, Fundamenta Informaticae 7 (3) 1984, s. 378–388.zobacz w PBN
• Janina Mincer-Daszkiewicz i Zbigniew Weiss, An approach to program I/O reference behavior modeling, Performance Evaluation 4 (4) 1984, s. 261–273.zobacz w PBN

1981

• Andrzej Szałas, Algorithmmic Logic with Recursive Functions, Fundamenta Informaticae 4 (4) 1981, s. 975–995.zobacz w PBN