Publikacje

Czasopismo: Lecture Notes in Computer Science

Liczba publikacji: 312

2022

• Jerzy Tiuryn , Natalia Rutecka, Paweł Górecki , Rooting Gene Trees via Phylogenetic Networks, Lecture Notes in Computer Science, The 28th International Computing and Combinatorics Conference, Shenzen, China, 22 października 2022 - 24 października 2022, 13595 2022. Zobacz w PBN

2021

• Andrzej Szałas , Many-Valued Dynamic Object-Oriented Inheritance and Approximations, Lecture Notes in Computer Science, International Joint Conference on Rough Sets IJCRS 2021, Bratislava, Slovakia, 19 września 2021 - 24 września 2021, 12872 2021, s. 103-119. Zobacz w PBN

2020

• Michał Pilipczuk , Computing Tree Decompositions, Lecture Notes in Computer Science, 2020, s. 189-213. Zobacz w PBN

2019

• Barbara Rychalska, Dominika Basaj, Alicja Gosiewska, Przemysław Biecek , Models in the Wild: On Corruption Robustness of Neural NLP Systems, Lecture Notes in Computer Science, 26th International Conference on Neural Information Processing, Sydney, Australia, 12 grudnia 2019 - 15 grudnia 2019. Zobacz w PBN
• Paweł Rzążewski , Karolina Okrasa, Subexponential algorithms for variants of homomorphism problem in string graphs, Lecture Notes in Computer Science, 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019), Vall de Núria, Spain, 19 czerwca 2019 - 21 czerwca 2019. Zobacz w PBN

2017

• Paweł Górecki , Jarosław Paszek , New Algorithms for the Genomic Duplication Problem, Lecture Notes in Computer Science, RECOMB International Workshop on Comparative Genomics, Barcelona, Spain, 10562 2017, s. 101-115. Zobacz w PBN

2016

• Paweł Górecki , Agnieszka Mykowiecka, Bootstrapping Algorithms for Gene Duplication and Speciation Events, Lecture Notes in Computer Science, Algorithms for Computational Biology, Trujillo, Spain, 21 czerwca 2016 - 22 czerwca 2016. Zobacz w PBN
• Konrad Durnoga, Stefan Dziembowski , Tomasz Kazana , Michał Zając, Maciej Zdanowicz, Bounded-Retrieval Model with Keys Derived from Private Data, Lecture Notes in Computer Science, 2016. Zobacz w PBN
• Jerzy Czyżowicz, Krzysztof Diks , Jean Mussi, Wojciech Rytter , Communication Problems for Mobile Agents Exchanging Energy, Lecture Notes in Computer Science, Structural Information and Communication Complexity, 2016. Zobacz w PBN
• Konrad Sakowski , Leszek Marcinkowski , Paweł Strąk, Paweł Kempisty, Stanisław Krukowski, Discretization of the Drift-Diffusion Equations with the Composite Discontinuous Galerkin Method, Lecture Notes in Computer Science, 11th International Conference on Parallel Processing and Applied Mathematics, Kraków, Poland, 6 września 2015 - 9 września 2015, 9574 2016, s. 391-400. Zobacz w PBN
• Paweł Górecki , Jarosław Paszek , Agnieszka Mykowiecka, Mean Values of Gene Duplication and Loss Cost Functions, Lecture Notes in Computer Science, International Symposium on Bioinformatics Research and Applications, 5 czerwca 2016 - 8 czerwca 2016. Zobacz w PBN

2015

• Arkadiusz Betkier, Paweł Górecki , Paweł Szczęsny, Fast Algorithms for Inferring Gene-Species Associations, Lecture Notes in Computer Science, International Symposium on Bioinformatics Research and Applications, Norfolk, the United States of America, 7 czerwca 2015 - 10 czerwca 2015. Zobacz w PBN
• Lukasz Mikulski, Marcin Piątkowski, Wojciech Rytter , Square-Free Words over Partially Commutative Alphabets, Lecture Notes in Computer Science, Language and Automata Theory and Applications 2015, Spain, 2015. Zobacz w PBN
• Mirosław Kowaluk , Gabriela Majewska, β-skeletons for a Set of Line Segments in R2, Lecture Notes in Computer Science, 20th International Symposium on Fundamentals of Computation Theory, Gdańsk, Poland, 17 sierpnia 2015 - 19 sierpnia 2015, 9210 2015, s. 65-78. Zobacz w PBN

2014

