default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Processing Letters, Volume 30
Volume 30, Number 1, March 2020
- Shuangshuang Zhang, Yuzhi Xiao
, Xia Liu, Jun Yin:
A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs. 2050001:1-2050001:8 - Carlos Fernandez, Ioannis Vourkas, Antonio Rubio:
Shortest Path Computing in Directed Graphs with Weighted Edges Mapped on Random Networks of Memristors. 2050002:1-2050002:19 - Wantao Ning:
The Connectivity of Exchanged Folded Hypercube. 2050003:1-2050003:5 - Firmin Andzembe Okoubi, Jonas Koko:
Parallel Nesterov Domain Decomposition Method for Elliptic Partial Differential Equations. 2050004:1-2050004:15 - Yuichi Sudo, Toshimitsu Masuzawa:
Leader Election Requires Logarithmic Time in Population Protocols. 2050005:1-2050005:13
Volume 30, Number 2, June 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. 2050006:1-2050006:23 - Abdulelah Abdallah Algosaibi, Khaled Ragab, Saleh Albahli:
Parallel-Based Techniques for Managing and Analyzing the Performance on Semantic Graph. 2050007:1-2050007:14 - Sanjeev Saxena:
All Nearest Smallers Made Simple. 2050008:1-2050008:23 - Qifan Zhang, Liqiong Xu, Weihua Yang, Shanshan Yin:
Reliability Analysis of the Generalized Exchanged Hypercube. 2050009:1-2050009:13 - Bo Zhu, Tianlong Ma, Shuangshuang Zhang, He Zhang:
Fractional Matching Preclusion for Data Center Networks. 2050010:1-2050010:10
Volume 30, Number 3, September 2020
- Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
Preface. 2002001:1 - Liyang Zhai, Liqiong Xu, Weihua Yang:
Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes. 2040001:1-2040001:13 - Gary Chartrand, Ping Zhang:
Uniformly Connected Graphs - A Survey. 2040002:1-2040002:16 - Shangwei Lin, Jianfeng Pei, Chunfang Li:
Super Edge-Connected Linear Hypergraphs. 2040003:1-2040003:10 - Mujiangshan Wang, Dong Xiang, Shiying Wang:
Connectivity and Diagnosability of Leaf-Sort Graphs. 2040004:1-2040004:13 - Yingzhi Tian, Huaping Ma, Liyun Wu:
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph. 2040005:1-2040005:9 - Aixia Liu, Jun Yuan, Shiying Wang:
The g-Extra Conditional Diagnosability of Graphs in Terms of g-Extra Connectivity. 2040006:1-2040006:19 - Cheng-Kuan Lin, Eddie Cheng, László Lipták:
Structure and Substructure Connectivity of Hypercube-Like Networks. 2040007:1-2040007:23 - Chengfu Qin, Weihua Yang:
5-Shredders of Contraction-Critical 5-Connected Graphs. 2040008:1-2040008:16 - Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. 2040009:1-2040009:14
Volume 30, Number 4, December 2020
- Daolu Zha, Xi Jin, Rui Shang, Pengfei Yang:
A Real-Time Learning-Based Super-Resolution System on FPGA. 2050011:1-2050011:15 - Zhendong Gu, Shuming Zhou, Jiafei Liu, Qianru Zhou, Dajin Wang:
Shapley Distance and Shapley Index for Some Special Graphs. 2050012:1-2050012:17 - Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg:
Shortening of Proof Length is Elusive for Theorem Provers. 2050013:1-2050013:14 - Guanlei Xu, Xiaogang Xu:
The Parallel Quantum Algorithm for the Class of Optimization. 2050014:1-2050014:12 - Vedran Novakovic:
Batched Computation of the Singular Value Decompositions of Order Two by the AVX-512 Vectorization. 2050015:1-2050015:23
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.
last updated on 2024-11-05 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
