Publikacje

Czasopismo: Lecture Notes In Computer Science

Liczba publikacji: 407

2018

• Paweł Górecki, Alexey Markin i Oliver Eulenstein, Cophenetic Distances: A Near-Linear Time Algorithmic Framework, Lecture Notes In Computer Science 10976 (11) 2018, s. 168–179.zobacz w PBN
• Krzysztof Diks, Jerzy Czyżowicz, Jean Moussi i Wojciech Rytter, Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO 2018: 209-225, Lecture Notes In Computer Science 2018, s. 209–225.zobacz w PBN

2017

• Justyna Grudzińska i Marek Witold Zawadowski, Whence Long-Distance Indefinite Readings? Solving Chierchia’s Puzzle with Dependent Types, Lecture Notes In Computer Science 10148 2017, s. 37–53.zobacz w PBN
• Jarosław Andrzej Paszek i Paweł Górecki, New Algorithms for the Genomic Duplication Problem, Lecture Notes In Computer Science 10562 2017, s. 101–115.zobacz w PBN
• Paweł Górecki, Alexey Markin, Agnieszka Mykowiecka, Jarosław Andrzej Paszek i Oliver Eulenstein, Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees, Lecture Notes In Computer Science 10330 2017.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques, Lecture Notes In Computer Science 10167 2017, s. 217–227.zobacz w PBN

2016

• Paweł Górecki, Jarosław Andrzej Paszek i Agnieszka Mykowiecka, Mean Values of Gene Duplication and Loss Cost Functions, Lecture Notes In Computer Science 9683 2016, s. 189–199.zobacz w PBN
• Agnieszka Mykowiecka i Paweł Górecki, Bootstrapping Algorithms for Gene Duplication and Speciation Events, Lecture Notes In Computer Science 9702 2016, s. 106–118.zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks, Jean Mussi i Wojciech Rytter, Communication Problems for Mobile Agents Exchanging Energy, Lecture Notes In Computer Science 9988 2016, s. 275–288.zobacz w PBN
• Konrad Durnoga, Stefan Dziembowski, Maciej Zdanowicz, Michał Paweł Zając i Tomasz Piotr Kazana, Bounded-Retrieval Model with Keys Derived from Private Data, Lecture Notes In Computer Science 2016.zobacz w PBN

2015

• Mirosław Kowaluk i Gabriela Majewska, β-skeletons for a Set of Line Segments in R2, Lecture Notes In Computer Science 9210 2015, s. 65–78.zobacz w PBN
• Marcin Peczarski i Gerold Jäger, Playing several variants of mastermind with constant-size memory is not harder than with unbounded memory, Lecture Notes In Computer Science 8986 2015, s. 188–199.zobacz w PBN
• Arkadiusz Betkier, Paweł Szczęsny i Paweł Górecki, Fast Algorithms for Inferring Gene-Species Associations, Lecture Notes In Computer Science 9096 2015, s. 36–47.zobacz w PBN
• Lukasz Mikulski, Marcin Piątkowski i Wojciech Rytter, Square-Free Words over Partially Commutative Alphabets, Lecture Notes In Computer Science 8977 2015, s. 424–435.zobacz w PBN
• Soma Dutta i Piotr Wasilewski, Concept Synthesis Using Logic of Prototypes and Counterexamples: A Graded Consequence Approach, Lecture Notes In Computer Science 2015.zobacz w PBN

2014

• Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski i Qiang Zhang, Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets, Lecture Notes In Computer Science 2014.zobacz w PBN
• Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski i Piotr Sankowski, Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., Lecture Notes In Computer Science 2014.zobacz w PBN
• Marek Adamczyk, Piotr Sankowski i Qiang Zhang, Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching, Lecture Notes In Computer Science 2014.zobacz w PBN
• Sebastian Widz i Dominik Ślęzak, Attribute Subset Quality Functions over a Universe of Weighted Objects, Lecture Notes In Computer Science 8537 2014, s. 99–110.zobacz w PBN
• Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka i Tatiana Starikovskaya, Computing Minimal and Maximal Suffixes of a Substring Revisited, Lecture Notes In Computer Science 8486 2014, s. 30–39.zobacz w PBN
• Konrad Sakowski, Leszek Marcinkowski i Stanislaw Krukowski, Modification of the Newton's method for the simulations of gallium nitride semiconductor devices, Lecture Notes In Computer Science 8385 2014, s. 551–560.zobacz w PBN
• Tomasz Kociumaka, Tatiana Starikovskaya i Hjalte Wedel Vildhøj, Sublinear Space Algorithms for the Longest Common Substring Problem, Lecture Notes In Computer Science 8737 2014, s. 605–617.zobacz w PBN
• Volker Diekert, Artur Jeż i Wojciech Plandowski, Finding All Solutions of Equations in Free Groups and Monoids with Involuton, Lecture Notes In Computer Science 8476 2014, s. 1–15.zobacz w PBN
• Tomasz Kociumaka, Solon Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes In Computer Science 8486 2014, s. 192–201.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes In Computer Science 8633 2014, s. 215–226.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski i Wojciech Rytter, Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence, Lecture Notes In Computer Science 8486 2014, s. 202–211.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes In Computer Science 8889 2014, s. 220––232.zobacz w PBN
• Paweł Gora i Piotr Wasilewski, Adaptive System for Intelligent Traffic Management in Smart Cities., Lecture Notes In Computer Science 8610 2014, s. 525–536.zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes In Computer Science 8799 2014, s. 244–255.zobacz w PBN
• Maja Czoków i Jacek Miękisz, Influence of a topology of a spring network on its ability to learn mechanical behaviour, Lecture Notes In Computer Science 8384 2014, s. 412–422.zobacz w PBN
• Shih-Chieh Huang, Broderic Arneson, Ryan B. Hayward, Martin Müller i Jakub Pawlewicz, MoHex 2.0: A Pattern-Based MCTS Hex Player, Lecture Notes In Computer Science 8427 2014, s. 60–71.zobacz w PBN
• Jakub Pawlewicz i Ryan B. Hayward, Scalable Parallel DFPN Search, Lecture Notes In Computer Science 8427 2014, s. 138–150.zobacz w PBN
• Paweł Górecki, Jarosław Paszek i Eulenstein Oliver, Duplication Cost Diameters, Lecture Notes In Computer Science 8492 2014, s. 221–223.zobacz w PBN