• Sebastian Widz, Dominik Ślęzak , Attribute Subset Quality Functions over a Universe of Weighted Objects, Lecture Notes in Computer Science, Rough Sets and Intelligent Systems Paradigms - Second International Conference, Spain, 9 lipca 2014 - 13 lipca 2014. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence, Lecture Notes in Computer Science, Combinatorial Pattern Matching, Moskwa, the Russian Federation, 16 czerwca 2014 - 18 czerwca 2014. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes in Computer Science, Algorithms and Computation - 25th International Symposium, Jeonju, the Republic of Korea, 17 grudnia 2014 - 19 grudnia 2014. Zobacz w PBN
• Paweł Górecki , Jarosław Paszek , Eulenstein Oliver, Duplication Cost Diameters, Lecture Notes in Computer Science, International Symposium on Bioinformatics Research and Applications, China, 2014. Zobacz w PBN
• Marek Adamczyk, Piotr Sankowski , Qiang Zhang, Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching, Lecture Notes in Computer Science, 7th International Symposium on Algorithmic Game Theory, 2014. Zobacz w PBN
• Tomasz Kociumaka, Solon Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes in Computer Science, Combinatorial Pattern Matching, Moskwa, the Russian Federation, 16 czerwca 2014 - 18 czerwca 2014. Zobacz w PBN
• Volker Diekert, Artur Jeż, Wojciech Plandowski , Finding All Solutions of Equations in Free Groups and Monoids with Involuton, Lecture Notes in Computer Science, 9th International Computer Science Symposium in Russia, the Russian Federation, 2014. Zobacz w PBN
• Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski , Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., Lecture Notes in Computer Science, 13th International Symposium on Experimental Algorithms, 2014. Zobacz w PBN
• Maja Czoków, Jacek Miękisz , Influence of a topology of a spring network on its ability to learn mechanical behaviour, Lecture Notes in Computer Science, 2014. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes in Computer Science, Developments in Language Theory, Ekaterinburg, the Russian Federation, 26 sierpnia 2014 - 29 sierpnia 2014. Zobacz w PBN
• Stanisław Krukowski, Leszek Marcinkowski , Konrad Sakowski , Modification of the Newton's method for the simulations of gallium nitride semiconductor devices, Lecture Notes in Computer Science, 10th International Conference on Parallel Processing&Applied Mathematics, Warszawa, Poland, 8 września 2013 - 11 września 2013. Zobacz w PBN
• Shih-Chieh Huang, Broderic Arneson, Ryan B. Hayward, Martin Müller, Jakub Pawlewicz , MoHex 2.0: A Pattern-Based MCTS Hex Player, Lecture Notes in Computer Science, 8th International Conference, Computer and Games 2013, Yokohama, Japan, 15 sierpnia 2013 - 17 sierpnia 2013, 8427 2014, s. 60-71. Zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes in Computer Science, String Processing and Information Retrieval, Ouro Preto, Brazil, 20 października 2014 - 22 października 2014. Zobacz w PBN
• Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski , Qiang Zhang, Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets, Lecture Notes in Computer Science, 10th International Conference on Web and Internet Economics, 2014. Zobacz w PBN
• Jakub Pawlewicz , Ryan B. Hayward, Scalable Parallel DFPN Search, Lecture Notes in Computer Science, 8th International Conference, Computer and Games 2013, Yokohama, Japan, 15 sierpnia 2013 - 17 sierpnia 2013, 8427 2014, s. 138-150. Zobacz w PBN

2013

• Peter Floderus, Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Lecture Notes in Computer Science, The 24th International Symposium on Algorithms and Computation, Hong Kong, 2013. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet, Lecture Notes in Computer Science, European Symposium on Algorithms, 2013. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Tomasz Kociumaka, Solon P. Pissis, Fast Algorithm for Partial Covers in Words, Lecture Notes in Computer Science, Combinatorial Pattern Matching, 7922 2013, s. 177-188. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes in Computer Science, Language and Automata Theory and Applications, 7810 2013, s. 383-394. Zobacz w PBN
• Mirosław Kowaluk , Gabriela Majewska, New Sequential and Parallel Algorithms for Computing the β-Spectrum, Lecture Notes in Computer Science, 19th International Symposium on Fundamentals of Computation Theory, Liverpool, the United Kingdom of Great Britain and Northern Ireland, 19 sierpnia 2013 - 21 sierpnia 2013. Zobacz w PBN
• Stefan Dziembowski , Tomasz Kazana , Maciej Obremski, Non-malleable Codes from Two-Source Extractors, Lecture Notes in Computer Science, Advances in Cryptology – CRYPTO 2013, 2013. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Tomasz Waleń , Tomasz Kociumaka, Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Solon P. Pissis, Wojciech Rytter , Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes in Computer Science, String Processing and Information Retrieval, 8214 2013, s. 84-95. Zobacz w PBN

2012

• Sławomir Lasota , Mikołaj Bojańczyk , A machine-independent characterization of timed languages, Lecture Notes in Computer Science, International Colloquium on Automata, Languages and Programming, 2012. Zobacz w PBN
• Oliver Eulenstein, Paweł Górecki , A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Oliver Eulenstein, Paweł Górecki , Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Gordon J. Burleigh, Oliver Eulenstein, Paweł Górecki , GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Paweł Górecki , Jerzy Tiuryn , Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Henryk Michalewski , Damian Niwiński , On Topological Completeness of Regular Tree Languages, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen , Query-Subquery Nets, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Michał Matuszak, Jacek Miękisz , Tomasz Schreiber, Solving Ramified Optimal Transport Problem in the Bayesian Influence Diagram Framework, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Michał Matuszak, Jacek Miękisz , Stochastic techniques in Influence Diagrams for Learning Bayesian Network Structure, Lecture Notes in Computer Science, 2012. Zobacz w PBN
• Szczepan Hummel, Michał Skrzypczak , Topological Complexity of MSO+U and Related Automata Models, Lecture Notes in Computer Science, 2012. Zobacz w PBN

2011

