Остановите войну!
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 43 matches
- 2012
- Artur Abdullin, Olfa Nasraoui:
Clustering Heterogeneous Data with Mutual Semi-supervision. SPIRE 2012: 18-29 - Andrés Abeliuk, Gonzalo Navarro:
Compressed Suffix Trees for Repetitive Texts. SPIRE 2012: 30-41 - Amihood Amir, Avivit Levy:
Approximate Period Detection and Correction. SPIRE 2012: 1-15 - Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. SPIRE 2012: 42-53 - Xiangdong An, Nick Cercone, Hai Wang, Zheng Ye:
A Study on Novelty Evaluation in Biomedical Information Retrieval. SPIRE 2012: 54-60 - Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan:
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. SPIRE 2012: 61-72 - Ricardo Baeza-Yates, Yoelle Maarek:
Usage Data in Web Search: Benefits and Limitations. SPIRE 2012: 16 - Krisztian Balog, Robert Neumayer, Kjetil Nørvåg:
Collection Ranking and Selection for Federated Entity Search. SPIRE 2012: 73-85 - Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE 2012: 86-98 - Timo Beller, Katharina Berger, Enno Ohlebusch:
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. SPIRE 2012: 99-110 - Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - Guillaume Blin, Minghui Jiang, Stéphane Vialette:
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142 - Felipe Bravo-Marquez, Manuel Manriquez:
A Zipf-Like Distant Supervision Approach for Multi-document Summarization Using Wikinews Articles. SPIRE 2012: 143-154 - Nieves R. Brisaboa, Ana Cerdeira-Pena, Gonzalo Navarro, Oscar Pedreira:
Ranked Document Retrieval in (Almost) No Space. SPIRE 2012: 155-160 - Nieves R. Brisaboa, Gonzalo Navarro, Alberto Ordóñez Pereira:
Smaller Self-indexes for Natural Language. SPIRE 2012: 372-378 - Berkant Barla Cambazoglu, Ismail Sengör Altingövde:
Impact of Regionalization on Performance of Web Search Engine Result Caches. SPIRE 2012: 161-166 - Francisco Claude, Gonzalo Navarro:
The Wavelet Matrix. SPIRE 2012: 167-179 - Francisco Claude, Gonzalo Navarro:
Improved Grammar-Based Compressed Indexes. SPIRE 2012: 180-192 - Gaël Dias, José G. Moreno, Adam Jatowt, Ricardo Campos:
Temporal Web Image Retrieval. SPIRE 2012: 199-204 - Amr Elmasry, Jyrki Katajainen, Jukka Teuhola:
Improved Address-Calculation Coding of Integer Arrays. SPIRE 2012: 205-216 - Simone Faro, M. Oguzhan Külekci:
Fast Multiple String Matching Using Streaming SIMD Extensions Technology. SPIRE 2012: 217-228 - Pawel Gawrychowski:
Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings. SPIRE 2012: 229-236 - Clément de Groc, Xavier Tannier:
Experiments on Pseudo Relevance Feedback Using Graph Random Walks. SPIRE 2012: 193-198 - Yaakov HaCohen-Kerner, Izek Greenfield:
Basic Word Completion and Prediction for Hebrew. SPIRE 2012: 237-244 - Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Eager XPath Evaluation over XML Streams. SPIRE 2012: 245-250 - Jing He, Jian-Yun Nie, Yang Lu, Wayne Xin Zhao:
Position-Aligned Translation Model for Citation Recommendation. SPIRE 2012: 251-263 - Cecilia Hernández, Gonzalo Navarro:
Compressed Representation of Web and Social Networks via Dense Subgraphs. SPIRE 2012: 264-276 - Lamjed Ben Jabeur, Lynda Tamine, Mohand Boughanem:
Active Microbloggers: Identifying Influencers, Leaders and Discussers in Microblogging Networks. SPIRE 2012: 111-117 - Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa:
Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE 2012: 330-335 - Se-Jong Kim, Jong-Hyeok Lee:
Method of Mining Subtopics Using Dependency Structure and Anchor Texts. SPIRE 2012: 277-283
skipping 13 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-04-25 03:16 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