Simon Gog - RankMe

68 papers A* 3A 5B 13C 12Misc 1Journal 28Unranked 4

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Grammar Compression by Induced Suffix Sorting. ACM J. Exp. Algorithmics Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2020	—	`book`	Construction of Fundamental Data Structures for Strings Felipe A. Louza, Simon Gog, Guilherme P. Telles
2020	A*	`conf`	Efficient and Effective Query Auto-Completion. SIGIR Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini
2020	J	`jnl`	Efficient and Effective Query Auto-Completion. CoRR Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini
2020	J	`jnl`	Grammar Compression By Induced Suffix Sorting. CoRR Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2020	J	`jnl`	gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
2019	J	`jnl`	Algorithms to compute the Burrows-Wheeler Similarity Distribution. CoRR Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2019	J	`jnl`	Algorithms to compute the Burrows-Wheeler Similarity Distribution. Theor. Comput. Sci. Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2019	J	`jnl`	Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Algorithmica Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
2018	B	`conf`	A Grammar Compression Algorithm Based on Induced Suffix Sorting. DCC Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2018	C	`conf`	Computing Burrows-Wheeler Similarity Distributions for String Collections. SPIRE Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2018	—	`conf`	Scalable Construction of Text Indexes with Thrill. IEEE BigData Timo Bingmann, Simon Gog, Florian Kurpicz
2017	J	`jnl`	A Grammar Compression Algorithm based on Induced Suffix Sorting. CoRR Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2017	A	`conf`	CSA++: Fast Pattern Search for Large Alphabets. ALENEX Simon Gog, Alistair Moffat, Matthias Petri
2017	A	`conf`	Elias-Fano meets Single-Term Top- ALENEX Julian Labeit, Simon Gog
2017	C	`conf`	Fast Construction of Compressed Web Graphs. SPIRE Jan Broß, Simon Gog, Matthias Hauck, Marcus Paradies
2017	J	`jnl`	Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. Felipe A. Louza, Simon Gog, Guilherme P. Telles
2017	J	`jnl`	Optimal suffix sorting and LCP array construction for constant alphabets. Inf. Process. Lett. Felipe A. Louza, Simon Gog, Guilherme P. Telles
2017	J	`jnl`	Practical Compact Indexes for Top- ACM J. Exp. Algorithmics Simon Gog, Roberto Konow, Gonzalo Navarro
2017	B	`conf`	Practical Range Minimum Queries Revisited. SEA Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
2017	B	`conf`	The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. SEA Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
2016	J	`jnl`	An improved algorithm for the all-pairs suffix-prefix problem. J. Discrete Algorithms William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza
2016	J	`jnl`	CSA++: Fast Pattern Search for Large Alphabets. CoRR Simon Gog, Alistair Moffat, Matthias Petri
2016	A*	`conf`	Fast and Compact Hamming Distance Index. SIGIR Simon Gog, Rossano Venturini
2016	—	`conf`	Fast and Compact Hamming Distance index. IIR Simon Gog, Rossano Venturini
2016	B	`conf`	Faster, Minuter. DCC Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
2016	B	`conf`	Induced Suffix Sorting for String Collections. DCC Felipe A. Louza, Simon Gog, Guilherme P. Telles
2016	C	`conf`	Parallel Computation for the All-Pairs Suffix-Prefix Problem. SPIRE Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles
2016	B	`conf`	Practical Variable Length Gap Pattern Matching. SEA Johannes Bader, Simon Gog, Matthias Petri
2016	J	`jnl`	Scalable Construction of Text Indexes. CoRR Timo Bingmann, Simon Gog, Florian Kurpicz
2016	A*	`conf`	Succinct Data Structures in Information Retrieval: Theory and Practice. SIGIR Simon Gog, Rossano Venturini
2015	B	`conf`	Compact Indexes for Flexible Top- k k Retrieval. CPM Simon Gog, Matthias Petri
2015	A	`conf`	Improved Single-Term Top- ALENEX Simon Gog, Gonzalo Navarro
2015	J	`jnl`	Improved and extended locating functionality on compressed suffix arrays. J. Discrete Algorithms Simon Gog, Gonzalo Navarro, Matthias Petri
2015	A	`conf`	On Identifying Phrases Using Collection Statistics. ECIR Simon Gog, Alistair Moffat, Matthias Petri
2014	J	`jnl`	Compact Indexes for Flexible Top-k Retrieval. CoRR Simon Gog, Matthias Petri
2014	B	`conf`	From Theory to Practice: Plug and Play with Succinct Data Structures. SEA Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
2014	B	`conf`	Improved and Extended Locating Functionality on Compressed Suffix Arrays. SEA Simon Gog, Gonzalo Navarro
2014	J	`jnl`	Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. IEEE Trans. Knowl. Data Eng. Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth
2014	J	`jnl`	Multi-pattern matching with bidirectional indexes. J. Discrete Algorithms Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki
2014	J	`jnl`	Optimized succinct data structures for massive data. Softw. Pract. Exp. Simon Gog, Matthias Petri
2014	C	`conf`	Relative FM-Indexes. SPIRE Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén
2014	C	`conf`	Relative Lempel-Ziv with Constant-Time Random Access. SPIRE Héctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi
2014	C	`conf`	Strategic Pattern Search in Factor-Compressed Text. SPIRE Simon Gog, Alistair Moffat, Matthias Petri
2013	C	`conf`	Adding Compression and Blended Search to a Compact Two-Level Suffix Array. SPIRE Simon Gog, Alistair Moffat
2013	J	`jnl`	Compressed suffix trees: Efficient computation and storage of LCP-values. ACM J. Exp. Algorithmics Simon Gog, Enno Ohlebusch
2013	J	`jnl`	Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
2013	J	`jnl`	From Theory to Practice: Plug and Play with Succinct Data Structures. CoRR Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
2013	J	`jnl`	Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays CoRR Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth
2013	C	`conf`	Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch
2012	J	`jnl`	Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. Thomas Schnattinger, Enno Ohlebusch, Simon Gog
2012	Misc	`conf`	Multi-pattern Matching with Bidirectional Indexes. COCOON Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki
2011	—	`—`	Compressed suffix trees: design, construction, and applications. Simon Gog
2011	C	`conf`	Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
2011	A	`conf`	Fast and Lightweight LCP-Array Construction Algorithms. ALENEX Simon Gog, Enno Ohlebusch
2011	B	`conf`	Lempel-Ziv Factorization Revisited. CPM Enno Ohlebusch, Simon Gog
2010	B	`conf`	Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC Simon Gog, Johannes Fischer
2010	B	`conf`	Bidirectional Search in a String with Wavelet Trees. CPM Thomas Schnattinger, Enno Ohlebusch, Simon Gog
2010	C	`conf`	CST++. SPIRE Enno Ohlebusch, Johannes Fischer, Simon Gog
2010	C	`conf`	Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE Enno Ohlebusch, Simon Gog, Adrian Kügel
2010	J	`jnl`	Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Inf. Process. Lett. Enno Ohlebusch, Simon Gog
2010	J	`jnl`	Lightweight LCP-Array Construction in Linear Time CoRR Simon Gog, Enno Ohlebusch
2010	—	`conf`	Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB Enno Ohlebusch, Simon Gog
2009	C	`conf`	A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE Enno Ohlebusch, Simon Gog
2009	B	`conf`	Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA Simon Gog
2008	J	`jnl`	Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation. J. Comput. Biol. Simon Gog, Martin Bader
2008	J	`jnl`	GENESIS: genome evolution scenarios. Bioinform. Simon Gog, Martin Bader, Enno Ohlebusch
2007	—	`conf`	How to Achieve an Equivalent Simple Permutation in Linear Time. RECOMB-CG Simon Gog, Martin Bader