• Anh Linh Nguyen , A Cut-Free ExpTime Tableau Decision Procedure for the Description Logic SHI, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Oliver Eulenstein, Paweł Górecki , A linear time algorithm for error-corrected reconciliation of unrooted gene trees, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Michinori Nakata, Hiroshi Sakai, Dominik Ślęzak , A NIS-apriori based rule generator in prolog and its functionality for table data, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Michinori Nakata, Hiroshi Sakai, Dominik Ślęzak , A prototype system for rule generation in Lipski's incomplete information databases, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Daryl H. Hepting, Richard Spring, Dominik Ślęzak , A rough set exploration of facial similarity judgements, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Andrzej Janusz , Sebastian Stawicki, Applications of approximate reducts to the feature selection problem, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Kamil Herba, Andrzej Janusz , Marcin Szczuka, Clustering of rough set related documents with use of knowledge from DBpedia, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Kamil Herba, Andrzej Janusz , Marcin Szczuka, 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, 2011. Zobacz w PBN
• Łukasz Sosnowski, Dominik Ślęzak , Comparators for compound object identification, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Patrick Doherty, Tomasz Michalak , Jacek Sroka , Andrzej Szałas , Contextual Coalitional Games, Lecture Notes in Computer Science, 4th Indian Conference on Logic and its Applications, 2011. Zobacz w PBN
• Anh Linh Nguyen , Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALCI, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Barbara Dunin-Kęplicz , Alina Strachocka, Rineke Verbrugge, Deliberation Dialogues during Multi-agent Planning, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Marta Burzańska, Krzysztof Stencel , Aneta Szumowska, Piotr Wiśniewski, Efficient Implementation of Recursive Queries in Major Object Relational Mapping Systems, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter , Bartosz Szreder, Tomasz Waleń , Efficient Seeds Computation Revisited, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Andrzej Janusz , Dominik Ślęzak , Ensembles of bireducts: towards robust classification and simple representation, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jakob Rehof, Paweł Urzyczyn , Finite Combinatory Logic with Intersection Types, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Hamiltonian Paths in the Square of a Tree, Lecture Notes in Computer Science, International Symposium on Algorithms and Computation (ISAAC), 2011. Zobacz w PBN
• Marcin Kowalski, Graham Toppin, Arkadiusz Wojna, Dominik Ślęzak , Injecting Domain Knowledge into RDBMS - Compression of Alphanumeric Data Attributes, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Hung Son Nguyen , 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, 2011. Zobacz w PBN
• Daniel Wichs, Tomasz Kazana, Stefan Dziembowski , Key-Evolution Schemes Resilient to Space-Bounded Leakage, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Stefan Dziembowski , Sebastian Faust, Leakage-Resilient Cryptography from the Inner-Product Extractor., Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Living with Inconsistency and Taming Nonmonotonicity. Datalog Reloaded, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Piotr Sankowski , Jakub Łącki, Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen , Andrzej Szałas , On the Web Ontology Rule Language OWL 2 RL, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Ildiko Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Marek Cygan , Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes in Computer Science, Combinatorial Pattern Matching, 2011. Zobacz w PBN
• Sebastian Widz, Dominik Ślęzak , Rough-set-inspired feature subset selection, classifier construction, and rule aggregation, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster Than 2n, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jan G. Bazan, Andrzej Janusz , Hung Son Nguyen , Dominik Ślęzak , Wojciech Świeboda, Semantic analytics of PubMed content, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Adam Koper, Hung Son Nguyen , Sequential Pattern Mining from Stream Data, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Michał Matuszak, Jacek Miękisz , Smooth conditional transition paths in dynamical Gaussian networks, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Robert Dąbrowski, Krzysztof Stencel , Grzegorz Timoszuk, Software Is a Directed Multigraph, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Oskar Skibski , Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jacek Chrząszcz, Aleksy Schubert , The role of polymorphism in the characterisation of complexity by soft types, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, Lecture Notes in Computer Science, 2011. Zobacz w PBN

2010

• Leszek Marcinkowski , A Balancing Domain Decomposition Method for a Discretization of a Plate Problem on Nonmatching Grids, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Marek Cygan, Łukasz Kowalik , Borut Luzar, A Planar Linear Arboricity Conjecture, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Maxime Crochemore, Marek Cygan , Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes in Computer Science, Combinatorial Pattern Matching, 2010. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Marcin Kamiński, Łukasz Kowalik , Approximating the Maximum 3- and 4-Edge-Colorable Subgraph, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter , Tomasz Waleń , Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Mikołaj Bojańczyk , Paweł Parys , Efficient Evaluation of Nondeterministic Automata Using Factorization Forests, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Jakub Radoszewski , Wojciech Rytter , Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup, Lecture Notes in Computer Science, Conference on Current Trends in Theory and Practice of Computer Science, 2010. Zobacz w PBN
• Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean Raskin, Szymon Toruńczyk , Energy and Mean-Payoff Games with Imperfect Information, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes in Computer Science, String Processing and Information Retrieval, 2010. Zobacz w PBN
• Marek Cygan, Łukasz Kowalik , Marcin Mucha , Marcin Pilipczuk, Piotr Sankowski , Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Stefan Dziembowski , How to Pair with a Human, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Stefan Dziembowski , Leakage-Resilient Storage, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Jakub Pawlewicz , Nearly Optimal Computer Play in Multi-player Yahtzee, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , On the Correctness of Rough-Set Based Approximate Reasoning, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Number of Cubic Runs in a String, Lecture Notes in Computer Science, Language and Automata Theory and Applications, 2010. Zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Sum of Exponents of Runs in a String, Lecture Notes in Computer Science, International Workshop on Combinatorial Algorithms, 2010. Zobacz w PBN
• Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski , Online Network Design with Outliers, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Anh Linh Nguyen , Paraconsistent and Approximate Semantics for the OWL 2 Web Ontology Language, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Krzysztof Diks , Piotr Stańczyk, Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time, Lecture Notes in Computer Science, SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, 2010. Zobacz w PBN
• Barbara Klunder, Wojciech Rytter , Post Correspondence Problem with Partially Commutative Alphabets, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Marta Burzańska, Krzysztof Stencel , Patrycja Suchomska, Aneta Szumowska, Piotr Wiśniewski, Recursive Queries Using Object Relational Mapping, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Sebastian Widz, Dominik Ślęzak , Rough-Set-based classifier extraction and voting criteria are Applied together?, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Three-Valued Paraconsistent Reasoning for Semantic Web Agents, Lecture Notes in Computer Science, 2010. Zobacz w PBN

