Publikacje

Czasopismo: Information And Computation

Liczba publikacji: 16

2017

• Marek Adam Cygan, Daniel Marx, Marcin Pilipczuk i Michał Pilipczuk, Hitting forbidden subgraphs in graphs of bounded treewidth, Information And Computation 256 2017, s. 62–82.zobacz w PBN
• Tomasz Gogacz, Henryk Michalewski, Matteo Mio i Michał Paweł Skrzypczak, Measure properties of regular sets of trees, Information And Computation 256 2017, s. 108–130.zobacz w PBN

2016

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

2015

• Marek Adam Cygan i Marcin Pilipczuk, Faster exponential-time algorithms in graphs of bounded average degree, Information And Computation 243 2015, s. 75–85.zobacz w PBN
• Hans L. Bodlaender, Marek Adam Cygan, Stefan Kratsch i Jesper Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information And Computation 243 2015, s. 86–111.zobacz w PBN

2013

• Bartosz Klin i V. Sassone, Structural operational semantics for stochastic and weighted transition systems, Information And Computation 227 (Complete) 2013, s. 58–83.zobacz w PBN
• Michał Paweł Skrzypczak, Topological extension of parity automata, Information And Computation 228 2013, s. 16–27.zobacz w PBN

2012

• Ken-etsu Fujita i Aleksy Schubert, The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types, Information And Computation 218 2012, s. 69–87.zobacz w PBN

2011

• Wojciech Czerwiński, Sibylle Froeschle i Sławomir Lasota, Partially-commutative context-free processes: expressibility and tractability, Information And Computation 209 (5) 2011, s. 782–798.zobacz w PBN

2010

• Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota i Zdenek Sawa, Non-interleaving bisimulation equivalences on Basic Parallel Processes, Information And Computation 208 (1) 2010, s. 42–62.zobacz w PBN

2009

• Bartosz Klin, Bialgebraic methods and modal logic in structural operational semantics, Information And Computation 207 (2) 2009, s. 237–257.zobacz w PBN

2007

• Wojciech Rytter, The number of runs in a string: improved analysis of the linear upper bound, Information And Computation 205 (9) 2007, s. 1459–1469.zobacz w PBN

2002

• Jerzy Tiuryn i Paweł Urzyczyn, The subtyping problem for second-order types is undecidable, Information And Computation 179 2002, s. 1–18.zobacz w PBN

2001

• Jerzy Tyszkiewicz, F. Neven, M. Otto i Jan Van den Bussche, Adding for-loops to first order logic, Information And Computation 168 (2) 2001, s. 156–186.zobacz w PBN
• Jerzy Tiuryn, A sequent calculus for subtyping polymorphic types, Information And Computation 164 (164) 2001, s. 345–369.zobacz w PBN