Nie jesteś zalogowany | Zaloguj się

Czasopismo: Theoretical Computer Science

Liczba publikacji: 83

2022

Anna Zych-Pawlewicz , Piotr Sankowski , Dariusz Leniowski, Bartłomiej Bosek, A tight bound for shortest augmenting paths on trees, Theoretical Computer Science, 901 2022, s. 45-61. Zobacz w PBN

2021

Patryk Czajka, Jakub Radoszewski , Experimental evaluation of algorithms for computing quasiperiods, Theoretical Computer Science, 854 2021, s. 17-29. Zobacz w PBN
Shmuel T. Klein, Jakub Radoszewski , Tamar C. Serebro, Dana Shapira, Optimal skeleton and reduced Huffman trees, Theoretical Computer Science, 852 2021, s. 157--171. Zobacz w PBN
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Juliusz Straszyński , Shortest covers of all cyclic shifts of a string, Theoretical Computer Science, 866 2021, s. 70-81. Zobacz w PBN
Wojciech Rytter , Wiktor Zuba, Syntactic view of sigma-tau generation of permutations, Theoretical Computer Science, 2021. Zobacz w PBN

2020

Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski , Wing-Kin Sung, Faster algorithms for 1-mappability of a sequence, Theoretical Computer Science, 812 2020, s. 2-12. Zobacz w PBN
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron , Nimrod Talmon, Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting, Theoretical Computer Science, 2020. Zobacz w PBN
Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Universal reconstruction of a string, Theoretical Computer Science, 812 2020, s. 174-186. Zobacz w PBN

2019

Andrzej Lingas, Mirosław Kowaluk , A fast deterministic detection of small pattern graphs in graphs without large cliques, Theoretical Computer Science, 770 2019, s. 79-87. Zobacz w PBN
Jurek Czyzowicz, Jean Moussi, Krzysztof Diks , Wojciech Rytter , Energy-optimal broadcast and exploration in a tree using mobile agents, Theoretical Computer Science, 795 2019, s. 362-374. Zobacz w PBN
Dorota Osula, Paweł Rzążewski , Dariusz Dereniowski, Finding small-width connected path decompositions in polynomial time, Theoretical Computer Science, 794 2019, s. 85 - 100. Zobacz w PBN
Wojciech Plandowski , On PSPACE generation of a solution set of a word equation and its applications, Theoretical Computer Science, 792 2019, s. 20-61. Zobacz w PBN
Wojciech Plandowski , Aleksy Schubert , On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note), Theoretical Computer Science, 792 (5) 2019, s. 62-68. Zobacz w PBN
Maxime Crochemore, Jakub Radoszewski , Special issue in honor of the 70th birthday of Prof. Wojciech Rytter, Theoretical Computer Science, 792 2019, s. 1. Zobacz w PBN

2018

Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science, 710 2018, s. 139-147. Zobacz w PBN
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloffa, Pedro Montealegre, Paweł Rzążewski , Fixing improper colorings of graphs, Theoretical Computer Science, 711 2018, s. 66-78. Zobacz w PBN
Damian Repke, Wojciech Rytter , On Semi-perfect de Bruijn words, Theoretical Computer Science, 720 2018, s. 55-63. Zobacz w PBN
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science, 710 2018, s. 126-138. Zobacz w PBN
Piotr Hofman , Patrick Totzke, Trace inclusion for one-counter nets revisited, Theoretical Computer Science, 735 2018, s. 50-63. Zobacz w PBN

2017

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

2016

Łukasz Kowalik , Marthe Bonamy, A 13k-kernel for planar feedback vertex set via region decomposition, Theoretical Computer Science, 645 2016, s. 25-40. Zobacz w PBN
Ryan B. Hayward, Jakub Pawlewicz , Conspiracy number search with relative sibling scores, Theoretical Computer Science, 2016. Zobacz w PBN
Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science, 2016. Zobacz w PBN
Krzysztof Ziemiański , On execution spaces of PV-programs, Theoretical Computer Science, 2016. Zobacz w PBN
Łukasz Kowalik , Juho Lauri, On finding rainbow and colorful paths, Theoretical Computer Science, 628 2016, s. 110-114. Zobacz w PBN
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Order-preserving indexing, Theoretical Computer Science, 2016. Zobacz w PBN
Wojciech Rytter , Two fast constructions of compact representations of binary words with given set of periods, Theoretical Computer Science, 2016. Zobacz w PBN
Sławomir Lasota , Marcin Poturalski, Undecidability of performance equivalence of Petri nets, Theoretical Computer Science, 2016. Zobacz w PBN

