Publikacje

Czasopismo: Information Processing Letters

Liczba publikacji: 38

2018

• Stefan Dziembowski, Tomasz Kazana i Maciej Zdanowicz, Quasi chain rule for min-entropy, Information Processing Letters 134 2018, s. 62–66.zobacz w PBN
• Mirosław Kowaluk i Andrzej Lingas, Are unique subgraphs not easier to find?, Information Processing Letters 134 2018, s. 57–61.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 i Jakub Jan 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 i Tomasz Waleń, On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters 116 (3) 2016, s. 245–251.zobacz w PBN
• Paweł Parys, Weak Containment for Partial Words is coNP-Complete, Information Processing Letters 116 (2) 2016, s. 125–127.zobacz w PBN

2015

• Ivan Bliznets, Marek Adam Cygan, Paweł Komosa i Luk\'as Mach, Kernelization lower bound for Permutation Pattern Matching, Information Processing Letters 115 (5) 2015, s. 527–531.zobacz w PBN
• Fabrizio Grandoni, Tomasz Mirosław Kociumaka i Michał Włodarczyk, An LP-rounding 2\sqrt{2}-approximation for restricted maximum acyclic subgraph, Information Processing Letters 115 (2) 2015, s. 182–185.zobacz w PBN

2014

• Olivier Finkel i Michał Paweł Skrzypczak, On the Topological Complexity of w-Languages of Non-Deterministic Petri Nets, Information Processing Letters 114 (5) 2014, s. 229–233.zobacz w PBN
• Aleksy Andrzej Schubert i Ken-etsu Fujita, A note on subject reduction in (→, ∃)-curry with respect to complete developments, Information Processing Letters 114 (1-2) 2014.zobacz w PBN
• Tomasz Kociumaka i Marcin Pilipczuk, Faster deterministic Feedback Vertex Set, Information Processing Letters 114 (10) 2014, s. 556–560.zobacz w PBN
• Andrzej Tarlecki, Władysław Marek Turski (1938-2013), Information Processing Letters 114 (8) 2014, s. 397–398.zobacz w PBN

2013

• Marek Adam Cygan i Marcin Łukasz Pilipczuk, Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms, Information Processing Letters 113 (5-6) 2013, s. 179–182.zobacz w PBN
• Marcin Kubica, Tomasz Kulczyński, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters 113 (12) 2013, s. 430–433.zobacz w PBN
• Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński i 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

2012

• Vince Bárány i Mikołaj Bojańczyk, Finite satisfiability for guarded fixpoint logic, Information Processing Letters 112 (10) 2012, s. 371–375.zobacz w PBN

2011

• 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
• 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
• Marek Cygan i Łukasz Kowalik, Channel Assignment via Fast Zeta Transform, Information Processing Letters 111 (15) 2011, s. 727–730.zobacz w PBN

2010

• Marcin Balcerzak i Damian Niwiński, Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal, Information Processing Letters 110 (10) 2010, s. 396–398.zobacz w PBN

2009

• Leszek Gasieniec, Mirosław Kowaluk i Andrzej Lingas, Faster multi-witnesses for Boolean matrix multiplication, Information Processing Letters 109 (4) 2009, s. 242–247.zobacz w PBN
• Marek Cygan, Łukasz Kowalik i Mateusz Wykurz, Exponential-time approximation of weighted set cover, Information Processing Letters 109 (16) 2009, s. 957–961.zobacz w PBN
• Gerold Jäger i Marcin Peczarski, The number of pessimistic guesses in Generalized Mastermind, Information Processing Letters 109 (12) 2009, s. 635–641.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 109 (15) 2009, s. 850–855.zobacz w PBN

2007

• Mikołaj Bojańczyk, A new algorithm for testing if a regular language is locally threshold testable, Information Processing Letters 104 (3) 2007, s. 91–94.zobacz w PBN
• Łukasz Kowalik, Adjacency Queries in Dynamic Sparse Graphs, Information Processing Letters 102 (5) 2007, s. 191–195.zobacz w PBN
• Marcin Peczarski, The Ford--Johnson algorithm still unbeaten for less than 47 elements, Information Processing Letters 101 2007, s. 126–128.zobacz w PBN

2006

• Marcin Peczarski, An improvement of the tree code construction, Information Processing Letters 99 2006, s. 92–95.zobacz w PBN

2004

• Dirk Leinders, Jerzy Tyszkiewicz i Jan Van den Bussche, On the expressive power of semijoin queries, Information Processing Letters 91 (2) 2004, s. 93–98.zobacz w PBN
• Andrzej Tarlecki, Editorial, Information Processing Letters 90 2004, s. 1–2.zobacz w PBN

2003

• Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Relations between delta-matching and matching with don, Information Processing Letters 85 (5) 2003, s. 227–233.zobacz w PBN
• Jan Madey, WMT - From a Personal Perspective, Information Processing Letters 88 2003, s. 3–6.zobacz w PBN
• Jan Madey, WMT-from a personal perspective, Information Processing Letters 88 2003, s. 3–6.zobacz w PBN

2001

• Piotr Chrząstowski-Wachtel, Jerzy Tyszkiewicz, A. Hoffmann i A. Ramer, Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker, Information Processing Letters 79 (4) 2001, s. 155–160.zobacz w PBN

1992

• Andrzej Szałas, Axiomatizing Fixpoint Logics, Information Processing Letters 41 (4) 1992, s. 175–180.zobacz w PBN

1988

• Andrzej Szałas, An Incompleteness Result in Process Algebra, Information Processing Letters 29 (2) 1988, s. 67–70.zobacz w PBN
• Leszek Holenderski i Andrzej Szałas, Propositional Description of Finite Cause-Effect Structures, Information Processing Letters 27 (3) 1988, s. 111–117.zobacz w PBN

1987

• Andrzej Szałas, Arithmetical Axiomatization of First-Order Temporal Logic, Information Processing Letters 26 (3) 1987, s. 111–116.zobacz w PBN