default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 905
Volume 905, February 2022
- Yalan Li, Jichang Wu, Shumin Zhang, Chengfu Ye:
Reliability of the round matching composition networks based on g-extra conditional fault. 1-9 - Nianpeng Zhang, Qiang Zhu
:
Two important parameters of HPMC model. 10-17 - Xin Zhang, Huaqiang Zhang, Bei Niu, Bi Li:
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy. 18-30 - Dung Hoang Duong, Partha Sarathi Roy, Willy Susilo, Kazuhide Fukushima, Shinsaku Kiyomoto, Arnaud Sipasseuth:
Chosen-ciphertext lattice-based public key encryption with equality test in standard model. 31-53 - Jiabing Wang, Jiaye Chen:
Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints. 54-68 - Micheal Arockiaraj, Arul Jeya Shalini, J. Nancy Delaila:
Embedding algorithm of spined cube into grid structure and its wirelength computation. 69-86 - Weidong Luo:
On some FPT problems without polynomial Turing compressions. 87-98 - Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial sums on the ultra-wide word RAM. 99-105
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 2025-12-12 01:09 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:
