Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Czasopismo: Information Processing Letters
Liczba publikacji: 38
2018
2017
2016
2015
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
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
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
2006
2004
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
1992
1988
1987