Piotr Wieczorek

Institute of Computer Science
University of Wroclaw
ul. Joliot-Curie 15
PL-50-383 Wroclaw

Office: 338

piotrek [at] cs.uni.wroc.pl

I am employed at Institute of Computer Science, University of Wroclaw. My research interests focus on various aspects of Database Theory.

Full list on DBLP

B. Groz, A. Lemay, S. Staworko, P. Wieczorek Inference of Shape Expression Schemas Typed RDF Graphs. ICDT 2022
J. Michaliszyn, J. Otop, P. Wieczorek Modular Path Queries with Arithmetic, Logical Methods in Computer Science, Volume 17, Issue 3, 2021, pp. 27:1–27:36
S. Staworko, P. Wieczorek, Containment of Shape Expression Schemas for RDF, PODS 2019.
J. Michaliszyn, J. Otop, P. Wieczorek Querying Best Paths in Graph Databases. 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2017. full version
M. Graboń, J. Michaliszyn, J.Otop, P. Wieczorek Querying Data Graphs with Arithmetical Regular Expressions, International Joint Conference on Artificial Intelligence (IJCAI), 2016 abstract
S. Staworko, P. Wieczorek Characterizing XML Twig Queries with Examples, International Conference on Database Theory (ICDT), March 2015, Brussels (preliminary version: pdf) abstract
S. Staworko, P. Wieczorek Learning Twig and Path Queries, International Conference on Database Theory (ICDT), March 2012, Berlin, Germany (pdf) abstract
Jerzy Marcinkowski, Piotr Wieczorek. Modulo Constraints and the Complexity of Typechecking XML Views. Theory of Computing Systems Volume 44, Number 4 / May 2009 (preliminary version: pdf) abstract
Piotr Wieczorek. Complexity of Typechecking XML Views of Relational Databases. International Conference on Database Theory (ICDT 2007), Springer, LNCS 4353, Best Newcomer Award (pdf) abstract

Here is my FSTTCS 2017 talk .