2009

• Aleksander Madry, Marcin Mucha , Katarzyna Paluch, A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Katherine Arbuthnott, Daryl H. Hepting, Timothy Maciag, Richard Spring, Dominik Ślęzak , A rough sets approach for personalized support of face recognition, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Linh Anh Nguyen, Andrzej Szałas , A Tableau Calculus for Regular Grammar Logics with Converse, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Mikołaj Bojańczyk , Tomasz Idziaszek, Algebra for Infinite Forests with an Application to the Temporal Logic EF, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Mikołaj Bojańczyk , Algebra for Tree Languages, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Jacek Chrząszcz, Marieke Huisman, Aleksy Schubert , BML and Related Tools, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Marek Cygan, Marcin Pilipczuk , Exact and Approximate Bandwidth, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Ken-etsu Fujita, Aleksy Schubert , Existential Type Systems with No Types in Terms, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Mikołaj Bojańczyk , Factorization Forests, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Till Mossakowski, Andrzej Tarlecki , Heterogeneous Logical Environments for Distributed Specifications, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Rok Erman, Łukasz Kowalik , Matjaz Krnc, Tomasz Waleń , Improved Induced Matchings in Sparse Graphs, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Paweł Urzyczyn , Inhabitation of Low-Rank Intersection Types, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Marcin Kowalski, Dominik Ślęzak , Intelligent data granulation on load: Improving infobright's knowledge grid, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Jacques Duparc, Alessandro Facchini, Filip Murlak , Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter , Tomasz Waleń , LPF Computation Revisited, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the Maximal Number of Cubic Subwords in a String, Lecture Notes in Computer Science, International Workshop on Combinatorial Algorithms, 2009. Zobacz w PBN
• Alicja Szałas, Andrzej Szałas , Paraconsistent Reasoning with Words, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Wojciech Czerwiński , Sibylle B. Fröschle, Sławomir Lasota , Partially-Commutative Context-Free Processes, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Marta Burzańska, Krzysztof Stencel , Piotr Wiśniewski, Pushing Predicates into Recursive SQL Common Table Expressions, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Aleksy Schubert , The Existential Fragment of the One-Step Parallel Rewriting Theory, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Kohei Hayashi, Michinori Nakata, Hiroshi Sakai, Dominik Ślęzak , The lower system, the upper system and rules with stability factor in non-deterministic information systems, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Łukasz Kowalik , Marcin Mucha , Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Paweł Parys , Igor Walukiewicz, Weak Alternating Timed Automata, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Markku Laine, Wojciech Plandowski , Word equations with one unknown, Lecture Notes in Computer Science, 2009. Zobacz w PBN

2008

• Mirosław Kowaluk , Andrzej Lingas, Johannes Nowak, A Path Cover Technique for LCAs in Dags, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Piotr Sankowski , Algebraic Graph Algorithms, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Rajeev Gore, Anh Linh Nguyen , Analytic Cut-free Tableaux for Regular Modal Logics of Agent Beliefs, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Gudmund Skovbjerg Frandsen, Piotr Sankowski , Dynamic Normal Forms and Dynamic Characteristic Polynomial, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Grzegorz Falda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel , Kazimierz Subieta, Executable Platform Independent Models for Data Intensive Applications, Lecture Notes in Computer Science, 8th International Conference on Computational Science, Kraków, Poland, 23 czerwca 2008 - 25 czerwca 2008. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Aida Vitória, Four-Valued Extension of Rough Sets, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Krzysztof Diks , Jan Madey, From Top Coders to Top IT Professionals, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Agnieszka Kozubek, Paweł Urzyczyn , In the search of a naive type theory, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Wojciech Frączak, Wojciech Rytter , Mohammadreza Yazdani, Matching Integer Intervals by Minimal Sets of Binary Words with don't cares, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel , Kazimierz Subieta, OCL as the Query Language for UML Model Execution, Lecture Notes in Computer Science, 8th International Conference on Computational Science, Krakow, Poland, 23 czerwca 2008 - 25 czerwca 2008. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Aida Vitória, Paraconsistent Logic Programs with Four-Valued Rough Sets, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Grzegorz Fałda, Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel , Kazimierz Subieta, Platform-Independent Programming of Data-Intensive Applications Using UML, Lecture Notes in Computer Science, Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, Poznań, Poland, 10 października 2007 - 12 października 2007. Zobacz w PBN
• Hung Son Nguyen , Andrzej Skowron, Rough set approach to KDD (Extended abstract), Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Johann A. Makowsky, Damian Niwiński , The Ackermann Award 2008, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Mikołaj Bojańczyk , The Common Fragment of ACTL and LTL, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Mikołaj Bojańczyk , Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Mikołaj Bojańczyk , Tree-Walking Automata, Lecture Notes in Computer Science, 2008. Zobacz w PBN

2007

• Łukasz Kowalik , Marcin Mucha , 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Jan Hidders, Natalia Kwasnikowska, Jacek Sroka , Jerzy Tyszkiewicz , Jan Van den Bussche, A Formal Model of Dataflow Repositories, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• C. Iliopoulos, Marcin Kubica, M. Rahman, Tomasz Waleń , Algorithms for Computing the Longest Parameterized Common Subsequence, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Anh Linh Nguyen , Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Henrik Bjorklund, Mikołaj Bojańczyk , Bounded Depth Data Trees, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz , Jan Van den Bussche, Database Query Processing Using Finite Cursor Machines, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Krzysztof Diks , Piotr Sankowski , Dynamic Plane Transitive Closure, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• P. Doherty, Barbara Dunin-Kęplicz , Andrzej Szałas , Dynamics of Approximate Information Fusion, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Efficient Computation of Throughput Values of Context-Free Languages, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Rajeev Gore, Anh Linh Nguyen , EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Mikołaj Bojańczyk , Forest Expressions, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Piotr Wasilewski , Dominik Ślęzak , Granular sets. Foundations and case study of tolerance spaces, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Hung Son Nguyen , Thi Sinh Hoa Nguyen, Hierarchical Rough Classifiers, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Christian Haack, Erik Poll, Jan Schaefer, Aleksy Schubert , Immutable Objects for a Java-Like Language, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Radoslaw Adamus, Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Implementing a P2P Network Through Updatable Database Views, Lecture Notes in Computer Science, OTM Confederated International Conference and Workshop, Vilamoura, Portugal, 25 listopada 2007 - 30 listopada 2007. Zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel , Kazimierz Subieta, Implementing OCL as a Database Query Language, Lecture Notes in Computer Science, OTM Confederated International Conference and Workshop, Vilamoura, Portugal, 25 listopada 2007 - 30 listopada 2007. Zobacz w PBN
• Anna Gambin , Ewa Szczurek , No-regret boosting, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Eryk Kopczyński , Omega-Regular Half-positional winning conditions, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Sławomir Lasota , David Nowak, Yu Zhang, On completeness of logical relations for monadic types, Lecture Notes in Computer Science, Advances in Computer Science - ASIAN 2006, 2007. Zobacz w PBN
• Jacques Duparc, Filip Murlak , On the topological complexity of weakly recognizable tree languages, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Mikołaj Bojańczyk , Piotr Hoffman, Reachability in Unions of Commutative Rewriting Systems Is Decidable, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Jerzy Tiuryn , Bartosz Wilczyński , Reconstruction of Mammalian Cell Cycle Regulatory Network from Microarray Data using Stochastic Logical Networks, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Marcin Szczuka, Dominik Ślęzak , Rough Neural Networks for Complex Concepts, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Henrik Bjorklund, Mikołaj Bojańczyk , Shuffle Expressions and Words with Nested Data, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Leszek Kołodziejczyk , Neil Thapen, The polynomial and linear hierarchies in $V^0$, Lecture Notes in Computer Science, CiE 2007 - Computability in Europe, 2007. Zobacz w PBN
• Juhani Karhumaki, Yury Lifshits, Wojciech Rytter , Tiling Periodicity, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Andrzej Tarlecki , Toward specifications for reconfigurable component systems, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Towards Approximate BGI Systems, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication, Lecture Notes in Computer Science, 2007. Zobacz w PBN

2006

