default search action
Theoretical Computer Science, Volume 986
Volume 986, February 2024
- Xiaojin Zhang:
Improved algorithm for permutation testing. 114316 - Yong Wang:
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals. 114323 - Binbin Tu, Yu Chen, Hongrui Cui, Xianfang Wang:
Fast two-party signature for upgrading ECDSA to two-party scenario easily. 114325 - Tomás Dvorák, Mei-Mei Gu:
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. 114327
- Dimitrios Gerontitis, Changxin Mo, Predrag S. Stanimirovic, Vasilios N. Katsikis:
Improved zeroing neural models based on two novel activation functions with exponential behavior. 114328
- T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue:
Max-min greedy matching problem: Hardness for the adversary and fractional variant. 114329 - Xiaoqing Liu, Baolei Cheng, Yan Wang, Jia Yu, Jianxi Fan:
Enhancing fault tolerance of balanced hypercube networks by the edge partition method. 114340 - L'ubomíra Dvoráková:
String attractors of episturmian sequences. 114341 - Xiao-Tao Lü, Jin Chen, Zhi-Xiong Wen, Wen Wu:
On the 2-binomial complexity of the generalized Thue-Morse words. 114342 - Shuo Li:
A note on the Lie complexity and beyond. 114343 - Wen Yin, Jiarong Liang, Yuhao Xie, Changzhen Li:
The t/k-diagnosability of m-ary n-cube networks. 114345 - Bernard Berthomieu, Dmitry A. Zaitsev:
Sleptsov nets are Turing-complete. 114346
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.