2013

• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes In Computer Science 7810 2013, s. 383–394.zobacz w PBN
• Tomasz Kociumaka, Jakub Jan Radoszewski i Wojciech Rytter, Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Lecture Notes In Computer Science 8125 2013, s. 625–636.zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Lecture Notes In Computer Science 7922 2013, s. 177–188.zobacz w PBN
• Stefan Dziembowski, Tomasz Piotr Kazana i Maciej Obremski, Non-malleable Codes from Two-Source Extractors, Lecture Notes In Computer Science 2013.zobacz w PBN
• Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Lecture Notes In Computer Science 8283 2013, s. 547–557.zobacz w PBN
• Gabriela Majewska i Mirosław Kowaluk, New Sequential and Parallel Algorithms for Computing the β-Spectrum, Lecture Notes In Computer Science 2013, s. 210–224.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes In Computer Science 8214 2013, s. 84–95.zobacz w PBN

2012

• Jacek Miękisz i M. Matuszak, Stochastic techniques in Influence Diagrams for Learning Bayesian Network Structure, Lecture Notes In Computer Science 7552 2012, s. 33–40.zobacz w PBN
• Henryk Michalewski i Damian Niwiński, On Topological Completeness of Regular Tree Languages, Lecture Notes In Computer Science 2012, s. 165–179.zobacz w PBN
• Szczepan Hummel i Michał Skrzypczak, Topological Complexity of MSO+U and Related Automata Models, Lecture Notes In Computer Science 2012.zobacz w PBN
• Son Thanh Cao i Anh Linh Nguyen, Query-Subquery Nets, Lecture Notes In Computer Science 7653 (1) 2012, s. 239–248.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees, Lecture Notes In Computer Science 7292 2012, s. 115–126.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms, Lecture Notes In Computer Science 7434 2012, s. 531–542.zobacz w PBN
• Paweł Górecki, Gordon J. Burleigh i Oliver Eulenstein, GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches, Lecture Notes In Computer Science 7292 2012, s. 102–114.zobacz w PBN
• Paweł Górecki i Jerzy Tiuryn, Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model, Lecture Notes In Computer Science 7230 2012, s. 83–105.zobacz w PBN
• Michal Matuszak, Jacek Miękisz i Tomasz Schreiber, Solving Ramified Optimal Transport Problem in the Bayesian Influence Diagram Framework, Lecture Notes In Computer Science 7268 2012, s. 582–590.zobacz w PBN
• Mikołaj Bojańczyk i Sławomir Lasota, A machine-independent characterization of timed languages, Lecture Notes In Computer Science 7392 2012, s. 92–103.zobacz w PBN

2011

• Anh Linh Nguyen, Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALCI, Lecture Notes In Computer Science 6804 2011, s. 465–475.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, Lecture Notes In Computer Science 6638 2011, s. 336–341.zobacz w PBN
• Marcin Szczuka, The use of rough set methods in knowledge discovery in databases - Tutorial Abstract, Lecture Notes In Computer Science 6743 2011, s. 28–30.zobacz w PBN
• Anh Linh Nguyen, A Cut-Free ExpTime Tableau Decision Procedure for the Description Logic SHI, Lecture Notes In Computer Science 6922 2011, s. 572–581.zobacz w PBN
• Oskar Skibski, Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities, Lecture Notes In Computer Science 6982 2011, s. 130–142.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk i Jakub Onufry Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Lecture Notes In Computer Science 6755 2011, s. 449–461.zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen i Andrzej Szałas, On the Web Ontology Rule Language OWL 2 RL, Lecture Notes In Computer Science 6922 2011, s. 254–264.zobacz w PBN
• Andrzej Janusz i Sebastian Stawicki, Applications of approximate reducts to the feature selection problem, Lecture Notes In Computer Science 6954 2011, s. 45–50.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster Than 2n, Lecture Notes In Computer Science 6942 2011, s. 299–310.zobacz w PBN
• Patrick Doherty, Jacek Sroka, Andrzej Szałas i Tomasz Michalak, Contextual Coalitional Games, Lecture Notes In Computer Science 6521 2011, s. 65–78.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, A NIS-apriori based rule generator in prolog and its functionality for table data, Lecture Notes In Computer Science 6954 2011, s. 226–231.zobacz w PBN
• Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, s. 455–466.zobacz w PBN
• Hiroshi Sakai, Michinori Nakata i Dominik Ślęzak, A prototype system for rule generation in Lipski's incomplete information databases, Lecture Notes In Computer Science 6743 2011, s. 175–182.zobacz w PBN
• Jakub Radoszewski i Wojciech Rytter, Hamiltonian Paths in the Square of a Tree, Lecture Notes In Computer Science 7074 2011, s. 90–99.zobacz w PBN
• Jakob Rehof i Paweł Urzyczyn, Finite Combinatory Logic with Intersection Types, Lecture Notes In Computer Science 6690 2011, s. 169–183.zobacz w PBN
• Daryl H. Hepting, Richard Spring i Dominik Ślęzak, A rough set exploration of facial similarity judgements, Lecture Notes In Computer Science 6600 2011, s. 81–99.zobacz w PBN
• Marcin Kowalski, Dominik Ślęzak, Graham Toppin i Arkadiusz Wojna, Injecting Domain Knowledge into RDBMS - Compression of Alphanumeric Data Attributes, Lecture Notes In Computer Science 6804 2011, s. 386–395.zobacz w PBN
• Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, Lecture Notes In Computer Science 6661 2011, s. 350–363.zobacz w PBN
• Jacek Chrząszcz i Aleksy Schubert, The role of polymorphism in the characterisation of complexity by soft types, Lecture Notes In Computer Science 6907 2011, s. 219–230.zobacz w PBN
• Andrzej Skowron i Jarosław Stepaniuk, Approximations of functions: Toward rough granular calculus. In: Jingtao Yao, Sheela Ramanna, Guoyin Wang, Zbigniew Suraj (eds.), Lecture Notes In Computer Science 6954 2011, s. 712–721.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Strachocka i Rineke Verbrugge, Deliberation Dialogues during Multi-agent Planning, Lecture Notes In Computer Science 6804 2011, s. 170–181.zobacz w PBN
• Jacek Miękisz i Michał Matuszak, Smooth conditional transition paths in dynamical Gaussian networks, Lecture Notes In Computer Science 7006 2011, s. 204–215.zobacz w PBN
• Marcin Szczuka, Andrzej Janusz i Kamil Herba, Clustering of rough set related documents with use of knowledge from DBpedia, Lecture Notes In Computer Science 6954 2011, s. 394–403.zobacz w PBN
• Jakub Łącki i Piotr Sankowski, Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time, Lecture Notes In Computer Science 6942 2011, s. 155–166.zobacz w PBN
• Marcin Szczuka, Andrzej Janusz i Kamil Herba, Clustering of Rough Set Related Documents with Use of Knowledge from DBpedia. Jingtao Yao, Sheela Ramanna, Guoyin Wang, Zbigniew Suraj (eds.), Lecture Notes In Computer Science 6954 2011, s. 394–403.zobacz w PBN
• Wojciech Czerwiński, Piotr Hofman i Sławomir Lasota, Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes In Computer Science 6901 2011, s. 528–542.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, Comparators for compound object identification, Lecture Notes In Computer Science 6743 2011, s. 342–349.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Ildiko Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Lecture Notes In Computer Science 6986 2011, s. 131–142.zobacz w PBN
• Andrzej Janusz i Dominik Ślęzak, Ensembles of bireducts: towards robust classification and simple representation, Lecture Notes In Computer Science 7105 2011, s. 64–77.zobacz w PBN
• Robert Dąbrowski, Krzysztof Stencel i Grzegorz Timoszuk, Software Is a Directed Multigraph, Lecture Notes In Computer Science 6903 2011, s. 360–369.zobacz w PBN
• Hung Son Nguyen i Gloria Virginia, Investigating the Effectiveness of Thesaurus Generated Using Tolerance Rough Set Model. In: Marzena Kryszkiewicz, Henryk Rybiński, Andrzej Skowron, Zbigniew W. Raś (Eds.), Lecture Notes In Computer Science 6804 2011, s. 705–714.zobacz w PBN
• Aneta Szumowska, Marta Burzańska, Piotr Wiśniewski i Krzysztof Stencel, Efficient Implementation of Recursive Queries in Major Object Relational Mapping Systems, Lecture Notes In Computer Science 7105 2011, s. 78–89.zobacz w PBN
• Marcin Szczuka, Risk assessment in granular environments, Lecture Notes In Computer Science 6499 2011, s. 121–134.zobacz w PBN
• Jan Małuszyński i Andrzej Szałas, Living with Inconsistency and Taming Nonmonotonicity. Datalog Reloaded, Lecture Notes In Computer Science 6702 2011, s. 334–398.zobacz w PBN
• Dominik Ślęzak i Sebastian Widz, Rough-set-inspired feature subset selection, classifier construction, and rule aggregation, Lecture Notes In Computer Science 6954 2011, s. 81–88.zobacz w PBN
• Stefan Dziembowski i Sebastian Faust, Leakage-Resilient Cryptography from the Inner-Product Extractor., Lecture Notes In Computer Science 7073 2011, s. 702–721.zobacz w PBN
• Dominik Ślęzak, Andrzej Janusz, Wojciech Świeboda, Hung Son Nguyen i Jan G. Bazan, Semantic analytics of PubMed content, Lecture Notes In Computer Science 7058 2011, s. 63–74.zobacz w PBN
• Wojciech Jaworski, Hybridization of Rough Sets and Statistical Learning Theory, Lecture Notes In Computer Science 6499 2011, s. 39–55.zobacz w PBN
• Paweł Górecki i Oliver Eulenstein, A linear time algorithm for error-corrected reconciliation of unrooted gene trees, Lecture Notes In Computer Science 6674 2011, s. 148–159.zobacz w PBN
• Hung Son Nguyen i Adam Koper, Sequential Pattern Mining from Stream Data, Lecture Notes In Computer Science 7121 2011, s. 278–291.zobacz w PBN

2010

