Остановите войну!
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 21 matches
- 2016
- Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan:
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. 656: 241-248 (2016) - Carl Barton, Chang Liu, Solon P. Pissis:
Linear-time computation of prefix table for weighted strings & applications. Theor. Comput. Sci. 656: 160-172 (2016) - Samik Basu, Tevfik Bultan:
On deciding synchronizability for asynchronously communicating systems. Theor. Comput. Sci. 656: 60-75 (2016) - Dario Carotenuto, Aniello Murano, Adriano Peron:
Ordered multi-stack visibly pushdown automata. Theor. Comput. Sci. 656: 1-26 (2016) - Joshimar Cordova, Gonzalo Navarro:
Simple and efficient fully-functional succinct trees. Theor. Comput. Sci. 656: 135-145 (2016) - Maxime Crochemore, Robert Mercas:
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656: 234-240 (2016) - Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
Binary block order Rouen Transform. Theor. Comput. Sci. 656: 118-134 (2016) - Razvan Diaconescu:
Functorial semantics of first-order views. Theor. Comput. Sci. 656: 46-59 (2016) - Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast computation of abelian runs. Theor. Comput. Sci. 656: 256-264 (2016) - Xiang Fu:
On detecting environment sensitivity using slicing. Theor. Comput. Sci. 656: 27-45 (2016) - Alice Héliou, Martine Léonard, Laurent Mouchard, Mikaël Salson:
Efficient dynamic range minimum query. Theor. Comput. Sci. 656: 108-117 (2016) - Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656: 215-224 (2016) - Costas S. Iliopoulos, Simon J. Puglisi:
Foreword. Theor. Comput. Sci. 656: 107 (2016) - Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. 656: 265-278 (2016) - Youngho Kim, Joong Chae Na, Heejin Park, Jeong Seop Sim:
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. Theor. Comput. Sci. 656: 173-179 (2016) - Björn Lellmann:
Hypersequent rules with restricted contexts for propositional modal logics. Theor. Comput. Sci. 656: 76-105 (2016) - Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656: 225-233 (2016) - Wojciech Rytter:
Two fast constructions of compact representations of binary words with given set of periods. Theor. Comput. Sci. 656: 180-187 (2016) - Jamie Simpson:
An abelian periodicity lemma. Theor. Comput. Sci. 656: 249-255 (2016) - Fatema Tuz Zohora, M. Sohel Rahman:
An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications. Theor. Comput. Sci. 656: 188-214 (2016)
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-05 20:44 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