• Anh Linh Nguyen , A Bottom-up Method for the Deterministic Horn Fragment of the Description Logic ALC, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Hung Son Nguyen , Approximate Boolean reasoning: foundations and applications in data mining, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Marcin Kubica, R. Rizzi, St, Vialette, Tomasz Waleń , Approximation of RNA Multiple Structural Alignment, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Łukasz Kowalik , Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Anna Gambin , Jakub Karczmarski, Bogusław Kluge, Jerzy Ostrowski, Marta Łuksza, Efficient Model-Based Clustering for LC-MS Data, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Equivalence of Functions Represented by Simple Context-Free Grammars with Output, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Mikołaj Bojańczyk , Mathias Samuelides, Thomas Schwentick, Luc Segoufin, Expressive Power of Pebble Automata, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Sławomir Lasota , Wojciech Rytter , Faster algorithm for bisimulation equivalence of normed context-free processes, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Eryk Kopczyński , Half-Positional Determinacy of Infinite Games, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Don Sannella, Andrzej Tarlecki , Horizontal composability revisited, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Łukasz Kowalik , Improved Edge Coloring with Three Colors, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Stefan Dziembowski , Intrusion-Resilience Via the Bounded-Storage Model, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Hung Son Nguyen , Knowledge discovery by relation approximation: a rough set approach, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Norbert Dojer , Learning Bayesian Networks Does Not Have to Be NP-Hard, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Stefan Dziembowski , On Forward-Secure Storage, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Andrzej Szałas , Jerzy Tyszkiewicz , On the Fixpoint Theory of Equality and its Applications, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Hung Son Nguyen , Thi Sinh Hoa Nguyen, Trung Nguyen, Ontology driven concept approximation, Lecture Notes in Computer Science, 5th International Conference on Rough Sets and Current Trends in Computing, Kobe, Japan, 6 listopada 2006 - 8 listopada 2006. Zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Optimization of Queries Invoking Views by Query Tail Absorption, Lecture Notes in Computer Science, 4th International Conference on Advances in Information Systems, Izmir, Turkey, 18 października 2006 - 20 października 2006. Zobacz w PBN
• Anh Linh Nguyen , Reasoning about Epistemic States of Agents by Modal Logic Programming, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Jerzy Tiuryn , Bartosz Wilczyński , Regulatory Network Reconstruction using Stochastic Logical Networks, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• P. Kolman, Tomasz Waleń , Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Michał Lentner, Krzysztof Stencel , Kazimierz Subieta, Semi-Strong Static Type Checking of Object-Oriented Query Languages, Lecture Notes in Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czechia, 21 stycznia 2006 - 27 stycznia 2006. Zobacz w PBN
• Anh Linh Nguyen , The Data Complexity of MDatalog in Basic Modal Logics, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Wojciech Rytter , The Number of Runs in a String: Improved Analysis of the Linear Upper Bound, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Filip Murlak , The Wadge Hierarchy of Deterministic Tree Languages, Lecture Notes in Computer Science, 33rd International Colloquium on Automata, Languages and Programming, Wenecja, Italy, 10 lipca 2006 - 14 lipca 2006. Zobacz w PBN
• Piotr Habela, Krzysztof Stencel , Kazimierz Subieta, Three-Level Object-Oriented Database Architecture Based on Virtual Updateable Views, Lecture Notes in Computer Science, 4th International Conference on Advances in Information Systems, Izmir, Turkey, 18 października 2006 - 20 października 2006. Zobacz w PBN
• Piotr Habela, Krzysztof Kaczmarski, Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Transparency in Object-Oriented Grid Database Systems, Lecture Notes in Computer Science, 6th International Conference on Parallel Processing and Applied Mathematics, Poznań, Poland, 11 września 2005 - 14 września 2005. Zobacz w PBN
• Piotr Sankowski , Weighted Bipartite Matching in Matrix Multiplication Time, Lecture Notes in Computer Science, 2006. Zobacz w PBN

2005

• Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, A flexible grid infrastructure for data analysis, Lecture Notes in Computer Science, 3rd International Atlantic Web Intelligence Conference, Łódź, Poland, 6 czerwca 2005 - 9 czerwca 2005. Zobacz w PBN
• Piotr Chrząstowski-Wachtel, Jerzy Tyszkiewicz , A Maple Package for Conditional Event Algebras, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Aleksy Schubert , A self-dependency constraint in the simply typed lambda calculus, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Till Mossakowski, Don Sannella, Andrzej Tarlecki , A Simple Refinement Language for CASL, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Rajeev Gore, Anh Linh Nguyen , A Tableau System with Automaton-Labelled Formulae for Regular Grammar Logics, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Anna Gambin , Damian Wójtowicz, Almost FPRAS for Lattice Models of Protein Folding (Extended Abstract), Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Sławomir Lasota , Igor Walukiewicz, Alternating Timed Automata, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Anh Linh Nguyen , An SLD-Resolution Calculus for Basic Serial Multimodal Logics, Lecture Notes in Computer Science, 2005. 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, 2005. Zobacz w PBN
• Jacek Brzezinski, Piotr Dunin-Keplicz, Barbara Dunin-Kęplicz , Collectively cognitive agents in cooperative teams, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Rajeev Gore, Anh Linh Nguyen , Completeness of Hyper-Resolution via the Semantics of Disjunctive Logic Programs, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Sibylle Froeschle, Sławomir Lasota , Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Distributed Query Optimization in the Stack-Based Approach, Lecture Notes in Computer Science, 1st International on High Performance Computing and Communications, Sorrento, Italy, 21 września 2005 - 23 września 2005. Zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Implementation of Federated Databases Through Updatable Views, Lecture Notes in Computer Science, European Grid Conference, Amsterdam, the Netherlands, 14 lutego 2005 - 16 lutego 2005. Zobacz w PBN
• Hung Son Nguyen , Thi Sinh Hoa Nguyen, Improving Rough Classifiers Using Concept Ontology, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Intelligent Data Integration Middleware Based on Updateable Views, Lecture Notes in Computer Science, 2nd Intenational Workshop on Intelligent Media Technology for Communicative Intelligence, Warszawa, Poland, 13 września 2004 - 14 września 2004. Zobacz w PBN
• Mirosław Kowaluk , Andrzej Lingas, LCA Queries in Directed Acyclic Graphs, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Filip Murlak , On deciding topological classes of deterministic tree languages, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Anh Linh Nguyen , On Modal Deductive Databases, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Piotr Cybula, Hanna Kozankiewicz, Krzysztof Stencel , Kazimierz Subieta, Optimization of Distributed Queries in Grid Via Caching, Lecture Notes in Computer Science, OTM Confederated International Conference and Workshop, Agia Napa, Cyprus, 31 października 2005 - 4 listopada 2005. Zobacz w PBN
• Jan Hidders, Natalia Kwasnikowska, Sławomir Lasota , Jacek Sroka , Jerzy Tyszkiewicz , Jan Van den Bussche, Petri Net + Nested Relational Calculus = Dataflow, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Hung Son Nguyen , Thi Sinh Hoa Nguyen, Trung 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, 2005. Zobacz w PBN
• Piotr Sankowski , Shortest Paths in Matrix Multiplication Time, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Piotr Sankowski , Subquadratic Algorithm for Dynamic Shortest Distances, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Teodor Knapik, Damian Niwiński , Paweł Urzyczyn , Igor Walukiewicz, Unsafe Grammars and Panic Automata, Lecture Notes in Computer Science, 2005. Zobacz w PBN
• Tomasz Pieciukiewicz, Krzysztof Stencel , Kazimierz Subieta, Usable Recursive Queries, Lecture Notes in Computer Science, 9th East European Conference on Advances in Databases and Information Systems, Tallin, Estonia, 12 września 2005 - 15 września 2005. Zobacz w PBN

2004

• Mikołaj Bojańczyk , A Bounding Quantifier, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Hubert Baumeister, Maura Cerioli, Anne Haxthausen, Till Mossakowski, Peter Mosses, Don Sannella, Andrzej Tarlecki , CASL Semantics, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Mikołaj Bojańczyk , Igor Walukiewicz, Characterizing EF and EX Tree Logics, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Jean Goubault-Larrecq, Sławomir Lasota , David Nowak, Yu Zhang, Complete lax logical relations for cryptographic lambda-calculi, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Barbara Dunin-Kęplicz , Rieneke Verbrugge, Dynamics of collective attitudes during teamwork, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Łukasz Kowalik , Fast 3-Coloring Triangle-Free Planar Graphs, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Don Sannella, Andrzej Tarlecki , Foundations. In: CASL User Manual, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Wojciech Rytter , Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Marcin Szczuka, Jakub Wróblewski, Dominik Ślęzak , Harnessing classifier networks - towards hierarchical concept construction, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Krzysztof Ciebiera, Piotr Sankowski , Improving Web Sites by Automatic Source Code Analysis and Modification, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Jan Bazan, Hung Son Nguyen , Thi Sinh Hoa Nguyen, Andrzej Skowron, Layered Learning for Concept Synthesis, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Marcin Mucha , Piotr Sankowski , Maximum Matchings in Planar Graphs via Gaussian Elimination, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Anh Linh Nguyen , MProlog: An Extension of Prolog for Modal Logic Programming, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Anh Linh Nguyen , Negative Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Stefan Dziembowski , Ueli Mauer, On Generating the Initial Key in the Bounded-Storage Model, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Aleksy Schubert , On the Building of Affine Retractions, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Paweł Górecki , Jerzy Tiuryn , On the structure of reconciliations, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Jan Bazan, Hung Son Nguyen , 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, 2004. Zobacz w PBN
• Robert Dąbrowski, Wojciech Plandowski , Solving Word Equations in Two Variables, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Anh Linh Nguyen , The Modal Logic Programming System MProlog, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Michel Bidoit, Don Sannella, Andrzej Tarlecki , Toward component-oriented formal software development: an algebraic approach, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Mikołaj Bojańczyk , Thomas Colcombet, Tree-Walking Automata Cannot Be Determinized, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Viviana Bono, Jerzy Tiuryn , Paweł Urzyczyn , Type inference for nested self types, Lecture Notes in Computer Science, 2004. Zobacz w PBN

2003

• Mikołaj Bojańczyk , 1-Bounded TWA Cannot Be Determinized, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Sławomir Lasota , A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Hung Son Nguyen , Andrzej Skowron, Marcin Szczuka, A view on rough set concept approximations, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Piotr Sankowski , Alternative Algorithm for Counting All Matchings in Graphs, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Barbara Dunin-Kęplicz , Rieneke Verbrugge, Calibrating collective commitments, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Marcin Szczuka, Jakub Wróblewski, Dominik Ślęzak , Constructing extensions of bayesian classifiers with use of normalizing neural networks, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Robert Benkoci, Marek Chrobak, Lawrence Larmore, Wojciech Rytter , Faster algorithms for k-medians in trees, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Piotr Sankowski , Multisampling: a New Approach to Uniform Sampling and Approximate Counting, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Łukasz Kowalik , Short Cycles in Planar Graphs, Lecture Notes in Computer Science, 2003. Zobacz w PBN
• Wojciech Plandowski , Test Sets for Large Families of Languages, Lecture Notes in Computer Science, 2003. Zobacz w PBN

2002