• Dominik Ślęzak i Sebastian Widz, Rough-Set-based classifier extraction and voting criteria are Applied together?, Lecture Notes In Computer Science 6086 2010, s. 187–196.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Lecture Notes In Computer Science 6031 2010, s. 227–238.zobacz w PBN
• Leszek Marcinkowski, A Balancing Domain Decomposition Method for a Discretization of a Plate Problem on Nonmatching Grids, Lecture Notes In Computer Science 6067 2010, s. 70–79.zobacz w PBN
• Barbara Klunder i Wojciech Rytter, Post Correspondence Problem with Partially Commutative Alphabets, Lecture Notes In Computer Science 6031 2010, s. 356–367.zobacz w PBN
• Maksymilian Dryja, Juan Galvis i Marcus Sarkis, N-N Solvers for a DG Discretization for Geometrically Nonconforming Substructures and Discontinuous Coefficients, Lecture Notes In Computer Science 78 2010, s. 27–39.zobacz w PBN
• Daria Walukiewicz-Chrząszcz i Jacek Chrząszcz, Inductive Consequences in the Calculus of Constructions, Lecture Notes In Computer Science 6172 2010, s. 450–465.zobacz w PBN
• Maksymilian Dryja i Marcus Sarkis, Technical Tools for Boundary Layers and Applications on Heterogeneous Coefficients, Lecture Notes In Computer Science 78 2010, s. 205–212.zobacz w PBN
• Krzysztof Stencel, Marta Burzańska, Patrycja Suchomska, Aneta Szumowska i Piotr Wiśniewski, Recursive Queries Using Object Relational Mapping, Lecture Notes In Computer Science 6485 2010, s. 42–50.zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Sum of Exponents of Runs in a String, Lecture Notes In Computer Science 6460 2010, s. 10–19.zobacz w PBN
• Marek Cygan, Łukasz Kowalik i Borut Luzar, A Planar Linear Arboricity Conjecture, Lecture Notes In Computer Science 6078 2010, s. 204–216.zobacz w PBN
• Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean Raskin i Szymon Toruńczyk, Energy and Mean-Payoff Games with Imperfect Information, Lecture Notes In Computer Science 6247 2010, s. 260–274.zobacz w PBN
• Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, s. 299–309.zobacz w PBN
• Anh Linh Nguyen, Paraconsistent and Approximate Semantics for the OWL 2 Web Ontology Language, Lecture Notes In Computer Science 6086 2010, s. 710–720.zobacz w PBN
• Marek Cygan, Łukasz Kowalik, Marcin Mucha, Marcin Pilipczuk i Piotr Sankowski, Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes In Computer Science 6346 2010, s. 72–83.zobacz w PBN
• Jakub Pawlewicz, Nearly Optimal Computer Play in Multi-player Yahtzee, Lecture Notes In Computer Science 6515 2010, s. 250–262.zobacz w PBN
• Mikołaj Bojańczyk i Paweł Parys, Efficient Evaluation of Nondeterministic Automata Using Factorization Forests, Lecture Notes In Computer Science 6198 2010, s. 515–526.zobacz w PBN
• Wojciech Jaworski, Recognition of Internet Portal Users on the Basis of Their Behaviour, Lecture Notes In Computer Science 6401 2010, s. 520–527.zobacz w PBN
• Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi i Piotr Sankowski, Online Network Design with Outliers, Lecture Notes In Computer Science 6198 2010, s. 114–126.zobacz w PBN
• Stefan Dziembowski, How to Pair with a Human, Lecture Notes In Computer Science 6280 2010, s. 200–218.zobacz w PBN
• Stefan Dziembowski, Leakage-Resilient Storage, Lecture Notes In Computer Science 6280 2010, s. 121–137.zobacz w PBN
• Jakub Radoszewski i Wojciech Rytter, Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup, Lecture Notes In Computer Science 5901 2010, s. 663–671.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, On the Correctness of Rough-Set Based Approximate Reasoning, Lecture Notes In Computer Science 6086 2010, s. 327–336.zobacz w PBN
• Krzysztof Diks i Piotr Stańczyk, Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time, Lecture Notes In Computer Science 5901 2010, s. 321–333.zobacz w PBN
• Pawel Delimata, Barbara Marszal-Paszek, Mikhail Moshkov, Paweł Paszek, Zbigniew Suraj i Andrzej Skowron, Comparison of some classification algorithms based on deterministic and nondeterministic decision rules, Lecture Notes In Computer Science 6190 2010, s. 90–105.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes In Computer Science 5901 2010, s. 296–307.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, An introduction to perception based computing. Proceedings of the Future Generation Information Technology - Second International Conference (FGIT 2010), Jeju Island, Korea, December 13-15, 2010, Lecture Notes In Computer Science 6485 2010, s. 12–25.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes In Computer Science 6393 2010, s. 258–269.zobacz w PBN
• Mikhail Moshkov, Zbigniew Suraj i Andrzej Skowron, Irreducible descriptive sets of attributes for information systems, Lecture Notes In Computer Science 5946 2010, s. 92–105.zobacz w PBN
• Andrzej Skowron, Discovery of processes and their interactions from data and domain knowledge. Proceedings of the 4th KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2010), Gdynia, Poland, June 23-25, 2010, Part I, Lecture Notes In Computer Science 6070 2010, s. 12–21.zobacz w PBN
• Marcin Kamiński i Łukasz Kowalik, Approximating the Maximum 3- and 4-Edge-Colorable Subgraph, Lecture Notes In Computer Science 6139 2010, s. 395–407.zobacz w PBN
• Jakub Onufry Wojtaszczyk, Marek Adam Cygan, Marcin Łukasz Pilipczuk i Michał Pilipczuk, An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion, Lecture Notes In Computer Science (6478) 2010, s. 95–106.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Approximations and classifiers. Proceedings of the 7th International Conference Rough Sets and Current Trends in Computing (RSCTC 2010), Warsaw, Poland, June 28-30, 2010, Lecture Notes In Computer Science 6086 2010, s. 730–739.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Three-Valued Paraconsistent Reasoning for Semantic Web Agents, Lecture Notes In Computer Science 6070 2010, s. 152–162.zobacz w PBN

2009

• Katarzyna Paluch, Marcin Mucha i Aleksander Madry, A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem, Lecture Notes In Computer Science 5687 2009, s. 298–311.zobacz w PBN
• Dominik Ślęzak i Marcin Kowalski, Intelligent data granulation on load: Improving infobright's knowledge grid, Lecture Notes In Computer Science 5899 2009, s. 12–25.zobacz w PBN
• Mikołaj Bojańczyk i Tomasz Idziaszek, Algebra for Infinite Forests with an Application to the Temporal Logic EF, Lecture Notes In Computer Science 5710 2009, s. 131–145.zobacz w PBN
• Daryl H. Hepting, Timothy Maciag, Richard Spring, Katherine Arbuthnott i Dominik Ślęzak, A rough sets approach for personalized support of face recognition, Lecture Notes In Computer Science 5908 2009, s. 201–208.zobacz w PBN
• Wojciech Czerwiński, Sibylle B. Fröschle i Sławomir Lasota, Partially-Commutative Context-Free Processes, Lecture Notes In Computer Science 5710 2009, s. 259–273.zobacz w PBN
• Hiroshi Sakai, Kohei Hayashi, Michinori Nakata i Dominik Ślęzak, The lower system, the upper system and rules with stability factor in non-deterministic information systems, Lecture Notes In Computer Science 5908 2009, s. 313–320.zobacz w PBN
• Jacques Duparc, Alessandro Facchini i Filip Murlak, Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata, Lecture Notes In Computer Science 5771 2009, s. 225–239.zobacz w PBN
• Bartosz Klin, Structural operational semantics for weighted transition systems, Lecture Notes In Computer Science 5700 2009, s. 121–139.zobacz w PBN
• Mikołaj Bojańczyk, Algebra for Tree Languages, Lecture Notes In Computer Science 5771 2009, s. 1.zobacz w PBN
• Till Mossakowski i Andrzej Tarlecki, Heterogeneous Logical Environments for Distributed Specifications, Lecture Notes In Computer Science 5486 2009, s. 266–289.zobacz w PBN
• Aleksy Schubert, The Existential Fragment of the One-Step Parallel Rewriting Theory, Lecture Notes In Computer Science 5595 2009, s. 78–92.zobacz w PBN
• Markku Laine i Wojciech Plandowski, Word equations with one unknown, Lecture Notes In Computer Science 5583 2009, s. 348–359.zobacz w PBN
• Paweł Urzyczyn, Inhabitation of Low-Rank Intersection Types, Lecture Notes In Computer Science 5608 2009, s. 356–370.zobacz w PBN
• Aleksy Schubert, Jacek Chrząszcz i Marieke Huisman, BML and Related Tools, Lecture Notes In Computer Science 5751 2009, s. 278–297.zobacz w PBN
• Ken-etsu Fujita i Aleksy Schubert, Existential Type Systems with No Types in Terms, Lecture Notes In Computer Science 5608 2009, s. 112–126.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC, Lecture Notes In Computer Science 5796 2009, s. 473–488.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes In Computer Science 5664 2009, s. 471–482.zobacz w PBN
• Alicja Szałas i Andrzej Szałas, Paraconsistent Reasoning with Words, Lecture Notes In Computer Science 5070 2009, s. 43–58.zobacz w PBN
• Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Subwords in a String, Lecture Notes In Computer Science 5874 2009, s. 345–355.zobacz w PBN
• Mikołaj Bojańczyk, Factorization Forests, Lecture Notes In Computer Science 5583 2009, s. 1–17.zobacz w PBN
• Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, LPF Computation Revisited, Lecture Notes In Computer Science 5874 2009, s. 158–169.zobacz w PBN
• Paweł Parys i Igor Walukiewicz, Weak Alternating Timed Automata, Lecture Notes In Computer Science 5555 2009, s. 273–284.zobacz w PBN
• Wojciech Jaworski, Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects, Lecture Notes In Computer Science 5084 2009, s. 116–145.zobacz w PBN
• Rok Erman, Łukasz Kowalik, Matjaz Krnc i Tomasz Waleń, Improved Induced Matchings in Sparse Graphs, Lecture Notes In Computer Science 5917 2009, s. 134–148.zobacz w PBN
• Marta Burzańska, Krzysztof Stencel i Piotr Wiśniewski, Pushing Predicates into Recursive SQL Common Table Expressions, Lecture Notes In Computer Science 5739 2009, s. 194–205.zobacz w PBN
• Andrzej Jankowski, Andrzej Skowron i Marcin Szczuka, Interactive granular computing in rightly judging systems, Lecture Notes In Computer Science 5589 2009, s. 1–16.zobacz w PBN
• Linh Anh Nguyen i Andrzej Szałas, A Tableau Calculus for Regular Grammar Logics with Converse, Lecture Notes In Computer Science 5663 2009, s. 421–436.zobacz w PBN
• Andrzej Skowron, Jan Bazan i Marcin Wojnarski, Interactive rough-granular computing in pattern recognition, Lecture Notes In Computer Science 5909 2009, s. 92–97.zobacz w PBN

2008

