default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Gerdjikov
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Georgi Shopov, Stefan Gerdjikov:
Consistent Bidirectional Language Modelling: Expressive Power and Representational Conciseness. EMNLP 2024: 5724-5768- 2023
- [c12]Georgi Shopov, Stefan Gerdjikov, Stoyan Mihov:
StreamSpeech: Low-Latency Neural Architecture for High-Quality on-Device Speech Synthesis. ICASSP 2023: 1-5 - [c11]Diana Geneva, Georgi Shopov, Kostadin Garov
, Maria Todorova, Stefan Gerdjikov, Stoyan Mihov:
Accentor: An Explicit Lexical Stress Model for TTS Systems. INTERSPEECH 2023: 4848-4852 - 2021
- [j5]Tobias Englmeier, Marco Büchler, Stefan Gerdjikov, Klaus U. Schulz:
Using an Advanced Text Index Structure for Corpus Exploration in Digital Humanities. Digit. Humanit. Q. 15(1) (2021) - 2020
- [j4]Stefan Gerdjikov, José Ramón González de Mendívil:
Conditions for the existence of maximal factorizations. Fuzzy Sets Syst. 397: 186-196 (2020)
2010 – 2019
- 2019
- [j3]Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
Space-efficient bimachine construction based on the equalizer accumulation principle. Theor. Comput. Sci. 790: 80-95 (2019) - 2018
- [c10]Stefan Gerdjikov:
A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers. LATA 2018: 143-155 - [c9]Stefan Gerdjikov:
Generalised Twinning Property. CIAA 2018: 173-185 - [i6]Stefan Gerdjikov:
Characterisation of (Sub)sequential Rational Functions over a General Class Monoids. CoRR abs/1801.10063 (2018) - [i5]Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
Space-Efficient Bimachine Construction Based on the Equalizer Accumulation Principle. CoRR abs/1803.04312 (2018) - [i4]Stefan Gerdjikov:
Note on the Lower Bounds of Bimachines. CoRR abs/1804.10146 (2018) - 2017
- [c8]Stefan Gerdjikov, Stoyan Mihov:
Over Which Monoids is the Transducer Determinization Procedure Applicable? LATA 2017: 380-392 - [c7]Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
A Simple Method for Building Bimachines from Functional Finite-State Transducers. CIAA 2017: 113-125 - [i3]Stefan Gerdjikov, Stoyan Mihov:
Myhill-Nerode Relation for Sequentiable Structures. CoRR abs/1706.02910 (2017) - 2016
- [i2]Stefan Gerdjikov, Klaus U. Schulz:
Corpus analysis without prior linguistic knowledge - unsupervised mining of phrases and subphrase structure. CoRR abs/1602.05772 (2016) - 2014
- [j2]Sebastian Wandelt, Dong Deng, Stefan Gerdjikov, Shashwat Mishra, Petar Mitankin, Manish Patil, Enrico Siragusa, Alexander Tiskin, Wei Wang, Jiaying Wang, Ulf Leser:
State-of-the-art in string similarity search and join. SIGMOD Rec. 43(1): 64-76 (2014) - [c6]Andrey Sariev, Vladislav Nenchev, Stefan Gerdjikov, Petar Mitankin, Hristo Ganchev, Stoyan Mihov, Tinko Tinchev:
Flexible Noisy Text Correction. Document Analysis Systems 2014: 31-35 - [c5]Petar Mitankin, Stefan Gerdjikov, Stoyan Mihov:
An approach to unsupervised historical text normalisation. DATeCH 2014: 29-34 - 2013
- [c4]Séamus Lawless, Cormac Hampson, Petar Mitankin, Stefan Gerdjikov:
Normalisation in Historical Text Collections. DH 2013: 507-508 - [c3]Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz:
WallBreaker: overcoming the wall effect in similarity search. EDBT/ICDT Workshops 2013: 366-369 - [c2]Stefan Gerdjikov, Stoyan Mihov, Vladislav Nenchev:
Extraction of Spelling Variations from Language Structure for Noisy Text Correction. ICDAR 2013: 324-328 - [c1]Stefan Gerdjikov, Petar Mitankin, Vladislav Nenchev:
Realization of common statistical methods in computational linguistics with functional automata. RANLP 2013: 294-301 - [i1]Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz:
Good parts first - a new algorithm for approximate search in lexica and string databases. CoRR abs/1301.0722 (2013)
2000 – 2009
- 2008
- [j1]Stefan Gerdjikov, Alexander Wolff:
Decomposing a simple polygon into pseudo-triangles and convex polygons. Comput. Geom. 41(1-2): 21-30 (2008)
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-11-15 19:32 CET 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:
