default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Gog
Person information
- affiliation: Karslruhe Insitute of Technology (KIT), Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j18]Daniel Saad Nogueira Nunes
, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
Grammar Compression by Induced Suffix Sorting. ACM J. Exp. Algorithmics 27: 1.1:1-1.1:33 (2022)- 2020
- [b2]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Construction of Fundamental Data Structures for Strings. Springer Briefs in Computer Science, Springer 2020, ISBN 978-3-030-55107-0, pp. 3-101 - [j17]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone:
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15(1): 18 (2020) - [c38]Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini:
Efficient and Effective Query Auto-Completion. SIGIR 2020: 2271-2280 - [i10]Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini:
Efficient and Effective Query Auto-Completion. CoRR abs/2005.06213 (2020) - [i9]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
Grammar Compression By Induced Suffix Sorting. CoRR abs/2011.12898 (2020)
2010 – 2019
- 2019
- [j16]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) - [j15]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Algorithms to compute the Burrows-Wheeler Similarity Distribution. Theor. Comput. Sci. 782: 145-156 (2019) - [i8]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Algorithms to compute the Burrows-Wheeler Similarity Distribution. CoRR abs/1903.10583 (2019) - 2018
- [c37]Timo Bingmann, Simon Gog, Florian Kurpicz:
Scalable Construction of Text Indexes with Thrill. IEEE BigData 2018: 634-643 - [c36]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
A Grammar Compression Algorithm Based on Induced Suffix Sorting. DCC 2018: 42-51 - [c35]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Computing Burrows-Wheeler Similarity Distributions for String Collections. SPIRE 2018: 285-296 - 2017
- [j14]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Optimal suffix sorting and LCP array construction for constant alphabets. Inf. Process. Lett. 118: 30-34 (2017) - [j13]Simon Gog, Roberto Konow, Gonzalo Navarro:
Practical Compact Indexes for Top-k Document Retrieval. ACM J. Exp. Algorithmics 22 (2017) - [j12]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678: 22-39 (2017) - [c34]Simon Gog, Alistair Moffat, Matthias Petri:
CSA++: Fast Pattern Search for Large Alphabets. ALENEX 2017: 73-82 - [c33]Julian Labeit, Simon Gog:
Elias-Fano meets Single-Term Top-k Document Retrieval. ALENEX 2017: 135-145 - [c32]Jan Broß, Simon Gog, Matthias Hauck, Marcus Paradies:
Fast Construction of Compressed Web Graphs. SPIRE 2017: 116-128 - [c31]Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
Practical Range Minimum Queries Revisited. SEA 2017: 12:1-12:16 - [c30]Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. SEA 2017: 15:1-15:14 - [i7]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
A Grammar Compression Algorithm based on Induced Suffix Sorting. CoRR abs/1711.03205 (2017) - 2016
- [j11]William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza:
An improved algorithm for the all-pairs suffix-prefix problem. J. Discrete Algorithms 37: 34-43 (2016) - [c29]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Induced Suffix Sorting for String Collections. DCC 2016: 43-52 - [c28]Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi:
Faster, Minuter. DCC 2016: 53-62 - [c27]Simon Gog, Rossano Venturini:
Fast and Compact Hamming Distance index. IIR 2016 - [c26]Simon Gog, Rossano Venturini:
Fast and Compact Hamming Distance Index. SIGIR 2016: 285-294 - [c25]Simon Gog, Rossano Venturini:
Succinct Data Structures in Information Retrieval: Theory and Practice. SIGIR 2016: 1231-1233 - [c24]Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles:
Parallel Computation for the All-Pairs Suffix-Prefix Problem. SPIRE 2016: 122-132 - [c23]Johannes Bader, Simon Gog, Matthias Petri:
Practical Variable Length Gap Pattern Matching. SEA 2016: 1-16 - [i6]Simon Gog, Alistair Moffat, Matthias Petri:
CSA++: Fast Pattern Search for Large Alphabets. CoRR abs/1605.05404 (2016) - [i5]Timo Bingmann, Simon Gog, Florian Kurpicz:
Scalable Construction of Text Indexes. CoRR abs/1610.03007 (2016) - 2015
- [j10]Simon Gog, Gonzalo Navarro, Matthias Petri:
Improved and extended locating functionality on compressed suffix arrays. J. Discrete Algorithms 32: 53-63 (2015) - [c22]Simon Gog, Gonzalo Navarro:
Improved Single-Term Top-k Document Retrieval. ALENEX 2015: 24-32 - [c21]Simon Gog, Matthias Petri:
Compact Indexes for Flexible Top- k k Retrieval. CPM 2015: 207-218 - [c20]Simon Gog, Alistair Moffat, Matthias Petri:
On Identifying Phrases Using Collection Statistics. ECIR 2015: 278-283 - 2014
- [j9]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern matching with bidirectional indexes. J. Discrete Algorithms 24: 26-39 (2014) - [j8]Simon Gog, Matthias Petri:
Optimized succinct data structures for massive data. Softw. Pract. Exp. 44(11): 1287-1314 (2014) - [j7]Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth:
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. IEEE Trans. Knowl. Data Eng. 26(8): 1918-1931 (2014) - [c19]Simon Gog, Alistair Moffat, Matthias Petri:
Strategic Pattern Search in Factor-Compressed Text. SPIRE 2014: 1-12 - [c18]Héctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi:
Relative Lempel-Ziv with Constant-Time Random Access. SPIRE 2014: 13-17 - [c17]Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén:
Relative FM-Indexes. SPIRE 2014: 52-64 - [c16]Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. SEA 2014: 326-337 - [c15]Simon Gog, Gonzalo Navarro:
Improved and Extended Locating Functionality on Compressed Suffix Arrays. SEA 2014: 436-447 - [i4]Simon Gog, Matthias Petri:
Compact Indexes for Flexible Top-k Retrieval. CoRR abs/1406.3170 (2014) - 2013
- [j6]Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18: 22-31 (2013) - [j5]Simon Gog, Enno Ohlebusch:
Compressed suffix trees: Efficient computation and storage of LCP-values. ACM J. Exp. Algorithmics 18 (2013) - [c14]Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch:
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE 2013: 5-16 - [c13]Simon Gog, Alistair Moffat:
Adding Compression and Blended Search to a Compact Two-Level Suffix Array. SPIRE 2013: 141-152 - [i3]Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth:
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. CoRR abs/1303.6481 (2013) - [i2]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
- [j4]Thomas Schnattinger, Enno Ohlebusch, Simon Gog:
Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213: 13-22 (2012) - [c12]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern Matching with Bidirectional Indexes. COCOON 2012: 384-395 - 2011
- [b1]Simon Gog:
Compressed suffix trees: design, construction, and applications. University of Ulm, 2011, pp. 1-164 - [c11]Simon Gog, Enno Ohlebusch:
Fast and Lightweight LCP-Array Construction Algorithms. ALENEX 2011: 25-34 - [c10]Enno Ohlebusch, Simon Gog:
Lempel-Ziv Factorization Revisited. CPM 2011: 15-26 - [c9]Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE 2011: 197-208 - 2010
- [j3]Enno Ohlebusch, Simon Gog:
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Inf. Process. Lett. 110(3): 123-128 (2010) - [c8]Enno Ohlebusch, Simon Gog:
Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB 2010: 19-24 - [c7]Thomas Schnattinger, Enno Ohlebusch, Simon Gog:
Bidirectional Search in a String with Wavelet Trees. CPM 2010: 40-50 - [c6]Simon Gog, Johannes Fischer:
Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC 2010: 406-415 - [c5]Enno Ohlebusch, Johannes Fischer, Simon Gog:
CST++. SPIRE 2010: 322-333 - [c4]Enno Ohlebusch, Simon Gog, Adrian Kügel:
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE 2010: 347-358 - [i1]Simon Gog, Enno Ohlebusch:
Lightweight LCP-Array Construction in Linear Time. CoRR abs/1012.4263 (2010)
2000 – 2009
- 2009
- [c3]Enno Ohlebusch, Simon Gog:
A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62 - [c2]Simon Gog:
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA 2009: 161-172 - 2008
- [j2]Simon Gog, Martin Bader, Enno Ohlebusch:
GENESIS: genome evolution scenarios. Bioinform. 24(5): 711-712 (2008) - [j1]Simon Gog, Martin Bader:
Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation. J. Comput. Biol. 15(8): 1029-1041 (2008) - 2007
- [c1]Simon Gog, Martin Bader:
How to Achieve an Equivalent Simple Permutation in Linear Time. RECOMB-CG 2007: 58-68
Coauthor Index
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-04-25 05:44 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:
