Publikacje

Czasopismo: Journal Of The Acm

Liczba publikacji: 10

2018

• Wojciech Czerwiński, Wim Martens, Matthias Niewerth i Paweł Parys, Minimization of Tree Patterns, Journal Of The Acm 65 (4) 2018, s. 26:1–26:46.zobacz w PBN
• Stefan Dziembowski, Krzysztof Pietrzak i Daniel Wichs, Non-Malleable Codes, Journal Of The Acm 65 (4) 2018, s. 20:1–20:32.zobacz w PBN
• Marek Adam Cygan, Stefan Kratsch i Jesper Nederlof, Fast Hamiltonicity Checking Via Bases of Perfect Matchings, Journal Of The Acm 12 2018, s. 1:46.zobacz w PBN

2017

• Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki i Arkadiusz Aleksander Socała, Tight Lower Bounds on Graph Embedding Problems, Journal Of The Acm 64 (3) 2017, s. 18:1–18:22.zobacz w PBN

2015

• Marek Adam Cygan, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, Journal Of The Acm 62 (4) 2015, s. 28.zobacz w PBN

2014

• Shun'ichi Amano, Claire David, Leonid Libkin i Filip Murlak, XML Schema Mappings: Data Exchange and Metadata Management, Journal Of The Acm 61 (2) 2014, s. 12.zobacz w PBN

2011

• Paweł Parys i Mikołaj Bojańczyk, XPath Evaluation in Linear Time, Journal Of The Acm 58 (4) 2011, s. 17.zobacz w PBN

2009

• Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick i Luc Segoufin, Two-variable logic on data trees and XML reasoning, Journal Of The Acm 56 (3) 2009.zobacz w PBN

2004

• Wojciech Plandowski, Satisfiability of word equations with constants is in PSPACE, Journal Of The Acm 51 (3) 2004, s. 483–496.zobacz w PBN

2000

• Wojciech Plandowski, J Karhumaki i F Mignosi, The expressibility of languages and relations by word equations, Journal Of The Acm 47 (3) 2000, s. 483–505.zobacz w PBN