Publikacje

Instytut Informatyki

2011

• Filip Murlak i Piotr Sankowski (red.), Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011., Springer, Berlin 2011.zobacz w PBN
• Tomasz Kociumaka, Marcin Kubica i Jakub Jan Radoszewski (red.), XVIII Olimpiada Informatyczna 2010/2011, Komitet Główny Olimpiady Informatycznej, Warszawa 2011.zobacz w PBN
• Gudmund Frandsen i Piotr Sankowski, Dynamic normal forms and dynamic characteristic polynomial, Theoretical Computer Science 412 (16) 2011, s. 1470–1483.zobacz w PBN
• Albert Atserias, Mikołaj Bojańczyk, Balder ten Cate, Ronald Fagin, Floris Geerts i Kenneth Ross, Foreword, Theory Of Computing Systems 49 (2) 2011, s. 365–366.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
• 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
• 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
• Marcin Konrad Dziubiński, Complexity of Multiagent BDI Logics with Restricted Modal Context, w: AAMAS'11: 10th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, 2011, s. 1171–1172.zobacz w PBN
• Andrzej Janusz i Dominik Ślęzak, An unsupervised model for rule-based similarity learning from textual data, w: Proceedings of International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok, 2011.zobacz w PBN
• Stefan Dziembowski, Tomasz Kazana, Daniel Wichs i Tomasz Piotr Kazana, Key-Evolution Schemes Resilient to Space-Bounded Leakage, w: Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings, 2011, s. 335–353.zobacz w PBN
• Alexander Kurz i Andrzej Tarlecki (red.), Special issue on Algebra and Coalgebra in Computer Science (CALCO 2009), Braunschweig 2011.zobacz w PBN
• Paweł Parys i Mikołaj Bojańczyk, XPath Evaluation in Linear Time, Journal Of The Acm 58 (4) 2011, s. 17.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Information systems in modeling interactive computations on granules, Theoretical Computer Science 412 (42) 2011, s. 5939–5959.zobacz w PBN
• Mikołaj Bojańczyk, Weak MSO with the Unbounding Quantifier, Theory Of Computing Systems 48 (3) 2011, s. 554–576.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
• 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
• Piotr Wasilewski, James F. Peters i Sheela Ramanna, Perceptual Tolerance Intersection, Lecture Notes In Computer Science Transactions On Rough Sets 13 2011, s. 159–174.zobacz w PBN
• Patrick Doherty, Barbara Dunin-Kęplicz i Andrzej Szałas, Tractable Model Checking for Fragments of Higher-Order Coalition Logic, w: AAMAS'11: 10th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, 2011, s. 743–750.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Perception, Actions and Plans in Interactive Computing,, w: Systemy Wspomagania Decyzji. Alicja Wakulicz (Ed.),, Instytut Informatyki, Uniwersytet Śląski, 2011.zobacz w PBN
• Andrea Corradini, Bartosz Klin i Corina Cirstea (red.), Proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), Springer, Berlin 2011.zobacz w PBN
• Menachem Kojman i Henryk Michalewski, Borel extensions of Baire measures in ZFC, Fundamenta Mathematicae 211 2011, s. 197–223.zobacz w PBN
• Dominik Ślęzak i Marcin Szczuka, Feedforward neural networks for compound signals, Theoretical Computer Science 412 (42) 2011, s. 5960–5973.zobacz w PBN
• Ewa Szczurek, Florian Markowetz, Irit Gat-Viks, Przemysław Biecek, Jerzy Tiuryn i Martin Vingron, Deregulation upon DNA damage revealed by joint analysis of context-specific perturbation data, Bmc Bioinformatics 12 2011, s. 1–19.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
• 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
• Tomasz Kulczyński, Jakub Łącki i Jakub Jan Radoszewski, Stimulating Students' Creativity with Tasks Solved Using Precomputation and Visualization, Olympiads In Informatics 5 2011, s. 71–81.zobacz w PBN
• Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Counting and detecting small subgraphs via equations and matrix multiplication, w: SODA, SIAM, San Francisco 2011.zobacz w PBN
• Łukasz Sosnowski i Dominik Ślęzak, RDBMS framework for contour identification, w: Proceedings of the International Workshop CS&P'2011, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Geuk Lee, Daniel Howard i Dominik Ślęzak (red.), Convergence and Hybrid Information Technology, 2011.zobacz w PBN
• Marcin Pilipczuk, Characterization of compact subsets of curves with omega-continuous derivatives, Fundamenta Mathematicae 211 (2) 2011, s. 175–195.zobacz w PBN
• Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Dominating set is fixed parameter tractable in claw-free graphs, Theoretical Computer Science 412 (50) 2011, s. 6982–7000.zobacz w PBN
• Jacek Sroka, Łukasz Bieniasz-Krzywiec, Szymon Gwozdz, Dariusz Leniowski, Jakub Łącki, Mateusz Markowski, Claudio Avignone-Rossa, Michael Bushell, Johnjoe McFadden i Andrzej Kierzek, Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface, Bmc Bioinformatics 12 2011, s. 196.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
• Łukasz Sosnowski i Dominik Ślęzak, Comparators for compound object identification, Lecture Notes In Computer Science 6743 2011, s. 342–349.zobacz w PBN
• Grzegorz Jakacki, Marcin Kubica i Tomasz Waleń, Codility. Application of Olympiad-Style Code Assessment to Pre-Hire Screening of Programmers, Olympiads In Informatics 5 2011, s. 32–43.zobacz w PBN
• Jacques Duparc, Alessandro Facchini i Filip Murlak, Definable Operations On Weakly Recognizable Sets of Trees, w: FSTTCS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Hitomi Okuma, Michinori Nakata, Dominik Ślęzak i Hiroshi Sakai, Properties on inclusion relations and division charts in non, w: 2011 IEEE International Conference On Granular Computing (GrC). Tzung-Pei Hong, Yasuo Kudo, Mineichi Kudo, Tsau-Young Lin, Been-Chian Chien, Shyue-Liang Wang, Masahiro Inuiguchi, GuiLong Liu (eds.), IEEE, Advancing Technology for Humanity, Taiwan 2011.zobacz w PBN
• Tai-Hoon Kim, Hojjat Adeli, Dominik Ślęzak, Frode Eika Sandnes i Xiaofeng Song (red.), Future Generation Information Technology, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2011.zobacz w PBN
• Marek Adam Cygan, Marcin Łukasz Pilipczuk i Jakub Onufry Wojtaszczyk, Capacitated domination faster than O(2^n), Information Processing Letters 111 (23) 2011, s. 1099–1103.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Toward interactive rough-granular computing, Control And Cybernetics 40 (2) 2011, s. 1–23.zobacz w PBN
• Paweł Górecki, Gordon Burleigh i Oliver Eulenstein, Maximum likelihood models and algorithms for gene tree evolution with duplications and losses, Bmc Bioinformatics 12 (S15) 2011, s. 1–9.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
• 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
• Hiroshi Sakai, Hitomi Okuma, Michinori Nakata i Dominik Ślęzak, Stable rule extraction and decision making in rough non-deterministic information analysis, International Journal Of Hybrid Intelligent Systems 8 (1) 2011, s. 41–57.zobacz w PBN
• Mikołaj Bojańczyk i Diego Figueira, Efficient evaluation for a temporal logic on changing XML documents, w: PODS, ACM, Athens 2011.zobacz w PBN
• Mikołaj Bojańczyk, Leszek Aleksander Kołodziejczyk i Filip Murlak, Solutions in XML data exchange, w: Proceedings of the 14th International Conference on Database Theory. ICDT'11, ACM, Uppsala, Sweden 2011.zobacz w PBN
• Wei-Zhi Wu, Dominik Ślęzak i Hung Son Nguyen (red.), Preface, IOS PRESS, NIEUWE HEMWEG 6B, AMSTERDAM, NETHERLANDS, 1013 BG 2011.zobacz w PBN
• Marek Cygan i Łukasz Kowalik, Channel Assignment via Fast Zeta Transform, Information Processing Letters 111 (15) 2011, s. 727–730.zobacz w PBN
• Anna Gambin, Tomasz Gambin i Paweł Stankiewicz, A stable density approach to probe selection for a custom aCGH design, Biotechnologia 92 (3) 2011, s. 283–295.zobacz w PBN
• Michał Woźniak, L. Wong i Jerzy Tiuryn, CAMBer: an approach to support comparative analysis of multiple bacterial strains, Bmc Genomics 12 (2) 2011, s. 6.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
• 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
• Hiroshi Sakai, Kohei Hayashi, Michinori Nakata i Dominik Ślęzak, A mathematical extension of rough set based issues toward uncertain information analysis, New Mathematics And Natural Computation 7 (3) 2011, s. 543–570.zobacz w PBN
• Anna Gambin, Maciej Sykulski, Tomasz Gambin, Magdalena Bartnik i Katarzyna Derwińska, Efficient multiple samples aCGH analysis for rare CNVs detection, w: IEEE International Conference Bioinformatics and Biomedicine, 2011.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem), w: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, ACM, San Francisco 2011, s. 1666–1674.zobacz w PBN
• Sergei O. Kuznetsov, Dominik Ślęzak, Daryl H. Hepting i Boris Mirkin (red.), Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2011.zobacz w PBN
• Gerold Jäger i Marcin Peczarski, The number of pessimistic guesses in Generalized Black-peg Mastermind, Information Processing Letters 111 (19) 2011, s. 933–940.zobacz w PBN
• Anna Gambin i Michał Kistowski, Optimization algorithm for de novo analysis of tandem mass spectrometry data, Biotechnologia 92 (3) 2011, s. 296–300.zobacz w PBN
• Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick i Luc Segoufin, Two-variable logic on data words, Acm Transactions On Computational Logic 12 (4) 2011.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
• Marcin Szczuka, Risk assessment in granular environments, Lecture Notes In Computer Science 6499 2011, s. 121–134.zobacz w PBN
• Mikołaj Bojańczyk, Bartosz Klin i Sławomir Lasota, Automata with group actions, w: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Society, Toronto 2011.zobacz w PBN
• Michałis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, w: CPM, 2011.zobacz w PBN
• Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan van Rooij i Jakub Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, w: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, IEEE, Palm Springs 2011, s. 150–159.zobacz w PBN
• Emilio Corchado, Václav Snásel, Javier Sedano, Aboul Ella Hassanien i Dominik Ślęzak (red.), Soft Computing Models in Industrial and Environmental Applications, 6th International Conference SOCO 2011, 2011.zobacz w PBN
• Marcin Konrad Dziubiński, Location game on disjoint line segments, International Journal Of Game Theory 40 (2) 2011, s. 231–262.zobacz w PBN
• Wojciech Czerwiński, Sibylle Froeschle i Sławomir Lasota, Partially-commutative context-free processes: expressibility and tractability, Information And Computation 209 (5) 2011, s. 782–798.zobacz w PBN
• Marcin Kubica, Romeo Rizzi, Stephane Vialette i Tomasz Waleń, Approximation of RNA multiple structural alignment, Journal Of Discrete Algorithms 9 (4) 2011, s. 365–376.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
• 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
• Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk i Piotr Sankowski, Approximation Algorithms for Union and Intersection Covering Problems, w: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2011, Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, s. 28–40.zobacz w PBN
• Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski i Christian Wulff-Nilsen, Improved algorithms for min cut and max flow in undirected planar graphs, w: STOC, ACM, San Jose 2011.zobacz w PBN
• Ali Rezaei Divroodi i Anh Linh Nguyen, On Bisimulations for Description Logics, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Aboul Ella Hassanien, Hiroshi Sakai, Dominik Ślęzak, Mihir K. Chakraborty i William Zhu (red.), Special issue: Rough and Fuzzy Methods for Data Mining (1-2)., 2011.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse, Studia Logica 98 (3) 2011, s. 387–428.zobacz w PBN
• J. Engwerda, Tomasz Michalak i J. Plasmans, A Numerical Toolbox to Solve N-Player Affine LQ Open-Loop Differential Games, Computational Economics 37 (4) 2011, s. 375–410.zobacz w PBN
• Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith i Jakub Wojtaszczyk, Breaking the 2^n-barrier for Irredundance: Two lines of attack, Journal Of Discrete Algorithms 9 (3) 2011, s. 214–230.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, 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
• Talal Rahwan, Tomasz Michalak i Nicholas Jennings, Minimum Search To Establish Worst-Case Guarantees in Coalition Structure Generation, w: Proceedings of International Conferences on Artificial Inteligence,(IJCAI 2011), IJCAI/AAAI, Barcelona 2011.zobacz w PBN
• Anna Gambin, Piotr Dittwald, Jerzy Ostrowski i Jakub Karczmarski, Inferring serum proteolytic activity from LC, w: Proc. IEEE 1st International Conference on Computational Advances in Bio and medical Sciences (ICCABS), 2011.zobacz w PBN
• Piotr Wiśniewski, Marta Burzańska i Krzysztof Stencel, The Impedance Mismatch in Light of the Unified State Model, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• James F. Peters, Andrzej Skowron, Hiroshi Sakai, Mihir Kumar Chakraborty, Dominik Ślęzak, Aboul Ella Hassanien i William Zhu (red.), Transactions on Rough Sets XIV, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2011.zobacz w PBN
• Markku Laine i Wojciech Plandowski, Word Equations with One Unknown, International Journal Of Foundations Of Computer Science 22 (2) 2011, s. 345–375.zobacz w PBN
• H. Hansen i Bartosz Klin, Pointwise extensions of GSOS-defined operations, Mathematical Structures In Computer Science 21 (2) 2011, s. 321–361.zobacz w PBN
• Patryk Czarnik, Jacek Chrząszcz i Aleksy Schubert, A Dozen Instructions Make Java Bytecode, Electronic Notes In Theoretical Computer Science 264 (4) 2011, s. 19–34.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
• 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
• Andrzej Tarlecki, Some Nuances of Many-sorted Universal Algebra: A Review, w: Bulletin of the EATCS, Amsterdam 2011, s. 89–111.zobacz w PBN
• Barbara Dunin-Kęplicz, Alina Strachocka i Rineke Verbrugge, Modeling Deliberation in Teamwork, w: Commonsense, AAAI Press, 2011.zobacz w PBN
• Paweł Leszczyński i Krzysztof Stencel, Update Propagator for Joint Scalable Storage, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Marcin Szczuka, Ludwik Czaja, Andrzej Skowron i Magdalena Kacprzak (red.), CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk i Riste Skrekovski, On the Zagreb index inequality of graphs with prescribed vertex degrees, Discrete Applied Mathematics 159 (8) 2011, s. 852–858.zobacz w PBN
• Norbert Dojer, Przemysław Biecek i Jerzy Tiuryn, Bi-Billboard: Symmetrization and Careful Choice of Informant Species Results in Higher Accuracy of Regulatory Element Prediction, Journal Of Computational Biology 18 (6) 2011, s. 809–819.zobacz w PBN
• Małgorzata Bukała, Piotr Sankowski, Ryszard Buczko i Perła Kacman, Crystal and electronic structure of PbTe/CdTe nanostructures, Nanoscale Research Letters 6 (1) 2011, s. 1–7.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
• 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
• Joerg Kreiker, Andrzej Tarlecki, Moshe Vardi i Reinhard Wilhelm, Modeling, Analysis, and Verification: The Formal Methods Manifesto 2010, w: Dagstuhl Manifestos, Dagstuhl Publishing, Dagstuhl 2011, s. 21–40.zobacz w PBN
• Anna Gambin, Tomasz Gambin, Maciej Sykulski i Paweł Stankiewicz, Robustness of exon CGH array designs, w: Proc. Int Conf. on Bioinformatics Models, Methods and Algorithms Bioinformatics'11., 2011.zobacz w PBN
• Andrzej Zbrzezny i Agata Janowska, Towards Discrete-Time Verification of Time Petri Nets with Dense-Time Semantics, w: CS&P'2011, 20th International Workshop on Concurrency, Specification and Programming, Białystok University of Technology, Białystok 2011.zobacz w PBN
• Marcin Kubica i Jakub Radoszewski (red.), CEOI 2011. Tasks and Solutions, Komitet Główny Olimpiady Informatycznej, Gdynia 2011.zobacz w PBN
• Marcin Szczuka, Andrzej Skowron i Jarosław Stepaniuk, Function approximation and quality measures in rough-granular systems, Fundamenta Informaticae 109 (3) 2011, s. 339–354.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics, Journal Of Applied Non-classical Logics 21 (1) 2011, s. 61–81.zobacz w PBN
• Maciej Jończyk, Alicja Sobkowiak, Paweł Siedlecki, Przemysław Biecek, Joanna Trzcińska-Danielewicz, Jerzy Tiuryn, Jan Fronk i Paweł Sowiński, Rhythmic diel pattern of gene expression in juvenile maize leaf, Plos One 2011, s. 1.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
• 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
• Paweł Brach, Jacek Chrząszcz, Janusz Jabłonowski i Jakub Swiatły, A distributed service oriented system for GUI map generation, w: CompSysTech, 2011.zobacz w PBN
• Amos Fiat, Stefano Leonardi, Jared Saia i Piotr Sankowski, Single valued combinatorial auctions with budgets, w: ACM Conference on Electronic Commerce, 2011.zobacz w PBN
• Talal Rahwan, Tomasz Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge i Nicolas Jennings, Constrained Coalition Formation, w: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, AAAI Press, San Francisco 2011.zobacz w PBN
• Marcin Peczarski, Mikrokontrolery STM32 w sieci Ethernet w przykładach, Wydawnictwo BTC, Legionowo 2011.zobacz w PBN
• Marcin Konrad Dziubiński i Jaideep Roy, Electoral competition in 2-dimensional ideology space with unidimensional commitment, Social Choice And Welfare 36 (1) 2011, s. 1–24.zobacz w PBN
• Jan Małuszyński i Andrzej Szałas, Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation, Journal Of Applied Non-classical Logics 21 (2) 2011, s. 211–232.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 6804 2011, s. 465–475.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 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
• Eryk Kopczyński, Trees in Trees: Is the Incomplete Information about a Tree Consistent?, w: CSL, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele i Piotr Sankowski, Stochastic query covering, w: WSDM, ACM, Hong Kong 2011.zobacz w PBN
• Paweł Brach, Jacek Chrząszcz, Janusz Jabłonowski i Jakub Światly, Cartographer: Architecture of a Distributed System for Automated GUI Map Generation, w: Proceedings of The International Multi-Conference of Engineers and Computer Scientists 2011, Hong Kong 2011.zobacz w PBN
• Maciej Sysło, Wojciech Cellary, Krzysztof Diks, Andrzej Szałas, Jan Madey, Marcin Engel, Ryszard Tadeusiewicz, Jerzy Gawinecki, Piotr Sienkiewicz i Zenon Gniazdowski (red.), Podstawy algorytmiki. Zastosowania informatyki, Warszawska Wyższa Szkoła Informatyki, Warszawa 2011.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica 59 (2) 2011, s. 240–255.zobacz w PBN
• Jacek Sroka, Łukasz Krupa, Andrzej Kierzek i Jerzy Tyszkiewicz, CalcTav - Integration of a Spreadsheet and Taverna Workbench, Bioinformatics 27 (18) 2011, s. 2618–2619.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
• 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
• 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
• Luc Segoufin i Szymon Toruńczyk, Automata based verification over linearly ordered data domains, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Anna Gambin, Maciej Sykulski, Sławomir Lasota, Michał Startek, Gregory Kucherov i Laurent Noe, Subset seed extension to protein BLAST, w: Proc. Int. Conf. on Bioinformatics Models, Methods and Algorithms Bioinformatics'11., 2011.zobacz w PBN
• Michal R. Przybyłek, Skeletal Algorithms, w: International Conference on Evolutionary Computation Theory and Applications, SciTePress, Paris 2011.zobacz w PBN
• Ludwik Czaja, MAGDALENA KACPRZAK, Andrzej Skowron i Marcin Szczuka (red.), Cuncurrency, Specification and Programming CS&P 2011, 2011.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, On Word Equations in One Variable, Algorithmica 60 (4) 2011, s. 819–828.zobacz w PBN
• Michał Woźniak, L. Wong i Jerzy Tiuryn, CAMBerVis: visualization software to support comparative analysis of multiple bacterial strains, Bioinformatics 27 (23) 2011, s. 3313–3314.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
• 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
• 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
• Paweł Parys, Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Anna Gambin, Sławomir Lasota, Michał Lula i Mikołaj Rybiński, Tav4SB: grid environment for analysis of kinetic models of biological systems, w: International Symposium on Bioinformatics Research and Applications (ISBRA), 2018.zobacz w PBN
• Jacek Sroka, Piotr Chrząstowski-Wachtel i Jan Hidders, On generating *-sound nets with substitution, w: Proceedings ot the International Conference on Application of Concurrency to System Design (ACSD) 2011, IEEE Computer Society, Los Alamitos 2011.zobacz w PBN
• Hung Son Nguyen, Sankar K. Pal i Andrzej Skowron (red.), Rough set and fuzzy sets in natural computing/Preface. Special issue of Theoretical Computer Science 412, 2011.zobacz w PBN
• Bartosz Klin, Bialgebras for structural operational semantics: an introduction, Theoretical Computer Science 412 (38) 2011, s. 5043–5069.zobacz w PBN
• Jakub Pawlewicz, Towards Optimal Play in Multi-Player Yahtzee, Icga Journal 34 (1) 2011, s. 7–21.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 prototype system for rule generation in Lipski's incomplete information databases, Lecture Notes In Computer Science 6743 2011, s. 175–182.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
• Mikołaj Bojańczyk, Data Monoids, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
• Son Thanh Cao, Linh Anh Nguyen i Andrzej Szałas, WORL: a Web Ontology Rule Language, w: KSE 2011 - International Conference on Knowledge and Systems Engineering, 2011.zobacz w PBN
• Stefan Dziembowski, Tomasz Kazana, Daniel Wichs i Tomasz Piotr Kazana, One-Time Computable Self-erasing Functions, w: Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings, 2011, s. 125–143.zobacz w PBN