Publikacje

Czasopismo: Information Processing Letters

Liczba publikacji: 35

2021

• Matthias Englert, Ranko Lazić, Jérôme Leroux, Sławomir Lasota , Piotr Hofman , Juliusz Straszyński , A lower bound for the coverability problem in acyclic pushdown VAS, Information Processing Letters, 167 2021, s. 106079:1-5. Zobacz w PBN

2020

• Andrzej Lingas, Mirosław Kowaluk , A simple approach to nondecreasing paths, Information Processing Letters, 162 2020, s. 105992. Zobacz w PBN
• Marcin Mucha , Marcin Smulewicz, Improved approximation for Fractionally Subadditive Network Design, Information Processing Letters, 154 2020, s. 105861. Zobacz w PBN

2018

• Mirosław Kowaluk , Andrzej Lingas, Are unique subgraphs not easier to find?, Information Processing Letters, 134 2018, s. 57-61. Zobacz w PBN
• Stefan Dziembowski , Tomasz Kazana , Maciej Zdanowicz, Quasi chain rule for min-entropy, Information Processing Letters, 134 2018, s. 62-66. Zobacz w PBN

2017

• Sławomir Lasota , Equivariant algorithms for constraint satisfaction problems over coset templates, Information Processing Letters, 118 2017, s. 44-52. Zobacz w PBN
• Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski , Two strings at Hamming distance 1 cannot be both quasiperiodic, Information Processing Letters, 128 2017, s. 54-57. Zobacz w PBN

2016

• Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters, 2016. Zobacz w PBN
• Paweł Parys , Weak Containment for Partial Words is coNP-Complete, Information Processing Letters, 2016. Zobacz w PBN

2015

• Fabrizio Grandoni, Tomasz Kociumaka, Michał Włodarczyk , An LP-rounding 2\sqrt{2}-approximation for restricted maximum acyclic subgraph, Information Processing Letters, 2015. Zobacz w PBN
• Ivan Bliznets, Marek Cygan , Paweł Komosa, Luk\'as Mach, Kernelization lower bound for Permutation Pattern Matching, Information Processing Letters, 2015. Zobacz w PBN

2014

• Ken-etsu Fujita, Aleksy Schubert , A note on subject reduction in (→, ∃)-Curry with respect to complete developments, Information Processing Letters, 2014. Zobacz w PBN
• Tomasz Kociumaka, Marcin Pilipczuk , Faster deterministic Feedback Vertex Set, Information Processing Letters, 2014. Zobacz w PBN
• Olivier Finkel, Michał Skrzypczak , On the Topological Complexity of w-Languages of Non-Deterministic Petri Nets, Information Processing Letters, 2014. Zobacz w PBN
• Andrzej Tarlecki , Władysław Marek Turski (1938-2013), Information Processing Letters, 2014. Zobacz w PBN

2013

• Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Kulczyński, Tomasz Waleń , A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters, 113 (12) 2013, s. 430-433. Zobacz w PBN
• Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Kociumaka, Jakub Pachocki, Wojciech Tyczyński, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Waleń , A note on efficient computation of all Abelian periods in a string, Information Processing Letters, 113 (3) 2013, s. 74-77. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms, Information Processing Letters, 2013. Zobacz w PBN

2012

• Mikołaj Bojańczyk , Vince Bárány, Finite satisfiability for guarded fixpoint logic, Information Processing Letters, 2012. Zobacz w PBN

2011

• Marek Cygan , Marcin Pilipczuk , Jakub Wojtaszczyk, Capacitated domination faster than O(2^n), Information Processing Letters, 2011. Zobacz w PBN
• Marek Cygan, Łukasz Kowalik , Channel assignment via fast zeta transform, Information Processing Letters, 2011. Zobacz w PBN

2010

• Marcin Balcerzak, Damian Niwiński , Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal, Information Processing Letters, 2010. Zobacz w PBN

2009

• Marek Cygan, Łukasz Kowalik , Mateusz Wykurz, Exponential-time approximation of weighted set cover, Information Processing Letters, 2009. Zobacz w PBN
• Sławomir Lasota , EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters, 2009. Zobacz w PBN
• Leszek Gasieniec, Mirosław Kowaluk , Andrzej Lingas, Faster multi-witnesses for Boolean matrix multiplication, Information Processing Letters, 2009. Zobacz w PBN

2007

• Mikołaj Bojańczyk , A new algorithm for testing if a regular language is locally threshold testable, Information Processing Letters, 2007. Zobacz w PBN
• Łukasz Kowalik , Adjacency Queries in Dynamic Sparse Graphs, Information Processing Letters, 2007. Zobacz w PBN

2004

• Andrzej Tarlecki , Editorial, Information Processing Letters, 2004. Zobacz w PBN
• Dirk Leinders, Jerzy Tyszkiewicz , Jan Van den Bussche, On the expressive power of semijoin queries, Information Processing Letters, 2004. Zobacz w PBN

2003

• Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski , Wojciech Rytter , Relations between delta-matching and matching with don, Information Processing Letters, 2003. Zobacz w PBN

2001

• Piotr Chrząstowski-Wachtel, A. Hoffmann, A. Ramer, Jerzy Tyszkiewicz , Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker, Information Processing Letters, 2001. Zobacz w PBN

1992

• Andrzej Szałas , Axiomatizing Fixpoint Logics, Information Processing Letters, 1992. Zobacz w PBN

1988

• Andrzej Szałas , An Incompleteness Result in Process Algebra, Information Processing Letters, 1988. Zobacz w PBN
• Leszek Holenderski, Andrzej Szałas , Propositional Description of Finite Cause-Effect Structures, Information Processing Letters, 1988. Zobacz w PBN

1987

• Andrzej Szałas , Arithmetical Axiomatization of First-Order Temporal Logic, Information Processing Letters, 1987. Zobacz w PBN