• Krzysztof Diks , Łukasz Kowalik , Maciej Kurowski, A new 3-color criterion for planar graphs, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Anh Linh Nguyen , Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Wojciech Rytter , Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Sławomir Lasota , Decidability of strong bisimilarity for timed BPP, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• M. Bidoit, D. Sannella, Andrzej Tarlecki , Global Development via Local Observational Construction Steps, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Teodor Knapik, Damian Niwiński , Paweł Urzyczyn , Higher-order pushdown trees are easy, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• J. Goubault-Larrecq, Sławomir Lasota , D. Nowak, Logical Relations for Monadic Types, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Damian Niwiński , Mu-calculus via games, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Michał Bielecki, J. Hidders, J. Paredaens, Jerzy Tyszkiewicz , J. Van den Bussche, Navigating with a browser, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• A. Pagourtzis, I. Potapov, Wojciech Rytter , Observations on Parallel Computation of Transitive and Max-Closure Problems, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Wojciech Rytter , On maximal suffices and constant space versions of KMP algorithm, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Robert Dąbrowski, Wojciech Plandowski , On word equations in one variable, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• A Osmólski, Andrzej Skowron, Marcin Szczuka, Jakub Wróblewski, Dominik Ślęzak , Rough set approach to the survival analysis, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Hung Son Nguyen , Scalable classification mathod based on rough sets, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski , Wojciech Rytter , Three heuristics for delta-matching: delta-BM algorithms, Lecture Notes in Computer Science, 2002. Zobacz w PBN
• Mikołaj Bojańczyk , Two-way alternating automata and finite models, Lecture Notes in Computer Science, 2002. Zobacz w PBN

2001

• Anna Gambin , Piotr Pokarowski , A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain (Extended Abstract), Lecture Notes in Computer Science, Fundamentals of Computation Theory, 2001. Zobacz w PBN
• M. Chrobak, L. Gąsieniec, Wojciech Rytter , A randomized algorithm for gossiping in radio networks, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• F. Dignum, Barbara Dunin-Kęplicz , 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, 2001. Zobacz w PBN
• T. Mossakowski, L. Schroeder, Andrzej Tarlecki , Amalgamation in CASL via enriched signatures, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• Piotr Hoffman, B. Klin, T. Mossakowski, A. Schroeder, Andrzej Tarlecki , Checking amalgamability conditions for CASL architectural specifications, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• T. Knapik, Damian Niwiński , Paweł Urzyczyn , Deciding monadic theories of hyperalgebraic trees, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• J. Karhumaki, Wojciech Plandowski , Wojciech Rytter , On the complexity of decidable cases of commutation problem for languages, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• A. Pagourtzis, I. Potapov, Wojciech Rytter , PVM computation of transitive closure: the dependency graph approach, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• Piotr Hoffman, B. Klin, T. Mossakowski, A. Schroeder, Andrzej Tarlecki , Semantics of architectural specifications in CASL, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• Aleksy Schubert , The complexity of beta-Reduction in low orders, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• Mikołaj Bojańczyk , The finite graph problem for two-way alternating automata, Lecture Notes in Computer Science, 2001. Zobacz w PBN
• M. Chrobak, L. Larmore, Wojciech Rytter , The k-median problems for directed trees, Lecture Notes in Computer Science, 2001. Zobacz w PBN

2000

• Sławomir Lasota , Behavioural constructor implementation for regular algebras, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• F Honsell, J Longley, D Sannella, Andrzej Tarlecki , Constructive data refinement in typed lambda calculus, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• F Dignum, Barbara Dunin-Kęplicz , R Verbrugge, Dialogue in team formation, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• P. Dohery, Andrzej Szałas , Witold Łukaszewicz, Efficient reasoning using the local closed-world assumption, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• Sławomir Lasota , Finitary observations in regular algebras, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• K Fujita, Aleksy Schubert , Partially typed terms between Church-style and Curry-style, Lecture Notes in Computer Science, 2000. 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, 2000. Zobacz w PBN
• Aleksy Schubert , Type inference for first order logic, Lecture Notes in Computer Science, 2000. Zobacz w PBN

1999

• Anh Linh Nguyen , A New Space Bound for the Modal Logics K4, KD4 and S4, Lecture Notes in Computer Science, 1999. Zobacz w PBN
• Anna Gambin , On Approximation of the Number of Bases of Exchange Preserving Matroids, Lecture Notes in Computer Science, Mathematical Foundation in Computer Science, 1999. Zobacz w PBN
• Anna Gambin , Adam Malinowski, Randomized Gossiping by Packets in Faulty Networks, Lecture Notes in Computer Science, SOFSEM 1999: Conference on Current Trends in Theory and Practice of Computer Science, 1999. Zobacz w PBN

1998

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

1997

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

1996

• Anna Gambin , Sławomir Lasota , On the Semantics of Multistage Interconnection Networks, Lecture Notes in Computer Science, SOFSEM '96: Theory and Practice of Informatics, 23rd Seminar on Current Trends in Theory and Practice of Informatics, 1996. Zobacz w PBN
• Bogdan Chlebus, Anna Gambin , Piotr Indyk, Shared-Memory Simulation on a FaultyMemory DMM, Lecture Notes in Computer Science, International Colloquium on Automata, Languages and Programming, 1996. Zobacz w PBN

1994

• Bogdan Chlebus, Anna Gambin , Piotr Indyk, PRAM Computations Resilient to Memory Faults, Lecture Notes in Computer Science, European Symposium on Algorithms, 1994. Zobacz w PBN