![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Strahil Ristov
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j8]Damir Korencic
, Strahil Ristov
, Jelena Repar
, Jan Snajder
:
A Topic Coverage Approach to Evaluation of Topic Models. IEEE Access 9: 123280-123312 (2021) - 2020
- [j7]Ivan Katanic
, Strahil Ristov
, Martin Rosenzweig:
A Fast Algorithm for the Largest Area First Parsing of Real Strings. IEEE Access 8: 141990-142002 (2020) - [i1]Damir Korencic, Strahil Ristov, Jelena Repar, Jan Snajder:
A Topic Coverage Approach to Evaluation of Topic Models. CoRR abs/2012.06274 (2020)
2010 – 2019
- 2019
- [j6]Braslav Rabar, Maja Zagorscak
, Strahil Ristov, Martin Rosenzweig, Pavle Goldstein:
IGLOSS: iterative gapless local similarity search. Bioinform. 35(18): 3491-3492 (2019) - [c5]Robert Bakaric, Damir Korencic, Strahil Ristov:
Enumerated Automata Implementation of String Dictionaries. CIAA 2019: 33-44 - 2018
- [j5]Damir Korencic, Strahil Ristov, Jan Snajder
:
Document-based topic coherence measures for news media text. Expert Syst. Appl. 114: 357-373 (2018) - 2017
- [c4]Strahil Ristov, Robert Vaser, Mile Sikic:
Trade-offs in Query and Target Indexing for the Selection of Candidates in Protein Homology Searches. Stringology 2017: 118-125 - 2016
- [j4]Strahil Ristov:
A Fast and Simple Pattern Matching with Hamming Distance on Large Alphabets. J. Comput. Biol. 23(11): 874-876 (2016) - 2015
- [j3]Strahil Ristov, Damir Korencic:
Using static suffix array in dynamic application: Case of text compression by longest first substitution. Inf. Process. Lett. 115(2): 175-181 (2015) - [j2]Strahil Ristov, Damir Korencic:
Fast construction of space-optimized recursive automaton. Softw. Pract. Exp. 45(6): 783-799 (2015) - [c3]Damir Korencic, Strahil Ristov, Jan Snajder
:
Getting the Agenda Right: Measuring Media Agenda using Topic Models. TM@CIKM 2015: 61-66 - 2010
- [p1]Jan Daciuk, Jakub Piskorski, Strahil Ristov:
Natural Language Dictionaries Implemented as Finite Automata. Scientific Applications of Language Methods 2010: 133-204
2000 – 2009
- 2005
- [j1]Strahil Ristov:
LZ trie and dictionary compression. Softw. Pract. Exp. 35(5): 445-465 (2005) - 2002
- [c2]Strahil Ristov, Éric Laporte
:
A Method for Compressing Lexicons. DCC 2002: 470
1990 – 1999
- 1999
- [c1]Strahil Ristov, Éric Laporte
:
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays. CPM 1999: 196-211
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint