default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Petri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c34]Puxuan Yu, Antonio Mallia, Matthias Petri:
Improved Learned Sparse Retrieval with Corpus-Specific Vocabularies. ECIR (3) 2024: 181-194- [i8]Puxuan Yu, Antonio Mallia, Matthias Petri:
Improved Learned Sparse Retrieval with Corpus-Specific Vocabularies. CoRR abs/2401.06703 (2024) - 2023
- [j10]Joel Mackenzie
, Matthias Petri, Alistair Moffat:
Tradeoff Options for Bipartite Graph Partitioning. IEEE Trans. Knowl. Data Eng. 35(8): 8644-8657 (2023) - [c33]Joel Mackenzie, Antonio Mallia, Alistair Moffat, Matthias Petri:
Accelerating Learned Sparse Indexes Via Term Impact Decomposition. IIR 2023: 47-52 - 2022
- [j9]Joel Mackenzie, Matthias Petri, Alistair Moffat:
Efficient query processing techniques for next-page retrieval. Inf. Retr. J. 25(1): 27-43 (2022) - [j8]Joel Mackenzie, Matthias Petri, Alistair Moffat:
Anytime Ranking on Document-Ordered Indexes. ACM Trans. Inf. Syst. 40(1): 13:1-13:32 (2022) - [c32]Joel Mackenzie, Matthias Petri, Luke Gallagher:
IOQP: A simple Impact-Ordered Query Processor written in Rust. DESIRES 2022: 22-34 - [c31]Joel Mackenzie, Antonio Mallia, Alistair Moffat, Matthias Petri:
Accelerating Learned Sparse Indexes Via Term Impact Decomposition. EMNLP (Findings) 2022: 2830-2842 - 2021
- [c30]Joel Mackenzie, Matthias Petri, Alistair Moffat:
Faster Index Reordering with Bipartite Graph Partitioning. SIGIR 2021: 1910-1914 - [i7]Joel Mackenzie, Matthias Petri, Alistair Moffat:
Anytime Ranking on Document-Ordered Indexes. CoRR abs/2104.08976 (2021) - [i6]Joel Mackenzie, Matthias Petri, Alistair Moffat:
A Sensitivity Analysis of the MSMARCO Passage Collection. CoRR abs/2112.03396 (2021) - 2020
- [j7]Alistair Moffat, Matthias Petri:
Large-Alphabet Semi-Static Entropy Coding Via Asymmetric Numeral Systems. ACM Trans. Inf. Syst. 38(4): 33:1-33:33 (2020) - [c29]Joel M. Mackenzie, Rodger Benham, Matthias Petri, Johanne R. Trippas, J. Shane Culpepper, Alistair Moffat:
CC-News-En: A Large English News Corpus. CIKM 2020: 3077-3084
2010 – 2019
- 2019
- [j6]Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi:
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Algorithmica 81(4): 1370-1391 (2019) - [c28]Joel M. Mackenzie, Antonio Mallia, Matthias Petri, J. Shane Culpepper, Torsten Suel:
Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study. ECIR (1) 2019: 339-352 - [c27]Matthias Petri, Alistair Moffat, Joel M. Mackenzie, J. Shane Culpepper, Daniel Beck:
Accelerated Query Processing Via Similarity Score Prediction. SIGIR 2019: 485-494 - [c26]Giulio Ermanno Pibiri, Matthias Petri, Alistair Moffat:
Fast Dictionary-Based Compression for Inverted Indexes. WSDM 2019: 6-14 - [r1]Alistair Moffat, Matthias Petri:
Computing the Cost of Compressed Data. Encyclopedia of Big Data Technologies 2019 - 2018
- [j5]Matthias Petri, Alistair Moffat:
Compact inverted index storage using general-purpose compression libraries. Softw. Pract. Exp. 48(4): 974-982 (2018) - [c25]Alistair Moffat, Matthias Petri:
Index Compression Using Byte-Aligned ANS Coding and Two-Dimensional Contexts. WSDM 2018: 405-413 - 2017
- [c24]Simon Gog, Alistair Moffat, Matthias Petri:
CSA++: Fast Pattern Search for Large Alphabets. ALENEX 2017: 73-82 - [c23]Alistair Moffat, Matthias Petri:
ANS-Based Index Compression. CIKM 2017: 677-686 - [c22]Kewen Liao, Alistair Moffat, Matthias Petri, Anthony Wirth:
A Cost Model for Long-Term Compressed Data Retention. WSDM 2017: 241-249 - 2016
- [j4]Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn:
Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees. Trans. Assoc. Comput. Linguistics 4: 477-490 (2016) - [c21]Matthias Petri, Trevor Cohn:
Succinct Data Structures for NLP-at-Scale. COLING (Tutorials) 2016: 20-21 - [c20]Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi:
Faster, Minuter. DCC 2016: 53-62 - [c19]Johannes Bader, Simon Gog, Matthias Petri:
Practical Variable Length Gap Pattern Matching. SEA 2016: 1-16 - [c18]Kewen Liao, Matthias Petri, Alistair Moffat, Anthony Wirth:
Effective Construction of Relative Lempel-Ziv Dictionaries. WWW 2016: 807-816 - [i5]Matthias Petri, Alistair Moffat, P. C. Nagesh, Anthony Wirth:
Access Time Tradeoffs in Archive Compression. CoRR abs/1602.08829 (2016) - [i4]Simon Gog, Alistair Moffat, Matthias Petri:
CSA++: Fast Pattern Search for Large Alphabets. CoRR abs/1605.05404 (2016) - [i3]Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn:
Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees. CoRR abs/1608.04465 (2016) - 2015
- [j3]Simon Gog, Gonzalo Navarro, Matthias Petri:
Improved and extended locating functionality on compressed suffix arrays. J. Discrete Algorithms 32: 53-63 (2015) - [c17]Matthias Petri, Alistair Moffat, P. C. Nagesh, Anthony Wirth:
Access Time Tradeoffs in Archive Compression. AIRS 2015: 15-28 - [c16]Simon Gog, Matthias Petri:
Compact Indexes for Flexible Top- k k Retrieval. CPM 2015: 207-218 - [c15]Simon Gog, Alistair Moffat, Matthias Petri:
On Identifying Phrases Using Collection Statistics. ECIR 2015: 278-283 - [c14]Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn:
Compact, Efficient and Unlimited Capacity: Language Modeling with Compressed Suffix Trees. EMNLP 2015: 2409-2418 - [c13]Matthias Petri, Alistair Moffat:
On the Cost of Phrase-Based Ranking. SIGIR 2015: 931-934 - 2014
- [j2]Simon Gog, Matthias Petri:
Optimized succinct data structures for massive data. Softw. Pract. Exp. 44(11): 1287-1314 (2014) - [c12]Matthias Petri, Alistair Moffat, Anthony Wirth:
Graph Representations and Applications of Citation Networks. ADCS 2014: 18 - [c11]Matthias Petri, Alistair Moffat, J. Shane Culpepper:
Score-safe term-dependency processing with hybrid indexes. SIGIR 2014: 899-902 - [c10]Simon Gog, Alistair Moffat, Matthias Petri:
Strategic Pattern Search in Factor-Compressed Text. SPIRE 2014: 1-12 - [c9]Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. SEA 2014: 326-337 - [i2]Simon Gog, Matthias Petri:
Compact Indexes for Flexible Top-k Retrieval. CoRR abs/1406.3170 (2014) - 2013
- [c8]Matthias Petri, J. Shane Culpepper, Alistair Moffat:
Exploring the magic of WAND. ADCS 2013: 58-65 - [i1]Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. CoRR abs/1311.1249 (2013) - 2012
- [j1]J. Shane Culpepper, Matthias Petri, Simon J. Puglisi:
Revisiting bounded context block-sorting transformations. Softw. Pract. Exp. 42(8): 1037-1054 (2012) - [c7]Matthias Petri, J. Shane Culpepper:
Efficient indexing algorithms for approximate pattern matching in text. ADCS 2012: 9-16 - [c6]J. Shane Culpepper, Matthias Petri, Falk Scholer:
Efficient in-memory top-k document retrieval. SIGIR 2012: 225-234 - 2011
- [c5]Matthias Petri, Gonzalo Navarro, J. Shane Culpepper, Simon J. Puglisi:
Backwards Search in Context Bound Text Transformations. CCP 2011: 82-91 - [c4]Michiko Yasukawa, J. Shane Culpepper, Falk Scholer, Matthias Petri:
RMIT and Gunma University at NTCIR-9 GeoTime Task. NTCIR 2011 - [c3]Michiko Yasukawa, J. Shane Culpepper, Falk Scholer, Matthias Petri:
RMIT and Gunma University at NTCIR-9 Intent Task. NTCIR 2011 - [c2]Matthias Petri, J. Shane Culpepper, Falk Scholer:
RMIT at TREC 2011 Microblog Track. TREC 2011 - [c1]Matthias Petri, Mark Sanderson, Falk Scholer:
RMIT at the Crowdsourcing Track of TREC 2011. TREC 2011
Coauthor Index
aka: Joel M. Mackenzie
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
