Publikacje

Czasopismo: Theoretical Computer Science

Liczba publikacji: 79

2018

• Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science 710 2018, s. 126–138.zobacz w PBN
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science 710 2018, s. 139–147.zobacz w PBN
• Wojciech Plandowski i Aleksy Andrzej Schubert, On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note), Theoretical Computer Science 2018.zobacz w PBN
• Damian Repke i Wojciech Rytter, On Semi-perfect de Bruijn words, Theoretical Computer Science 720 2018, s. 55–63.zobacz w PBN
• Wojciech Plandowski, On PSPACE generation of a solution set of a word equation and its applications, Theoretical Computer Science 2018.zobacz w PBN

2017

• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Covering problems for partial words and for indeterminate strings, Theoretical Computer Science 698 2017, s. 25–39.zobacz w PBN

2016

• Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science 648 2016, s. 84–95.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 indexing, Theoretical Computer Science 638 2016, s. 122–135.zobacz w PBN
• Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre i Élise Prieur-Gaston, Fast computation of Abelian runs, Theoretical Computer Science 656, Part B 2016, s. 256–264.zobacz w PBN
• Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka, Ignat Kolesnichenko i Tatiana Starikovskaya, Computing minimal and maximal suffixes of a substring, Theoretical Computer Science 638 2016, s. 112–121.zobacz w PBN
• Krzysztof Ziemiański, On execution spaces of PV-programs, Theoretical Computer Science 619 (2016) 2016, s. 87–98.zobacz w PBN
• Jakub Pawlewicz i Ryan B. Hayward, Conspiracy number search with relative sibling scores, Theoretical Computer Science 644 2016, s. 127–142.zobacz w PBN
• Wojciech Rytter, Two fast constructions of compact representations of binary words with given set of periods, Theoretical Computer Science 656, Part B 2016, s. 180–187.zobacz w PBN
• Aistis Atminas, Marcin Kamiński i Jean-Florent Raymond, Scattered packings of cycles, Theoretical Computer Science 647 2016, s. 33–42.zobacz w PBN
• Sławomir Lasota i Marcin Poturalski, Undecidability of performance equivalence of Petri nets, Theoretical Computer Science 655 2016, s. 109–119.zobacz w PBN
• Łukasz Kowalik i Juho Lauri, On finding rainbow and colorful paths, Theoretical Computer Science 628 2016, s. 110–114.zobacz w PBN
• Marthe Bonamy i Łukasz Kowalik, A 13k-kernel for planar feedback vertex set via region decomposition, Theoretical Computer Science 645 2016, s. 25–40.zobacz w PBN

2015

• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science 602 2015, s. 7–21.zobacz w PBN
• Marcin Peczarski i Gerold Jäger, Bounding memory for mastermind might not make it harder, Theoretical Computer Science (596) 2015, s. 55–66.zobacz w PBN
• Arseny Shur i Wojciech Rytter, Searching for Zimin patterns, Theoretical Computer Science 571 2015, s. 50–57.zobacz w PBN
• Mirosław Kowaluk i Gabriela Majewska, New sequential and parallel algorithms for computing the β-spectrum, Theoretical Computer Science 590 2015, s. 73–85.zobacz w PBN
• Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Induced subgraph isomorphism: Are some patterns substantially easier than others?, Theoretical Computer Science 605 2015, s. 119–128.zobacz w PBN

2014

• Łukasz Kowalik i Marcin Ireneusz Mucha, A 9k kernel for nonseparating independent set in planar graphs, Theoretical Computer Science 2014.zobacz w PBN
• Ken-etsu Fujita i Aleksy Andrzej Schubert, Existential type systems between Church and Curry style (type-free style), Theoretical Computer Science 549 2014, s. 17–35.zobacz w PBN
• Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient counting of square substrings in a tree, Theoretical Computer Science 544 2014, s. 60–73.zobacz w PBN
• Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco i Piotr Sankowski, The ring design game with fair cost allocation, Theoretical Computer Science 2014.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Extracting powers and periods in a word from its runs structure, Theoretical Computer Science 521 (Complete) 2014, s. 29–41.zobacz w PBN

2013

• Tomas Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth i Wojciech Tyczyński, Enhanced string covering, Theoretical Computer Science 506 2013, s. 102–114.zobacz w PBN
• Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient seed computation revisited, Theoretical Computer Science 483 (Complete) 2013, s. 171–181.zobacz w PBN
• P.A. Golovach, Marcin Kamiński, D. Paulusma i D.M. Thilikos, Increasing the minimum degree of a graph by contractions, Theoretical Computer Science 481 (Complete) 2013, s. 74–84.zobacz w PBN

2012

• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler i Tomasz Waleń, Improved algorithms for the range next value problem and applications, Theoretical Computer Science 434 2012, s. 23–34.zobacz w PBN
• Andrzej Skowron i Piotr Wasilewski, Interactive information systems: Toward perception based computing, Theoretical Computer Science 454 2012, s. 240–260.zobacz w PBN

2011

• Bartosz Klin, Bialgebras for structural operational semantics: an introduction, Theoretical Computer Science 412 (38) 2011, s. 5043–5069.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
• 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
• Dominik Ślęzak i Marcin Szczuka, Feedforward neural networks for compound signals, Theoretical Computer Science 412 (42) 2011, s. 5960–5973.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

2010

• Marek Cygan i Marcin Pilipczuk, Exact and approximate bandwidth, Theoretical Computer Science 411 (40-42) 2010, s. 3701–3713.zobacz w PBN

2009

• Piotr Sankowski, Maximum weight bipartite matching in matrix multiplication time, Theoretical Computer Science 410 (44) 2009, s. 4480–4488.zobacz w PBN
• Maxime Crochemore, Lucian Ilie i Wojciech Rytter, Repetitions in strings: Algorithms and combinatorics, Theoretical Computer Science 410 (50) 2009, s. 5227–5235.zobacz w PBN
• Lars Arge, Christian Cachin i Andrzej Tarlecki, Preface, Theoretical Computer Science 410 (18) 2009.zobacz w PBN
• Łukasz Kowalik, Improved edge-coloring with three colors, Theoretical Computer Science 410 (38-40) 2009, s. 3733–3742.zobacz w PBN
• Marek Biskup i Wojciech Plandowski, Shortest synchronizing strings for Huffman codes, Theoretical Computer Science 410 (38-40) 2009, s. 3925–3941.zobacz w PBN
• Elena Czeizler i Wojciech Plandowski, On systems of word equations over three unknowns with at most six occurrences of one of the unknowns, Theoretical Computer Science 410 (30-32) 2009, s. 2889–2909.zobacz w PBN
• Paweł Baturo i Wojciech Rytter, Compressed string-matching in standard Sturmian words, Theoretical Computer Science 410 (30-32) 2009, s. 2804–2810.zobacz w PBN
• Łukasz Kowalik i Marcin Mucha, Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science 410 2009, s. 5000–5009.zobacz w PBN

2008

• Dariusz R. Kowalski i Adam Malinowski, How to meet in anonymous network, Theoretical Computer Science 399 (1-2) 2008, s. 141–156.zobacz w PBN

2007

• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Equivalence of simple functions, Theoretical Computer Science 376 (1) 2007, s. 42–51.zobacz w PBN
• Sibylle Froeschle i Sławomir Lasota, Causality Versus True-Concurrency, Theoretical Computer Science 386 2007, s. 169–187.zobacz w PBN
• Artur Czumaj, Mirosław Kowaluk i Andrzej Lingas, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science 380 (1) 2007, s. 37–46.zobacz w PBN

2006

• Mikołaj Bojańczyk i Thomas Colcombet, Tree-walking automata cannot be determinized, Theoretical Computer Science 350 (3) 2006, s. 164–173.zobacz w PBN
• Sławomir Lasota, Decidability of Performance Equivalence for Basic Parallel Processes, Theoretical Computer Science 360 (1-3) 2006, s. 172–192.zobacz w PBN
• Anh Linh Nguyen, Multimodal Logic Programming, Theoretical Computer Science 360 2006, s. 247–288.zobacz w PBN
• Paweł Górecki i Jerzy Tiuryn, DLS-trees: a model of evolutionary scenarios, Theoretical Computer Science 359 (1-3) 2006, s. 378–399.zobacz w PBN
• Wojciech Rytter, The structure of subword graphs and suffix trees of Fibonacci words, Theoretical Computer Science 363 2006, s. 211–223.zobacz w PBN
• Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak i Wojciech Rytter, Prime normal form and equivalence of simple grammars, Theoretical Computer Science 363 (2) 2006, s. 124–134.zobacz w PBN
• Thomas Colcombet i Damian Niwiński, On the positional determinacy of edge-labeled games, Theoretical Computer Science 352 (3) 2006, s. 190–196.zobacz w PBN

2005

• Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin i Piotr Hoffman, Amalgamation in the semantics of CASL, Theoretical Computer Science 331 2005, s. 215–247.zobacz w PBN
• Lutz Schroeder, Till Mossakowski, Andrzej Tarlecki, Piotr Hoffman i Bartosz Klin, Amalgamation in the semantics of CASL, Theoretical Computer Science 331 (1) 2005, s. 215–247.zobacz w PBN
• Juhani Karhumäki, Wojciech Plandowski i Wojciech Rytter, On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science 337 (1-3) 2005, s. 105–118.zobacz w PBN

2004

• Zofia Adamowicz i Leszek Aleksander Kołodziejczyk, Well-behaved principles alternative to bounded induction, Theoretical Computer Science 322 2004, s. 5–16.zobacz w PBN

2003

• Mikołaj Bojańczyk, The Finite Graph Problem for Two-Way Alternating Automata, Theoretical Computer Science 298 (3) 2003, s. 511–528.zobacz w PBN
• Artur Czumaj, Leszek Gasieniec, Daya Gaur, Ramesh Krishnamurti, Wojciech Rytter i Michele Zito, On polynomial-time approximation algorithms for the variable length scheduling problem, Theoretical Computer Science 302 2003, s. 489–495.zobacz w PBN
• Juhani Karhumaeki, Jan Manuch i Wojciech Plandowski, A defect theorem for bi-infinite words, Theoretical Computer Science 292 (1) 2003, s. 237–243.zobacz w PBN
• Damian Niwiński i Igor Walukiewicz, A gap property of deterministic tree languages, Theoretical Computer Science 303 2003, s. 215–231.zobacz w PBN
• Wojciech Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science 299 (1-3) 2003, s. 763–774.zobacz w PBN
• Wojciech Rytter, On maximal suffices and constant space versions of KMP algorithm, Theoretical Computer Science 302 2003, s. 211–222.zobacz w PBN

2002

• Andrzej Tarlecki, E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brueckner, P. Mosses i D. Sannella, CASL: The Common Algebraic Specification Language, Theoretical Computer Science 286 (2) 2002, s. 153–196.zobacz w PBN
• Krzysztof Diks, E. Kranakis, D. Krizanc i A. Pelc, The impact of information on broadcasting time in linear radio networks, Theoretical Computer Science 287 (2) 2002, s. 449–471.zobacz w PBN
• Sławomir Lasota, Coalgebra morphisms subsume open maps, Theoretical Computer Science 280 2002, s. 123–135.zobacz w PBN
• Egidio Astesiano, Michel Bidoit, Hélène Kirchner, Bernd Krieg-Brückner, Peter D. Mosses, Donald Sannella i Andrzej Tarlecki, CASL: the Common Algebraic Specification Language, Theoretical Computer Science 286 2002, s. 153–196.zobacz w PBN

2001

• A. Czumaj, I. Finch, L. Gąsieniec, A. Gibbons, P. Leng, Wojciech Rytter i M. Zito, Efficient web searching using temporal factors, Theoretical Computer Science 262 (1) 2001, s. 569–582.zobacz w PBN
• Henryk Woźniakowski i David Lee, Approximate evaluations of characteristic polynomials of Boolean functions., Theoretical Computer Science 262 (1-2) 2001, s. 37–68.zobacz w PBN

2000

• Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk i Wojciech Plandowski, Algorithms for the parallel alternating direction access machine, Theoretical Computer Science 245 (2) 2000, s. 151–173.zobacz w PBN

1997

• Stefan Kahrs, Donald Sannella i Andrzej Tarlecki, The definition of Extended ML: A gentle introduction, Theoretical Computer Science 173 1997, s. 445–484.zobacz w PBN

1991

• Andrzej Szałas, On Strictly Arithmetical Completeness in Logics of Programs, Theoretical Computer Science 79 (2) 1991, s. 341–355.zobacz w PBN

1988

• Leszek Holenderski i Andrzej Szałas, Incompleteness of First-Order Temporal Logic with Until, Theoretical Computer Science 57 1988, s. 317–325.zobacz w PBN

1987

• Andrzej Szałas, A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time, Theoretical Computer Science 54 1987, s. 199–214.zobacz w PBN

1986

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