default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 755
Volume 755, January 2019
- Michael Wallner
:
A bijection of plane increasing trees with relaxed binary trees of right height at most one. 1-12 - Rafic Nader, Alain Bretto, Bassam Mourad, Hassan Abbas:
On the positive semi-definite property of similarity matrices. 13-28 - Albert Guan, Wen-Guey Tzeng:
A light-weight bit commitment protocol based on unpredictable channel noise. 29-37 - Zhao Wang, Christopher Melekian, Eddie Cheng, Yaping Mao:
Matching preclusion number in product graphs. 38-47 - Arne Leitert, Feodor F. Dragan:
Parameterized approximation algorithms for some location problems in graphs. 48-64 - Kai Zhang, Jie Chen, Hyung Tae Lee, Haifeng Qian, Huaxiong Wang:
Efficient public key encryption with equality test in the standard model. 65-80 - Jia Guo, Desai Li, Mei Lu:
The g-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model. 81-88 - Rui-Juan Jing, Chun-Ming Yuan, Xiao-Shan Gao:
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x]. 89-109
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-05 22:23 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:
