Остановите войну!
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 18 matches
- 2013
- Michael Hirsch, Ariel Ish-Shalom, Shmuel Tomi Klein:
Optimal Partitioning of Data Chunks in Deduplication Systems. Stringology 2013: 128-141 - Ali Alatabbi, Costas S. Iliopoulos, Mohammad Sohel Rahman:
Maximal Palindromic Factorization. Stringology 2013: 70-77 - Dipankar Ranjan Baisya, Mir Md. Faysal, Mohammad Sohel Rahman:
Degenerate String Reconstruction from Cover Arrays. Stringology 2013: 191-205 - Domenico Cantone, Simone Faro:
Improved and Self-Tuned Occurrence Heuristics. Stringology 2013: 92-106 - Loek G. Cleophas, Derrick G. Kourie, Bruce W. Watson:
Weak Factor Automata: Comparing (Failure) Oracles and Storacles. Stringology 2013: 176-190 - Shuhei Denzumi, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato:
Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams . Stringology 2013: 157-167 - Simone Faro:
Swap Matching in Strings by Simulating Reactive Automata. Stringology 2013: 7-20 - Simone Faro, M. Oguzhan Külekci:
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. Stringology 2013: 78-91 - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. Stringology 2013: 168-175 - Stavros Konstantinidis, Joshua Young:
Deciding the Density Type of a Given Regular Language. Stringology 2013: 21-33 - Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Finding Distinct Subpalindromes Online. Stringology 2013: 63-69 - Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara:
On Morphisms Generating Run-Rich Strings. Stringology 2013: 35-47 - Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Sorting Suffixes of a Text via its Lyndon Factorization. Stringology 2013: 119-127 - Borivoj Melichar:
Graphs and Automata. Stringology 2013: 1-6 - Matthew Felice Pace, Alexander Tiskin:
Parallel Suffix Array Construction by Accelerated Sampling. Stringology 2013: 142-156 - Marcin Piatkowski:
The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words. Stringology 2013: 48-62 - Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Reversed Lempel-Ziv Factorization Online. Stringology 2013: 107-118 - Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2013, ISBN 978-80-01-05330-0 [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-05-28 06: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