Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays. - Strahil Ristov; Éric Laporte 001 (CPM, 1999)

A Method for Compressing Lexicons. - Strahil Ristov; Éric Laporte 001 (DCC, 2002)

LZ trie and dictionary compression. - Strahil Ristov (Softw. Pract. Exp., 2005)

Natural Language Dictionaries Implemented as Finite Automata. - Jan Daciuk; Jakub Piskorski; Strahil Ristov (Scientific Applications of Language Methods, 2010)

Getting the Agenda Right: Measuring Media Agenda using Topic Models. - Damir Korencic; Strahil Ristov; Jan Snajder (TM@CIKM, 2015)

Using static suffix array in dynamic application: Case of text compression by longest first substitution. - Strahil Ristov; Damir Korencic (Inf. Process. Lett., 2015)

Fast construction of space-optimized recursive automaton. - Strahil Ristov; Damir Korencic (Softw. Pract. Exp., 2015)

A Fast and Simple Pattern Matching with Hamming Distance on Large Alphabets. - Strahil Ristov (J. Comput. Biol., 2016)

Trade-offs in Query and Target Indexing for the Selection of Candidates in Protein Homology Searches. - Strahil Ristov; Robert Vaser; Mile Sikic (Stringology, 2017)

Document-based topic coherence measures for news media text. - Damir Korencic; Strahil Ristov; Jan Snajder (Expert Syst. Appl., 2018)

Enumerated Automata Implementation of String Dictionaries. - Robert Bakaric; Damir Korencic; Strahil Ristov (CIAA, 2019)

IGLOSS: iterative gapless local similarity search. - Braslav Rabar; Maja Zagorscak; Strahil Ristov; Martin Rosenzweig; Pavle Goldstein (Bioinform., 2019)

A Fast Algorithm for the Largest Area First Parsing of Real Strings. - Ivan Katanic; Strahil Ristov; Martin Rosenzweig (IEEE Access, 2020)

A Topic Coverage Approach to Evaluation of Topic Models. - Damir Korencic; Strahil Ristov; Jelena Repar; Jan Snajder (IEEE Access, 2021)