• Johann A. Makowsky i Damian Niwiński, The Ackermann Award 2008, Lecture Notes In Computer Science 5213 2008, s. 508–512.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
• 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
• 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
• 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
• 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
• 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
• 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
• Piotr Sankowski, Algebraic Graph Algorithms, Lecture Notes In Computer Science 5162 2008, s. 68–82.zobacz w PBN
• Mikhail Moshkov, Andrzej Skowron i Zbigniew Suraj, Extracting relevant information about reduct sets from data tables, Lecture Notes In Computer Science 5390 2008, s. 200–211.zobacz w PBN
• Wojciech Jaworski, Rule Induction: Combining Rough Set and Statistical Approaches, Lecture Notes In Computer Science 5306 2008, s. 170–180.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
• 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
• 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
• Paweł Delimata, Mikhail Ju Moshkov, Andrzej Skowron i Zbigniew Suraj, Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules, Lecture Notes In Computer Science 5009 2008, s. 55–62.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
• 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
• M. Ju. Moshkov, Andrzej Skowron i Zbigniew Suraj, On Irreducible Descriptive Sets of Attributes for Information Systems, Lecture Notes In Computer Science Vol. 5306 2008, s. 21–30.zobacz w PBN
• Mikhail Mikhail Moshkov, Andrzej Skowron i Zbigniew Suraj, On irreducible descriptive sets of attributes for information systems, Lecture Notes In Computer Science 5306 2008, s. 21–30.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
• Paweł Delimata, Mikhail Ju. Moshkov, Andrzej Skowron i Zbigniew Suraj, Lazy classification algorithms based on deterministic and inhibitory decision rules, Lecture Notes In Computer Science 5009 2008, s. 1773–1778.zobacz w PBN
• Mikołaj Bojańczyk, Tree-Walking Automata, Lecture Notes In Computer Science 5196 2008, s. 1–2.zobacz w PBN
• Marcin Szczuka, Towards approximation of risk, Lecture Notes In Computer Science 5306 2008, s. 320–328.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
• 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

2007

• 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
• 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
• 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
• 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
• Juhani Karhumaki, Yury Lifshits i Wojciech Rytter, Tiling Periodicity, Lecture Notes In Computer Science 4580 2007, s. 295–306.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
• 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
• 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
• 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
• Leszek Aleksander Kołodziejczyk i Neil Thapen, The polynomial and linear hierarchies in $V^0$, Lecture Notes In Computer Science 4497 2007, s. 408–415.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
• Eryk Kopczyński, Omega-Regular Half-positional winning conditions, Lecture Notes In Computer Science 4646 2007, s. 41–53.zobacz w PBN
• Andrzej Skowron, Discovery of Process Models from Data and Domain Knowledge: A Rough-Granular Approach, Lecture Notes In Computer Science 4815 2007, s. 192–197.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
• 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
• Andrzej Jankowski i Andrzej Skowron, A Wistech Paradigm for Intelligent Systems, Lecture Notes In Computer Science 4374 2007, s. 94–132.zobacz w PBN
• Andrzej Tarlecki, Toward specifications for reconfigurable component systems, Lecture Notes In Computer Science 4546 2007, s. 24–28.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
• Mikhail Moshkov, Andrzej Skowron i Zbigniew Suraj, On Covering Attribute Sets by Reducts, Lecture Notes In Computer Science 4585 2007, s. 175–180.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
• 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
• Andrzej Skowron i Jarosław Stepaniuk, Modeling of High Quality Granules, Lecture Notes In Computer Science 4585 2007, s. 300–309.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
• Mikołaj Bojańczyk, Forest Expressions, Lecture Notes In Computer Science 4646 2007, s. 146–160.zobacz w PBN
• Andrzej Jankowski i Andrzej Skowron, Toward Rough-Granular Computing, Lecture Notes In Computer Science 4482 2007, s. 1–12.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
• Paweł Delimata, Mikhail Moshkov, Andrzej Skowron i Zbigniew Suraj, Two Families of Classification Algorithms, Lecture Notes In Computer Science 4482 2007, s. 297–304.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
• Sheela Ramanna, Andrzej Skowron i James Peters, Approximation Space-Based Socio-Technical Conflict Model, Lecture Notes In Computer Science 4481 2007, s. 476–483.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
• Andrzej Jankowski i Andrzej Skowron, Toward Perception - Based Computing; A Rough-Granular perspective, Lecture Notes In Computer Science 4845 2007, s. 122–142.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
• 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
• Anna Gambin i Ewa Szczurek, No-regret boosting, Lecture Notes In Computer Science 4431 2007, s. 422–431.zobacz w PBN
• 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
• 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
• Sinh Hoa Nguyen i Hung Son Nguyen, Hierarchical Rough Classifiers, Lecture Notes In Computer Science 4585 2007, s. 40–50.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
• 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

• Jan Bazan, Piotr Kruczek, Stanisława Bazab-Socha, Andrzej Skowron i Jacek Pietrzyk, Automatic Planning of Treatment of Infants with Respiratory Failure Through Rough Set Modeling, Lecture Notes In Computer Science 4259 2006, s. 418–427.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
• 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
• 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
• 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
• 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
• 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
• Don Sannella i Andrzej Tarlecki, Horizontal composability revisited, Lecture Notes In Computer Science 4060 2006, s. 296–316.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
• 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
• 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
• 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
• 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
• 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
• 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
• Eryk Kopczyński, Half-Positional Determinacy of Infinite Games, Lecture Notes In Computer Science 4052 2006, s. 336–347.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
• 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
• Łukasz Kowalik, Improved Edge Coloring with Three Colors, Lecture Notes In Computer Science 4271 2006, s. 90–101.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
• 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
• Ł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
• 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
• 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
• 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
• Damian Wójtowicz i Jerzy Tiuryn, On genome evolution with innovation, Lecture Notes In Computer Science 4162 2006, s. 801–811.zobacz w PBN
• Jan Bazan, Andrzej Skowron i Roman Swiniarski, Rough Sets and Vague Concept Approximation: From Sample Approximation to Adaptive Learning, Lecture Notes In Computer Science 4100 2006, s. 39–62.zobacz w PBN
• Wojciech Jaworski, Learning Compound Decision Functions for Sequential Data in Dialog with Experts, Lecture Notes In Computer Science 4259 2006, s. 627–636.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
• Andrzej Skowron, Hui Wang, Arkadiusz Wojna i Jan Bazan, Multimodal Classification: Case Studies, Lecture Notes In Computer Science 4100 2006, s. 224–239.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
• 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
• Andrzej Skowron, Sheela Ramanna i James F. Peters, Conflict Analysis and Information Systems: A Rough Set Approach, Lecture Notes In Computer Science 4062 2006, s. 233–240.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
• 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
• Mikhail Moshkov, Andrzej Skowron i Zbigniew Suraj, On Testing Membership to Maximal Consistent Extensions of Information Systems, Lecture Notes In Computer Science 4259 2006, s. 85–90.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
• Stefan Dziembowski, On Forward-Secure Storage, Lecture Notes In Computer Science 4117 2006, s. 251–270.zobacz w PBN
• Andrzej Skowron i Piotr Synak, Planning Based on Reasoning About Information Changes, Lecture Notes In Computer Science 4259 2006, s. 165–173.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
• Stefan Dziembowski, Intrusion-Resilience Via the Bounded-Storage Model, Lecture Notes In Computer Science 3876 2006, s. 207–224.zobacz w PBN
• Sheela Ramanna, James Peters i Andrzej Skowron, Generalized Conflict and Resolution Model with Approximation Spaces, Lecture Notes In Computer Science 4259 2006, s. 274–283.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
• 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

2005

• Jan Bazan i Marcin Szczuka, The rough set exploration system, Lecture Notes In Computer Science 3400 2005, s. 37–56.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
• 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
• 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
• 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
• 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
• 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, A flexible grid infrastructure for data analysis, Lecture Notes In Computer Science 3528 2005, s. 480–485.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
• 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
• Tomasz Pieciukiewicz, Krzysztof Stencel i Kazimierz Subieta, Usable Recursive Queries, Lecture Notes In Computer Science 3631 2005, s. 17–28.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
• 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
• 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
• Piotr Wasilewski, Concept Lattices vs. Approximation Spaces, Lecture Notes In Computer Science 1 (3641) 2005, s. 114–123.zobacz w PBN
• Sławomir Lasota i Sibylle Froeschle, Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP, Lecture Notes In Computer Science 3653 2005, s. 263–277.zobacz w PBN
• 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
• Andrzej Skowron, Roman Świniarski i Piotr Synak, Approximation spaces and information granulation, Lecture Notes In Computer Science 3400 2005, s. 175–189.zobacz w PBN
• Sławomir Lasota i Igor Walukiewicz, Alternating Timed Automata, Lecture Notes In Computer Science 3441 2005, s. 250–265.zobacz w PBN
• Jan Hidders, Natalia Kwasnikowska, Sławomir Lasota, Jacek Sroka, Jerzy Tyszkiewicz i Jan Van den Bussche, Petri Net + Nested Relational Calculus = Dataflow, Lecture Notes In Computer Science 3760 2005, s. 220–237.zobacz w PBN
• Andrzej Skowron, Jarosław Stepaniuk i Roman Swiniarski, Approximation spaces in machine learning and pattern recognition, Lecture Notes In Computer Science 3776 2005, s. 750–755.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
• Andrzej Skowron, Rough sets in perception-based computing (keynote talk), Lecture Notes In Computer Science 3776 2005, s. 21–29.zobacz w PBN
• Anh Linh Nguyen, On Modal Deductive Databases, Lecture Notes In Computer Science 3631 2005, s. 43–57.zobacz w PBN
• Jan Bazan i Andrzej Skowron, On-line elimination of non-relevant parts of complex objects in behaviora pattern identification, Lecture Notes In Computer Science 3776 2005, s. 720–725.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
• 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
• Andrzej Skowron i R. Swiniarski, Rough sets and higher order vaguencess, Lecture Notes In Computer Science 3641 2005, s. 33–42.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
• Andrzej Skowron i Piotr Synak, Hierarchical information maps, Lecture Notes In Computer Science 3641 2005, s. 622–631.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
• Andrzej Skowron i Jarosław Stepaniuk, Ontological framework for approximation, Lecture Notes In Computer Science 3641 2005, s. 718–727.zobacz w PBN
• Piotr Sankowski, Shortest Paths in Matrix Multiplication Time, Lecture Notes In Computer Science 3669 2005, s. 770–778.zobacz w PBN
• Andrzej Skowron, Hui Wang, Arkadiusz Wojna i Jan Bazan, A hierarchical approach to multimode classification, Lecture Notes In Computer Science 3642 2005, s. 119–127.zobacz w PBN
• Wojciech Jaworski, Model Selection and Assessment for Classification Using Validation, Lecture Notes In Computer Science 3641 2005, s. 481–490.zobacz w PBN
• Piotr Sankowski, Subquadratic Algorithm for Dynamic Shortest Distances, Lecture Notes In Computer Science 3595 2005, s. 461–470.zobacz w PBN
• Jan Bazan, James Peters i Andrzej Skowron, Behavioral pattern identification through rough sets modelling, Lecture Notes In Computer Science 3642 2005, s. 688–697.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
• 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
• 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
• 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

2004

• Andrzej Skowron i J. Stepaniuk, Constrained sums of information systems; S. Tsumoto et al. (Eds.): Rough sets current trends in computing, RSCTC 2004., Lecture Notes In Computer Science 3066 2004, s. 298–307.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
• Andrzej Skowron i Arkadiusz Wojna, K nearest neighbor classification with local induction, S. Tsumoto et al. (Eds.): Rough sets current trends in computing, RSCTC 2004, Lecture Notes In Computer Science 3066 2004, s. 225–230.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
• 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
• 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
• 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
• 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
• Andrzej Skowron, Roman Świniarski i Piotr Synak, Approximation Spaces and Information Granulation, Lecture Notes In Computer Science 3066 2004, s. 116–126.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
• 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
• 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
• Laszlo Gulyas i Tadeusz Płatkowski, On evolutionary 3-person Prisoners Dilemma games on 2-D lattice, Lecture Notes In Computer Science 3305 2004, s. 831–840.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
• 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
• Anh Linh Nguyen, The Modal Logic Programming System MProlog, Lecture Notes In Computer Science 3229 2004, s. 266–278.zobacz w PBN
• Roman Swiniarski i Andrzej Skowron, Independent Component Analysis, Principal Component Analysis and Rough Sets in Face Recognition, Lecture Notes In Computer Science 3100 2004, s. 403–416.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
• 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
• 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
• 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
• 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
• 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
• Mikołaj Bojańczyk, A Bounding Quantifier, Lecture Notes In Computer Science 3210 2004, s. 41–55.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
• Wojciech Jaworski, A Note on the Regularization Algorithm, Lecture Notes In Computer Science 3066 2004, s. 235–243.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
• Aleksy Schubert, On the Building of Affine Retractions, Lecture Notes In Computer Science 3210 2004, s. 205–219.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
• 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
• Jacek Chrząszcz, Modules in Coq Are and Will Be Correct, Lecture Notes In Computer Science 3085 2004, s. 130–146.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

2003

• 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
• 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
• 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
• Mikołaj Bojańczyk, 1-Bounded TWA Cannot Be Determinized, Lecture Notes In Computer Science 2914 2003, s. 62–73.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
• 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 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
• Łukasz Kowalik, Short Cycles in Planar Graphs, Lecture Notes In Computer Science 2880 2003, s. 284–296.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
• 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
• Wojciech Plandowski, Test Sets for Large Families of Languages, Lecture Notes In Computer Science 2710 2003, s. 75–94.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
• Andrzej Skowron, James F Peters, Piotr Synak i Sheela Ramanna, Rough sets and information granulation, Lecture Notes In Computer Science 2715 2003, s. 370–377.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
• Andrzej Skowron i J Peters, Rough sets: Trends and challenges (plenary talk), Lecture Notes In Computer Science 2639 2003, s. 25–34.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
• Andrzej Skowron i Piotr Synak, Reasoning based on information changes in information maps, Lecture Notes In Computer Science 2639 2003, s. 229–236.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
• Andrzej Skowron i T Nguyen, Rough set approach to domain knowledge approximation, Lecture Notes In Computer Science 2639 2003, s. 221–228.zobacz w PBN

2002

• 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
• 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
• 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
• 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
• Sławomir Lasota, Decidability of strong bisimilarity for timed BPP, Lecture Notes In Computer Science 2421 2002, s. 562–578.zobacz w PBN
• Damian Niwiński, Mu-calculus via games, Lecture Notes In Computer Science 2471 2002, s. 27–43.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
• 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
• J Peters, Andrzej Skowron i J Stepaniuk, Rough neurocomputing based on hierarchical classfiers, Lecture Notes In Computer Science 2475 2002, s. 308–315.zobacz w PBN
• Marcin Peczarski, Sorting 13 Elements Requires 34 Comparisons, Lecture Notes In Computer Science 2461 2002, s. 785–794.zobacz w PBN
• Andrzej Skowron i Piotr Synak, Patterns in information maps, Lecture Notes In Computer Science 2475 2002, s. 453–460.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
• M Borkowski, J Peters, W Rzęsa, Andrzej Skowron i Z Suraj, Measures on inclusion and closeness of information granules: a rough set approach, Lecture Notes In Computer Science 2475 2002, s. 300–307.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
• 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
• 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
• 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
• 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
• 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
• Hung Son Nguyen, Scalable classification mathod based on rough sets, Lecture Notes In Computer Science 2475 2002, s. 433–440.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, J. Goubault-Larrecq i D. Nowak, Logical Relations for Monadic Types, Lecture Notes In Computer Science 2471 2002, s. 553–568.zobacz w PBN

2001

• 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
• Aleksy Schubert, The complexity of beta-Reduction in low orders, Lecture Notes In Computer Science (2044) 2001, s. 400–414.zobacz w PBN
• 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
• j Peters, Andrzej Skowron, S Ramanna i M Borkowski, Wireless agent guidance of remote mobile robots: Rough integral approach to sensor signal analysis, Lecture Notes In Computer Science 2198 2001, s. 413–422.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 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• Ewa Madalińska-Bugaj i Witold Łukaszewicz, Lazy knowledge base update, Lecture Notes In Computer Science (2070) 2001, s. 61–70.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

2000

• 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
• 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
• 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
• 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
• Sławomir Lasota, Behavioural constructor implementation for regular algebras, Lecture Notes In Computer Science 1955 2000, s. 54–69.zobacz w PBN
• Sławomir Lasota, Finitary observations in regular algebras, Lecture Notes In Computer Science 1963 2000, s. 400–408.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
• Aleksy Schubert, Type inference for first order logic, Lecture Notes In Computer Science 1784 2000, s. 297–314.zobacz w PBN

1999

• 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
• 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

1998

• Sławomir Lasota, Weak Bisimilarity and Open Maps, Lecture Notes In Computer Science 1521 1998, s. 381–388.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
• Anna Gambin i Adam Malinowski, Randomized Meldable Priority Queues, Lecture Notes In Computer Science 1521 1998, s. 344–350.zobacz w PBN
• Wiktor Bartol, X. Caicedo i F. Rossello, Syntactical content of finite approximations of partial algebras. Rough sets and current trends in computing (Warsaw, 1998), Lecture Notes In Computer Science (1424) 1998, s. 408–415.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

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

1994

• 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