Mateusz Pawlik

Orcid: 0000-0003-0543-6332

Affiliations:
  • University of Salzburg, Austria


According to our database1, Mateusz Pawlik authored at least 11 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Effective queries for mega-analysis in cognitive neuroscience.
Proceedings of the Workshops of the EDBT/ICDT 2023 Joint Conference, 2023

2022
Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning.
Inf. Syst. Frontiers, 2022

2020
Minimal Edit-Based Diffs for Large Trees.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

An Efficient Index for Reachability Queries in Public Transport Networks.
Proceedings of the Advances in Databases and Information Systems, 2020

2019
A Link is not Enough - Reproducibility of Data.
Datenbank-Spektrum, 2019

Effective Filters and Linear Time Verification for Tree Similarity Joins.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2017
A New Perspective on the Tree Edit Distance.
Proceedings of the Similarity Search and Applications - 10th International Conference, 2017

2016
Tree edit distance: Robust and memory-efficient.
Inf. Syst., 2016

2015
Efficient Computation of the Tree Edit Distance.
ACM Trans. Database Syst., 2015

2014
A Memory-Efficient Tree Edit Distance Algorithm.
Proceedings of the Database and Expert Systems Applications, 2014

2011
RTED: A Robust Algorithm for the Tree Edit Distance.
Proc. VLDB Endow., 2011


  Loading...