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 15 matches
- 2004
- Amihood Amir:
Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View. Stringology 2004: 1-23 - Abdullah N. Arslan, Ömer Egecioglu:
Algorithms for the Constrained Longest Common Subsequence Problems. Stringology 2004: 24-32 - Domenico Cantone, Salvatore Cristofaro, Simone Faro:
Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. Stringology 2004: 33-47 - Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest:
A Simple Lossless Compression Heuristic for Grey Scale Images. Stringology 2004: 48-55 - Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen:
BDD-Based Analysis of Gapped q-Gram Filters. Stringology 2004: 56-68 - Frantisek Franek, William F. Smyth:
Sorting suffixes of two-pattern strings. Stringology 2004: 69-78 - Heikki Hyyrö:
A Note on Bit-Parallel Alignment Computation. Stringology 2004: 79-87 - Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot:
A First Approach to Finding Common Motifs With Gaps. Stringology 2004: 88-97 - Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113 - Yair Kaufman, Shmuel T. Klein:
Semi-Lossless Text Compression. Stringology 2004: 114-123 - Uli Laube, Maik Weinard:
Conditional Inequalities and the Shortest Common Superstring Problem. Stringology 2004: 124-138 - Alban Mancheron, Christophe Moan:
Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles. Stringology 2004: 139-154 - Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie:
A Framework for the Dynamic Implementation of Finite Automata for Performance Enhancement. Stringology 2004: 155-167 - Jan Supol, Borivoj Melichar:
Arithmetic Coding in Parallel. Stringology 2004: 168-187 - Milan Simánek, Jan Holub:
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30 - September 1, 2004. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2004, ISBN 80-01-03050-4 [contents]
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-12-30 09:35 CET 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