Matthias Petri
Matthias Petri
Computing and Information Systems, University of Melbourne
Verified email at
Cited by
Cited by
From theory to practice: Plug and play with succinct data structures
S Gog, T Beller, A Moffat, M Petri
International Symposium on Experimental Algorithms, 326-337, 2014
Optimized succinct data structures for massive data
S Gog, M Petri
Software: Practice and Experience 44 (11), 1287-1314, 2014
Efficient in-memory top-k document retrieval
JS Culpepper, M Petri, F Scholer
Proceedings of the 35th international ACM SIGIR conference on Research and …, 2012
Exploring the magic of WAND
M Petri, JS Culpepper, A Moffat
Proceedings of the 18th Australasian Document Computing Symposium, 58-65, 2013
Effective construction of relative Lempel-Ziv dictionaries
K Liao, M Petri, A Moffat, A Wirth
Proceedings of the 25th International Conference on World Wide Web, 807-816, 2016
Compact, efficient and unlimited capacity: Language modeling with compressed suffix trees
E Shareghi, M Petri, G Haffari, T Cohn
Proceedings of the 2015 Conference on Empirical Methods in Natural Language …, 2015
ANS-based index compression
A Moffat, M Petri
Proceedings of the 2017 ACM on Conference on Information and Knowledge …, 2017
Score-safe term-dependency processing with hybrid indexes
M Petri, A Moffat, JS Culpepper
Proceedings of the 37th international ACM SIGIR conference on Research …, 2014
Compressing inverted indexes with recursive graph bisection: A reproducibility study
J Mackenzie, A Mallia, M Petri, JS Culpepper, T Suel
European Conference on Information Retrieval, 339-352, 2019
Index compression using byte-aligned ANS coding and two-dimensional contexts
A Moffat, M Petri
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
Fast dictionary-based compression for inverted indexes
GE Pibiri, M Petri, A Moffat
Proceedings of the Twelfth ACM International Conference on Web Search and …, 2019
Fast, small and exact: Infinite-order language modelling with compressed suffix trees
E Shareghi, M Petri, G Haffari, T Cohn
Transactions of the Association for Computational Linguistics 4, 477-490, 2016
Accelerated query processing via similarity score prediction
M Petri, A Moffat, J Mackenzie, JS Culpepper, D Beck
Proceedings of the 42nd International ACM SIGIR Conference on Research and …, 2019
Compact inverted index storage using general‐purpose compression libraries
M Petri, A Moffat
Software: Practice and Experience 48 (4), 974-982, 2018
Faster, minuter
S Gog, J Kärkkäinen, D Kempa, M Petri, SJ Puglisi
2016 Data Compression Conference (DCC), 53-62, 2016
Experimental algorithms
G Simon, B Timo, M Alistair, P Matthias
Cham: Springer International Publishing, 326-337, 2014
Sdsl-succinct data structure library
S Gog, J Bader, T Beller, M Petri
Website, Universität Ulm, 2014
Compact Indexes for Flexible Top-$$$$ Retrieval
S Gog, M Petri
Annual Symposium on Combinatorial Pattern Matching, 207-218, 2015
Improved and extended locating functionality on compressed suffix arrays
S Gog, G Navarro, M Petri
Journal of Discrete Algorithms 32, 53-63, 2015
Revisiting bounded context block‐sorting transformations
JS Culpepper, M Petri, SJ Puglisi
Software: Practice and Experience 42 (8), 1037-1054, 2012
The system can't perform the operation now. Try again later.
Articles 1–20