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 25 matches
- 2020
- Abdulelah Abdallah Algosaibi, Khaled Ragab, Saleh Albahli:
Parallel-Based Techniques for Managing and Analyzing the Performance on Semantic Graph. Parallel Process. Lett. 30(2): 2050007:1-2050007:14 (2020) - Gary Chartrand, Ping Zhang:
Uniformly Connected Graphs - A Survey. Parallel Process. Lett. 30(3): 2040002:1-2040002:16 (2020) - Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
Preface. Parallel Process. Lett. 30(3): 2002001:1 (2020) - Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. Parallel Process. Lett. 30(3): 2040009:1-2040009:14 (2020) - Carlos Fernandez, Ioannis Vourkas, Antonio Rubio:
Shortest Path Computing in Directed Graphs with Weighted Edges Mapped on Random Networks of Memristors. Parallel Process. Lett. 30(1): 2050002:1-2050002:19 (2020) - Zhendong Gu, Shuming Zhou, Jiafei Liu, Qianru Zhou, Dajin Wang:
Shapley Distance and Shapley Index for Some Special Graphs. Parallel Process. Lett. 30(4): 2050012:1-2050012:17 (2020) - Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg:
Shortening of Proof Length is Elusive for Theorem Provers. Parallel Process. Lett. 30(4): 2050013:1-2050013:14 (2020) - Cheng-Kuan Lin, Eddie Cheng, László Lipták:
Structure and Substructure Connectivity of Hypercube-Like Networks. Parallel Process. Lett. 30(3): 2040007:1-2040007:23 (2020) - Shangwei Lin, Jianfeng Pei, Chunfang Li:
Super Edge-Connected Linear Hypergraphs. Parallel Process. Lett. 30(3): 2040003:1-2040003:10 (2020) - Aixia Liu, Jun Yuan, Shiying Wang:
The g-Extra Conditional Diagnosability of Graphs in Terms of g-Extra Connectivity. Parallel Process. Lett. 30(3): 2040006:1-2040006:19 (2020) - Wantao Ning:
The Connectivity of Exchanged Folded Hypercube. Parallel Process. Lett. 30(1): 2050003:1-2050003:5 (2020) - Vedran Novakovic:
Batched Computation of the Singular Value Decompositions of Order Two by the AVX-512 Vectorization. Parallel Process. Lett. 30(4): 2050015:1-2050015:23 (2020) - Firmin Andzembe Okoubi, Jonas Koko:
Parallel Nesterov Domain Decomposition Method for Elliptic Partial Differential Equations. Parallel Process. Lett. 30(1): 2050004:1-2050004:15 (2020) - Chengfu Qin, Weihua Yang:
5-Shredders of Contraction-Critical 5-Connected Graphs. Parallel Process. Lett. 30(3): 2040008:1-2040008:16 (2020) - Sanjeev Saxena:
All Nearest Smallers Made Simple. Parallel Process. Lett. 30(2): 2050008:1-2050008:23 (2020) - Yuichi Sudo, Toshimitsu Masuzawa:
Leader Election Requires Logarithmic Time in Population Protocols. Parallel Process. Lett. 30(1): 2050005:1-2050005:13 (2020) - Yingzhi Tian, Huaping Ma, Liyun Wu:
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph. Parallel Process. Lett. 30(3): 2040005:1-2040005:9 (2020) - Karla Vargas, Sergio Rajsbaum, Michel Raynal:
An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values. Parallel Process. Lett. 30(2): 2050006:1-2050006:23 (2020) - Mujiangshan Wang, Dong Xiang, Shiying Wang:
Connectivity and Diagnosability of Leaf-Sort Graphs. Parallel Process. Lett. 30(3): 2040004:1-2040004:13 (2020) - Guanlei Xu, Xiaogang Xu:
The Parallel Quantum Algorithm for the Class of Optimization. Parallel Process. Lett. 30(4): 2050014:1-2050014:12 (2020) - Daolu Zha, Xi Jin, Rui Shang, Pengfei Yang:
A Real-Time Learning-Based Super-Resolution System on FPGA. Parallel Process. Lett. 30(4): 2050011:1-2050011:15 (2020) - Liyang Zhai, Liqiong Xu, Weihua Yang:
Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes. Parallel Process. Lett. 30(3): 2040001:1-2040001:13 (2020) - Shuangshuang Zhang, Yuzhi Xiao, Xia Liu, Jun Yin:
A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs. Parallel Process. Lett. 30(1): 2050001:1-2050001:8 (2020) - Qifan Zhang, Liqiong Xu, Weihua Yang, Shanshan Yin:
Reliability Analysis of the Generalized Exchanged Hypercube. Parallel Process. Lett. 30(2): 2050009:1-2050009:13 (2020) - Bo Zhu, Tianlong Ma, Shuangshuang Zhang, He Zhang:
Fractional Matching Preclusion for Data Center Networks. Parallel Process. Lett. 30(2): 2050010:1-2050010:10 (2020)
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-09-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