期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002～2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2024, vol.1000 2024, vol.1001 2024, vol.1002 2024, vol.1003 2024, vol.1004 2024, vol.1005
2024, vol.1006 2024, vol.1007 2024, vol.981 2024, vol.982 2024, vol.983 2024, vol.984
2024, vol.985 2024, vol.986 2024, vol.987 2024, vol.988 2024, vol.989 2024, vol.990
2024, vol.991 2024, vol.992 2024, vol.993 2024, vol.994 2024, vol.995 2024, vol.996
2024, vol.997 2024, vol.998 2024, vol.999

题名作者出版年年卷期
String attractors of episturmian sequencesDvorakova, L'ubomira20242024, vol.986
Fast two-party signature for upgrading ECDSA to two-party scenario easilyTu, Binbin; Chen, Yu; Cui, Hongrui; Wang, Xianfang20242024, vol.986
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilateralsWang, Yong20242024, vol.986
Improved algorithm for permutation testingZhang, Xiaojin20242024, vol.986
Sleptsov nets are Turing-completeBerthomieu, Bernard; Zaitsev, Dmitry A.20242024, vol.986
On the 2-binomial complexity of the generalized Thue-Morse wordsLu, Xiao-Tao; Chen, Jin; Wen, Zhi-Xiong; Wu, Wen20242024, vol.986
Paired 2-disjoint path covers of burnt pancake graphs with faulty elementsDvorak, Tomas; Gu, Mei-Mei20242024, vol.986
Improved zeroing neural models based on two novel activation functions with exponential behaviorGerontitis, Dimitrios; Mo, Changxin; Stanimirovic, Predrag S.; Katsikis, Vasilios N.20242024, vol.986
Max-min greedy matching problem: Hardness for the adversary and fractional variantChan, T. -H. Hubert; Tang, Zhihao Gavin; Xue, Quan20242024, vol.986
The t/k -diagnosability of m -ary n -cube networksYin, Wen; Liang, Jiarong; Xie, Yuhao; Li, Changzhen20242024, vol.986
12



制造业外文文献服务平台