Остановите войну!
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 29 matches
- 2008
- Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 - Diego Arroyuelo:
An Improved Succinct Representation for Dynamic k-ary Trees. CPM 2008: 277-289 - Anne Bergeron, Julia Mixtacki, Jens Stoye:
HP Distance Via Double Cut and Join Distance. CPM 2008: 56-68 - Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 - Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat:
A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151 - Maxime Crochemore, Lucian Ilie, Liviu Tinta:
Towards a Solution to the "Runs" Conjecture. CPM 2008: 290-302 - Martin Farach-Colton, Yang Huang:
A Linear Delay Algorithm for Building Concept Lattices. CPM 2008: 204-216 - Julien Fayolle:
Analysis of the Size of Antidictionary in. CPM 2008: 107-117 - Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree. CPM 2008: 152-165 - Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani:
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. CPM 2008: 217-229 - Leszek Gasieniec, Cindy Y. Li, Meng Zhang:
Faster Algorithm for the Set Variant of the String Barcoding Problem. CPM 2008: 82-94 - Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein:
Constrained LCS: Hardness and Approximation. CPM 2008: 255-262 - Dan Gusfield:
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. CPM 2008: 1-2 - Christian Hundt, Maciej Liskiewicz:
Two-Dimensional Pattern Matching with Combined Scaling and Rotation. CPM 2008: 5-17 - Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the Longest Common Parameterized Subsequence. CPM 2008: 303-315 - Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha:
On-Line Approximate String Matching with Bounded Errors. CPM 2008: 130-142 - Roman Kolpakov, Gregory Kucherov:
Searching for Gapped Palindromes. CPM 2008: 18-30 - Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li:
Finding Largest Well-Predicted Subset of Protein Structure Models. CPM 2008: 44-55 - Bin Ma:
Why Greed Works for Shortest Common Superstring Problem. CPM 2008: 244-254 - Tobias Marschall, Sven Rahmann:
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. CPM 2008: 95-106 - Mathias Möhl, Sebastian Will, Rolf Backofen:
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. CPM 2008: 69-81 - Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson:
Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243 - J. Ian Munro:
Lower Bounds for Succinct Data Structures. CPM 2008: 3 - Igor Nitto, Rossano Venturini:
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices. CPM 2008: 166-177 - Ge Nong, Sen Zhang, Wai Hong Chan:
Computing Inverse ST in Linear Complexity. CPM 2008: 178-190 - Prabhakar Raghavan:
The Changing Face of Web Search. CPM 2008: 4 - Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Dynamic Fully-Compressed Suffix Trees. CPM 2008: 191-203 - Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang:
Finding Additive Biclusters with Random Background. CPM 2008: 263-276 - Paolo Ferragina, Gad M. Landau:
Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Lecture Notes in Computer Science 5029, Springer 2008, ISBN 978-3-540-69066-5 [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-22 08:56 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