Publikacje

Czasopismo: Information and Computation

Liczba publikacji: 26

2023

• Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski , Sophie Spirkl, Mingxian Zhong, Complexity of C-coloring in hereditary classes of graphs, Information and Computation, 292 2023, s. 1-19. Zobacz w PBN

2022

• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , A periodicity lemma for partial words, Information and Computation, 283 2022, s. 104677. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , WANDA ZUBA, Efficient representation and counting of antipower factors in words, Information and Computation, 286 2022, s. 104779: 1-18. Zobacz w PBN
• Georg Struth, Krzysztof Ziemiański , Uli Fahrenberg, Christian Johansen, Posets with interfaces as a model for concurrency, Information and Computation, 285 2022, s. 104914. Zobacz w PBN
• Paweł Parys , The Caucal hierarchy: Interpretations in the (W)MSO+U logic, Information and Computation, 286 2022, s. 104782. Zobacz w PBN

2021

• Mikołaj Bojańczyk , Thomas Brihaye, Christoph Haase, Sławomir Lasota , Joel Ouaknine, Igor Potapov, Preface, Information and Computation, 277 2021, s. 104579. Zobacz w PBN
• Marcin Przybyłko, Michał Skrzypczak , The uniform measure of simple regular sets of infinite trees, Information and Computation, 278 2021, s. 104595,1-24. Zobacz w PBN

2020

• Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski , Indexing weighted sequences: Neat and efficient, Information and Computation, 270 2020, s. 104462. Zobacz w PBN
• Jakub Radoszewski , Tatiana Starikovskaya, Streaming k-mismatch with error correcting and applications, Information and Computation, 271 2020, s. 104513. Zobacz w PBN
• Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Arseny Shur, Tomasz Waleń , String periods in the order-preserving model, Information and Computation, 270 2020, s. 104463. Zobacz w PBN
• Radosław Piórkowski, Sławomir Lasota , WQO dichotomy for 3-graphs, Information and Computation, 275 2020, s. 104541. Zobacz w PBN

2019

• Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski , On-line weighted pattern matching, Information and Computation, 266 2019, s. 49-59. Zobacz w PBN

2017

• Piotr Skowron , FPT approximation schemes for maximizing submodular functions, Information and Computation, 2017. Zobacz w PBN
• Marek Cygan , Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Hitting forbidden subgraphs in graphs of bounded treewidth, Information and Computation, 256 2017, s. 62-82. Zobacz w PBN
• Tomasz Gogacz, Matteo Mio, Michał Skrzypczak , Henryk Michalewski , Measure properties of regular sets of trees, Information and Computation, 256 2017, s. 108-130. Zobacz w PBN

2016

• Wojciech Plandowski , Volker Diekert, Artur Jeż, Finding all solutions of equations in free groups and monoids with involution, Information and Computation, (251) 2016, s. 263-286. Zobacz w PBN
• Jacek Chrząszcz, Aleksy Schubert , The role of polymorphism in the characterisation of complexity by soft types, Information and Computation, 2016. Zobacz w PBN

2015

• Hans L. Bodlaender, Marek Cygan , Stefan Kratsch, Jesper Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, 2015. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Faster exponential-time algorithms in graphs of bounded average degree, Information and Computation, 2015. Zobacz w PBN

2013

• Michał Skrzypczak , Topological extension of parity automata, Information and Computation, 228 2013, s. 16-27. Zobacz w PBN

2012

• Ken-etsu Fujita, Aleksy Schubert , The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types, Information and Computation, 2012. Zobacz w PBN

2011

• Wojciech Czerwiński, Sibylle Froeschle, Sławomir Lasota , Partially-commutative context-free processes: expressibility and tractability, Information and Computation, 2011. Zobacz w PBN

2010

• Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota , Zdenek Sawa, Non-interleaving bisimulation equivalences on Basic Parallel Processes, Information and Computation, 2010. Zobacz w PBN

2007

• Wojciech Rytter , The number of runs in a string: improved analysis of the linear upper bound, Information and Computation, 2007. Zobacz w PBN

2002

• Jerzy Tiuryn , Paweł Urzyczyn , The subtyping problem for second-order types is undecidable, Information and Computation, 2002. Zobacz w PBN

2001

• F. Neven, M. Otto, Jerzy Tyszkiewicz , Jan Van den Bussche, Adding for-loops to first order logic, Information and Computation, 2001. Zobacz w PBN