Matthias Petri

Orcid: 0000-0002-0054-9429

According to our database1, Matthias Petri authored at least 46 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved Learned Sparse Retrieval with Corpus-Specific Vocabularies.
Proceedings of the Advances in Information Retrieval, 2024

2023
Tradeoff Options for Bipartite Graph Partitioning.
IEEE Trans. Knowl. Data Eng., August, 2023

Accelerating Learned Sparse Indexes Via Term Impact Decomposition.
Proceedings of the 13th Italian Information Retrieval Workshop (IIR 2023), 2023

2022
Anytime Ranking on Document-Ordered Indexes.
ACM Trans. Inf. Syst., 2022

Efficient query processing techniques for next-page retrieval.
Inf. Retr. J., 2022

IOQP: A simple Impact-Ordered Query Processor written in Rust.
Proceedings of the Third International Conference on Design of Experimental Search & Information REtrieval Systems, 2022

2021
A Sensitivity Analysis of the MSMARCO Passage Collection.
CoRR, 2021

Faster Index Reordering with Bipartite Graph Partitioning.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

2020
Large-Alphabet Semi-Static Entropy Coding Via Asymmetric Numeral Systems.
ACM Trans. Inf. Syst., 2020

CC-News-En: A Large English News Corpus.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Computing the Cost of Compressed Data.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice.
Algorithmica, 2019

Fast Dictionary-Based Compression for Inverted Indexes.
Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, 2019

Accelerated Query Processing Via Similarity Score Prediction.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study.
Proceedings of the Advances in Information Retrieval, 2019

2018
Compact inverted index storage using general-purpose compression libraries.
Softw. Pract. Exp., 2018

Index Compression Using Byte-Aligned ANS Coding and Two-Dimensional Contexts.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017
A Cost Model for Long-Term Compressed Data Retention.
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

ANS-Based Index Compression.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

CSA++: Fast Pattern Search for Large Alphabets.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees.
Trans. Assoc. Comput. Linguistics, 2016

Effective Construction of Relative Lempel-Ziv Dictionaries.
Proceedings of the 25th International Conference on World Wide Web, 2016

Practical Variable Length Gap Pattern Matching.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Faster, Minuter.
Proceedings of the 2016 Data Compression Conference, 2016

Succinct Data Structures for NLP-at-Scale.
Proceedings of the COLING 2016, 2016

2015
Improved and extended locating functionality on compressed suffix arrays.
J. Discrete Algorithms, 2015

On the Cost of Phrase-Based Ranking.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

Compact, Efficient and Unlimited Capacity: Language Modeling with Compressed Suffix Trees.
Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015

On Identifying Phrases Using Collection Statistics.
Proceedings of the Advances in Information Retrieval, 2015

Compact Indexes for Flexible Top- k k Retrieval.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Access Time Tradeoffs in Archive Compression.
Proceedings of the Information Retrieval Technology, 2015

2014
Optimized succinct data structures for massive data.
Softw. Pract. Exp., 2014

Compact Indexes for Flexible Top-k Retrieval.
CoRR, 2014

From Theory to Practice: Plug and Play with Succinct Data Structures.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Strategic Pattern Search in Factor-Compressed Text.
Proceedings of the String Processing and Information Retrieval, 2014

Score-safe term-dependency processing with hybrid indexes.
Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

Graph Representations and Applications of Citation Networks.
Proceedings of the 2014 Australasian Document Computing Symposium, 2014

2013
Exploring the magic of WAND.
Proceedings of the Australasian Document Computing Symposium, 2013

2012
Revisiting bounded context block-sorting transformations.
Softw. Pract. Exp., 2012

Efficient in-memory top-k document retrieval.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Efficient indexing algorithms for approximate pattern matching in text.
Proceedings of the Seventeenth Australasian Document Computing Symposium, 2012

2011
RMIT at the Crowdsourcing Track of TREC 2011.
Proceedings of The Twentieth Text REtrieval Conference, 2011

RMIT at TREC 2011 Microblog Track.
Proceedings of The Twentieth Text REtrieval Conference, 2011

RMIT and Gunma University at NTCIR-9 Intent Task.
Proceedings of the 9th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2011

RMIT and Gunma University at NTCIR-9 GeoTime Task.
Proceedings of the 9th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2011

Backwards Search in Context Bound Text Transformations.
Proceedings of the First International Conference on Data Compression, 2011


  Loading...