2015

Mirosław Kowaluk , Peter Floderus, Andrzej Lingas, Eva-Marta Lundell, Induced subgraph isomorphism: Are some patterns substantially easier than others?, Theoretical Computer Science, 605 2015, s. 119-128. Zobacz w PBN
Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science, 2015. Zobacz w PBN
Mirosław Kowaluk , Gabriela Majewska, New sequential and parallel algorithms for computing the β-spectrum, Theoretical Computer Science, 590 2015, s. 73-85. Zobacz w PBN
Wojciech Rytter , Arseny Shur, Searching for Zimin patterns, Theoretical Computer Science, 2015. Zobacz w PBN
Edith Elkind, Piotr Faliszewski, Piotr Skowron , Lan Yu, The complexity of fully proportional representation for single-crossing electorates, Theoretical Computer Science, 2015. Zobacz w PBN

2014

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

2013

Marcin Kubica, Jakub Radoszewski , Bartosz Szreder, Tomasz Waleń , Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, Wojciech Rytter , Efficient seed computation revisited, Theoretical Computer Science, 483 (Complete) 2013, s. 171-181. Zobacz w PBN
Konstanty Junosza-Szaniawski, Paweł Rzążewski , Fast exact algorithm for L(2,1)-labeling of graphs, Theoretical Computer Science, 505 2013, s. 42-54. Zobacz w PBN

2012

Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Waleń , Improved algorithms for the range next value problem and applications, Theoretical Computer Science, 2012. Zobacz w PBN

2011

Marek Cygan , Geevarghese Philip, Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Dominating set is fixed parameter tractable in claw-free graphs, Theoretical Computer Science, 2011. Zobacz w PBN
Gudmund Frandsen, Piotr Sankowski , Dynamic normal forms and dynamic characteristic polynomial, Theoretical Computer Science, 2011. Zobacz w PBN
Marcin Szczuka, Dominik Ślęzak , Feedforward neural networks for compound signals, Theoretical Computer Science, 2011. Zobacz w PBN

2010

Marek Cygan , Marcin Pilipczuk , Exact and approximate bandwidth, Theoretical Computer Science, 2010. Zobacz w PBN

2009

Paweł Baturo, Wojciech Rytter , Compressed string-matching in standard Sturmian words, Theoretical Computer Science, 2009. Zobacz w PBN
Łukasz Kowalik , Marcin Mucha , Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science, 2009. Zobacz w PBN
Łukasz Kowalik , Improved edge-coloring with three colors, Theoretical Computer Science, 2009. Zobacz w PBN
Piotr Sankowski , Maximum weight bipartite matching in matrix multiplication time, Theoretical Computer Science, 2009. Zobacz w PBN
Elena Czeizler, Wojciech Plandowski , On systems of word equations over three unknowns with at most six occurrences of one of the unknowns, Theoretical Computer Science, 2009. Zobacz w PBN
Lars Arge, Christian Cachin, Andrzej Tarlecki , Preface, Theoretical Computer Science, 2009. Zobacz w PBN
Maxime Crochemore, Lucian Ilie, Wojciech Rytter , Repetitions in strings: Algorithms and combinatorics, Theoretical Computer Science, 2009. Zobacz w PBN
Marek Biskup, Wojciech Plandowski , Shortest synchronizing strings for Huffman codes, Theoretical Computer Science, 2009. Zobacz w PBN

2007

Sibylle Froeschle, Sławomir Lasota , Causality Versus True-Concurrency, Theoretical Computer Science, 2007. Zobacz w PBN
Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Equivalence of simple functions, Theoretical Computer Science, 2007. Zobacz w PBN
Artur Czumaj, Mirosław Kowaluk , Andrzej Lingas, Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science, 2007. Zobacz w PBN

2006

Sławomir Lasota , Decidability of Performance Equivalence for Basic Parallel Processes, Theoretical Computer Science, 2006. Zobacz w PBN
Paweł Górecki , Jerzy Tiuryn , DLS-trees: a model of evolutionary scenarios, Theoretical Computer Science, 2006. Zobacz w PBN
Anh Linh Nguyen , Multimodal Logic Programming, Theoretical Computer Science, 2006. Zobacz w PBN
Thomas Colcombet, Damian Niwiński , On the positional determinacy of edge-labeled games, Theoretical Computer Science, 2006. Zobacz w PBN
Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter , Prime normal form and equivalence of simple grammars, Theoretical Computer Science, 2006. Zobacz w PBN
Wojciech Rytter , The structure of subword graphs and suffix trees of Fibonacci words, Theoretical Computer Science, 2006. Zobacz w PBN
Mikołaj Bojańczyk , Thomas Colcombet, Tree-walking automata cannot be determinized, Theoretical Computer Science, 2006. Zobacz w PBN

2005

Piotr Hoffman, Bartosz Klin , Till Mossakowski, Lutz Schroeder, Andrzej Tarlecki , Amalgamation in the semantics of CASL, Theoretical Computer Science, 2005. Zobacz w PBN
Juhani Karhumäki, Wojciech Plandowski , Wojciech Rytter , On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science, 2005. Zobacz w PBN

2004

Zofia Adamowicz, Leszek Kołodziejczyk , Well-behaved principles alternative to bounded induction, Theoretical Computer Science, 2004. Zobacz w PBN

2003

Juhani Karhumaeki, Jan Manuch, Wojciech Plandowski , A defect theorem for bi-infinite words, Theoretical Computer Science, 2003. Zobacz w PBN
Damian Niwiński , Igor Walukiewicz, A gap property of deterministic tree languages, Theoretical Computer Science, 2003. Zobacz w PBN
Wojciech Rytter , Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science, 2003. Zobacz w PBN
Wojciech Rytter , On maximal suffices and constant space versions of KMP algorithm, Theoretical Computer Science, 2003. Zobacz w PBN
Artur Czumaj, Leszek Gasieniec, Daya Gaur, Ramesh Krishnamurti, Wojciech Rytter , Michele Zito, On polynomial-time approximation algorithms for the variable length scheduling problem, Theoretical Computer Science, 2003. Zobacz w PBN
Mikołaj Bojańczyk , The Finite Graph Problem for Two-Way Alternating Automata, Theoretical Computer Science, 2003. Zobacz w PBN

2002

E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brueckner, P. Mosses, D. Sannella, Andrzej Tarlecki , CASL: The Common Algebraic Specification Language, Theoretical Computer Science, 2002. Zobacz w PBN
Sławomir Lasota , Coalgebra morphisms subsume open maps, Theoretical Computer Science, 2002. Zobacz w PBN
Krzysztof Diks , E. Kranakis, D. Krizanc, A. Pelc, The impact of information on broadcasting time in linear radio networks, Theoretical Computer Science, 2002. Zobacz w PBN

2001

David Lee, Henryk Woźniakowski , Approximate evaluations of characteristic polynomials of Boolean functions., Theoretical Computer Science, 2001. Zobacz w PBN
A. Czumaj, I. Finch, A. Gibbons, L. Gąsieniec, P. Leng, Wojciech Rytter , M. Zito, Efficient web searching using temporal factors, Theoretical Computer Science, 2001. Zobacz w PBN

2000

Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk , Wojciech Plandowski , Algorithms for the parallel alternating direction access machine, Theoretical Computer Science, 2000. Zobacz w PBN

1997

Stefan Kahrs, Donald Sannella, Andrzej Tarlecki , The definition of Extended ML: A gentle introduction, Theoretical Computer Science, 1997. Zobacz w PBN

1991

Andrzej Szałas , On Strictly Arithmetical Completeness in Logics of Programs, Theoretical Computer Science, 1991. Zobacz w PBN

1988

Leszek Holenderski, Andrzej Szałas , Incompleteness of First-Order Temporal Logic with Until, Theoretical Computer Science, 1988. Zobacz w PBN

1987

Andrzej Szałas , A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time, Theoretical Computer Science, 1987. Zobacz w PBN