Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2015
- Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein:
Beyond the Runs Theorem. SPIRE 2015: 277-286 - Dhruv Gupta, Klaus Berberich:
Temporal Query Classification at Different Granularities. SPIRE 2015: 156-164 - Julien Allali, Cédric Chauve, Laetitia Bourgeade:
Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract). SPIRE 2015: 116-123 - Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan:
Range LCP Queries Revisited. SPIRE 2015: 350-361 - Ricardo Baeza-Yates, Martí Mayo-Casademont, Luz Rello:
Feasibility of Word Difficulty Prediction. SPIRE 2015: 362-373 - Uwe Baier, Timo Beller, Enno Ohlebusch:
Parallel Construction of Succinct Representations of Suffix Tree Topologies. SPIRE 2015: 234-245 - Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen:
Efficient Algorithms for Longest Closed Factor Array. SPIRE 2015: 95-102 - Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Correction Distance. SPIRE 2015: 21-32 - Djamal Belazzougui, Fabio Cunial:
Space-Efficient Detection of Unusual Words. SPIRE 2015: 222-233 - Christina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini, Jouni Sirén:
Relative Select. SPIRE 2015: 149-155 - Vladimír Boza, Jakub Jursa, Brona Brejová, Tomás Vinar:
Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly. SPIRE 2015: 188-198 - Nieves R. Brisaboa, Ana Cerdeira-Pena, Antonio Fariña, Gonzalo Navarro:
A Compact RDF Store Using Suffix Arrays. SPIRE 2015: 103-115 - Tamanna Chhabra, Emanuele Giaquinta, Jorma Tarhio:
Filtration Algorithms for Approximate Order-Preserving Matching. SPIRE 2015: 177-187 - Olga Craveiro, Joaquim Macedo, Henrique Madeira:
Temporal Analysis of CHAVE Collection. SPIRE 2015: 67-74 - Jonathan Dimond, Peter Sanders:
Faster Exact Search Using Document Clustering. SPIRE 2015: 1-12 - Marius Dumitran, Florin Manea, Dirk Nowotka:
On Prefix/Suffix-Square Free Words. SPIRE 2015: 54-66 - Wadson Gomes Ferreira, Willian Antônio dos Santos, Breno Macena Pereira de Souza, Tiago Matta Machado Zaidan, Wladmir Cardoso Brandão:
Assessing the Efficiency of Suffix Stripping Approaches for Portuguese Stemming. SPIRE 2015: 210-221 - Daniel Ferrés, Horacio Rodríguez:
Evaluating Geographical Knowledge Re-Ranking, Linguistic Processing and Query Expansion Techniques for Geographical Information Retrieval. SPIRE 2015: 311-323 - Guillaume Fertin, Loïc Jankowiak, Géraldine Jean:
Prefix and Suffix Reversals on Strings. SPIRE 2015: 165-176 - Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE 2015: 270-276 - Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya:
Computing the Longest Unbordered Substring. SPIRE 2015: 246-257 - Szymon Grabowski, Marcin Raniszewski:
Sampling the Suffix Array with Minimizers. SPIRE 2015: 287-298 - Michal Hozza, Tomás Vinar, Brona Brejová:
How Big is that Genome? Estimating Genome Size and Coverage from k-mer Abundance Spectra. SPIRE 2015: 199-209 - Kai Hui, Klaus Berberich:
Selective Labeling and Incomplete Label Mitigation for Low-Cost Evaluation. SPIRE 2015: 137-148 - Radu Tudor Ionescu, Adrian-Gabriel Chifu, Josiane Mothe:
DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems Without Relevance Judgments. SPIRE 2015: 75-82 - Anagha Kulkarni:
ShRkC: Shard Rank Cutoff Prediction for Selective Search. SPIRE 2015: 337-349 - Weijun Liu, Ge Nong, Wai Hong Chan, Yi Wu:
Induced Sorting Suffixes in External Memory with Better Design and Less Space. SPIRE 2015: 83-94 - Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl:
Transforming XML Streams with References. SPIRE 2015: 33-45 - Giovanni Manzini:
Longest Common Prefix with Mismatches. SPIRE 2015: 299-310 - Massimo Melucci:
Efficient Term Set Prediction Using the Bell-Wigner Inequality. SPIRE 2015: 46-53
skipping 5 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-04 03:01 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint