Остановите войну!
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 22 matches
- 2018
- Étienne André, Shang-Wei Lin:
The language preservation problem is undecidable for parametric event-recording automata. Inf. Process. Lett. 136: 17-20 (2018) - Jing Chen:
The pessimistic diagnosability of Split-Star Networks under the PMC model. Inf. Process. Lett. 136: 80-82 (2018) - Meirun Chen, Reza Naserasr:
The optimal routing of augmented cubes. Inf. Process. Lett. 136: 59-63 (2018) - Ashutosh Dhar Dwivedi, Pawel Morawiecki, Rajani Singh, Shalini Dhar:
Differential-linear and related key cryptanalysis of round-reduced scream. Inf. Process. Lett. 136: 5-8 (2018) - Hang Gao, Wenyu Gao:
Maximum matching and kernelization of edge dominating set. Inf. Process. Lett. 136: 21-24 (2018) - Stefan Hoffmann, Thomas Kampermann, Egon Wanke:
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements. Inf. Process. Lett. 136: 25-29 (2018) - Katharina T. Huber, Vincent Moulton, Marie-France Sagot, Blerina Sinaimeri:
Geometric medians in reconciliation spaces of phylogenetic trees. Inf. Process. Lett. 136: 96-101 (2018) - Massimo Lauria, Neil Thapen:
On semantic cutting planes with very small coefficients. Inf. Process. Lett. 136: 70-75 (2018) - Xiaomin Li, Lan Lei, Hong-Jian Lai:
The connectivity of generalized graph products. Inf. Process. Lett. 136: 37-40 (2018) - Mugang Lin, Qilong Feng, Jianxin Wang, Jianer Chen, Bin Fu, Wenjun Li:
An improved FPT algorithm for Almost Forest Deletion problem. Inf. Process. Lett. 136: 30-36 (2018) - Kejing Lu, Hongya Wang, Yingyuan Xiao, Hui Song:
Why locality sensitive hashing works: A practical perspective. Inf. Process. Lett. 136: 49-58 (2018) - Salvador Lucas, Raúl Gutiérrez:
Use of logical models for proving infeasibility in term rewriting. Inf. Process. Lett. 136: 90-95 (2018) - Fei Ma, Bing Yao:
The number of spanning trees of a class of self-similar fractal models. Inf. Process. Lett. 136: 64-69 (2018) - Or Meir:
The direct sum of universal relations. Inf. Process. Lett. 136: 105-111 (2018) - Lin-Zhi Shen, Jiejing Wen, Fang-Wei Fu:
A new class of zero-difference balanced functions. Inf. Process. Lett. 136: 9-11 (2018) - Alexander V. Smal, Navid Talebanfard:
Prediction from partial information and hindsight, an alternative proof. Inf. Process. Lett. 136: 102-104 (2018) - Mengduo Yang, Fanzhang Li, Li Zhang, Zhao Zhang:
Deep learning algorithm with visual impression. Inf. Process. Lett. 136: 1-4 (2018) - Mengduo Yang, Fanzhang Li, Li Zhang, Zhao Zhang:
Lie group impression for deep learning. Inf. Process. Lett. 136: 12-16 (2018) - Hailiang Zhang:
On the largest matching roots of graphs with cut edges. Inf. Process. Lett. 136: 41-43 (2018) - Xin Zhang, Jingfen Lan, Bi Li, Qiang Zhu:
Light paths and edges in families of outer-1-planar graphs. Inf. Process. Lett. 136: 83-89 (2018) - Chuangying Zhu, Junping Du:
Background feature clustering and its application to social text. Inf. Process. Lett. 136: 44-48 (2018) - Anastazia Zunic:
Shape diameter for object analysis. Inf. Process. Lett. 136: 76-79 (2018)
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-29 10:03 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