| 2020 | SIGIR | Efficient and Effective Query Auto-Completion. | Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini |
| 2018 | DCC | A Grammar Compression Algorithm Based on Induced Suffix Sorting. | Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincn, Gonzalo Navarro |
| 2018 | SPIRE | Computing Burrows-Wheeler Similarity Distributions for String Collections. | Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao |
| 2017 | ALENEX | CSA++: Fast Pattern Search for Large Alphabets. | Simon Gog, Alistair Moffat, Matthias Petri |
| 2017 | ALENEX | Elias-Fano meets Single-Term Top- | Julian Labeit, Simon Gog |
| 2017 | SPIRE | Fast Construction of Compressed Web Graphs. | Jan Bro, Simon Gog, Matthias Hauck, Marcus Paradies |
| 2016 | DCC | Faster, Minuter. | Simon Gog, Juha Krkkinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi |
| 2016 | DCC | Induced Suffix Sorting for String Collections. | Felipe A. Louza, Simon Gog, Guilherme P. Telles |
| 2016 | SIGIR | Fast and Compact Hamming Distance Index. | Simon Gog, Rossano Venturini |
| 2016 | SIGIR | Succinct Data Structures in Information Retrieval: Theory and Practice. | Simon Gog, Rossano Venturini |
| 2016 | SPIRE | Parallel Computation for the All-Pairs Suffix-Prefix Problem. | Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles |
| 2015 | ALENEX | Improved Single-Term Top- | Simon Gog, Gonzalo Navarro |
| 2015 | CPM | Compact Indexes for Flexible Top- k k Retrieval. | Simon Gog, Matthias Petri |
| 2015 | ECIR | On Identifying Phrases Using Collection Statistics. | Simon Gog, Alistair Moffat, Matthias Petri |
| 2014 | SPIRE | Relative FM-Indexes. | Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirn |
| 2014 | SPIRE | Relative Lempel-Ziv with Constant-Time Random Access. | Hctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi |
| 2014 | SPIRE | Strategic Pattern Search in Factor-Compressed Text. | Simon Gog, Alistair Moffat, Matthias Petri |
| 2013 | SPIRE | Space-Efficient Construction of the Burrows-Wheeler Transform. | Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch |
| 2013 | SPIRE | Adding Compression and Blended Search to a Compact Two-Level Suffix Array. | Simon Gog, Alistair Moffat |
| 2012 | COCOON | Multi-pattern Matching with Bidirectional Indexes. | Simon Gog, Kalle Karhu, Juha Krkkinen, Veli Mkinen, Niko Vlimki |
| 2011 | ALENEX | Fast and Lightweight LCP-Array Construction Algorithms. | Simon Gog, Enno Ohlebusch |
| 2011 | CPM | Lempel-Ziv Factorization Revisited. | Enno Ohlebusch, Simon Gog |
| 2011 | SPIRE | Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. | Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger |
| 2010 | CPM | Bidirectional Search in a String with Wavelet Trees. | Thomas Schnattinger, Enno Ohlebusch, Simon Gog |
| 2010 | DCC | Advantages of Shared Data Structures for Sequences of Balanced Parentheses. | Simon Gog, Johannes Fischer |
| 2010 | SPIRE | CST++. | Enno Ohlebusch, Johannes Fischer, Simon Gog |
| 2010 | SPIRE | Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. | Enno Ohlebusch, Simon Gog, Adrian Kgel |
| 2009 | SPIRE | A Compressed Enhanced Suffix Array Supporting Fast String Matching. | Enno Ohlebusch, Simon Gog |
| 2007 | RECOMB | How to Achieve an Equivalent Simple Permutation in Linear Time. | Simon Gog, Martin Bader |