期刊


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

2022, vol.897 2022, vol.898 2022, vol.899 2022, vol.900 2022, vol.901 2022, vol.902
2022, vol.903 2022, vol.904 2022, vol.905 2022, vol.906 2022, vol.907 2022, vol.908
2022, vol.909 2022, vol.910 2022, vol.911 2022, vol.912 2022, vol.913 2022, vol.914
2022, vol.915 2022, vol.916 2022, vol.917 2022, vol.918 2022, vol.919 2022, vol.920
2022, vol.921 2022, vol.922 2022, vol.923 2022, vol.924 2022, vol.925 2022, vol.926
2022, vol.927 2022, vol.928 2022, vol.929 2022, vol.930 2022, vol.931 2022, vol.932
2022, vol.933 2022, vol.934 2022, vol.935 2022, vol.936 2022, vol.937 2022, vol.938

题名作者出版年年卷期
Properties of a class of Toeplitz wordsGabriele Fici; Jeffrey Shallit20222022, vol.922
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphsHao-Ping Yeh; Wei Lu; Li-Hsuan Chen; Ling-Ju Hung; Ralf Klasing; Sun-Yuan Hsieh20222022, vol.922
Survivability development of wireless sensor networks using neuro fuzzy-clonal selection optimizationJalawi Alshudukhi; Kusum Yadav20222022, vol.922
On the average-case complexity of pattern matching with wildcardsCarl Barton20222022, vol.922
Reliability measure of the n-th cartesian product of complete graph K_4 on h-extra edge-connectivityZhaoxia Tian; Mingzu Zhang; Xing Feng20222022, vol.922
Pebble guided optimal treasure hunt in anonymous graphsBarun Gorain; Kaushik Mondal; Himadri Nayak; Supantha Pandit20222022, vol.922
On vertex-weighted realizations of acyclic and general graphsAmotz Bar-Noy; Toni Bohnlein; David Peleg; Dror Rawitz20222022, vol.922
Hotelling games in fault-prone settingsChen Avin; Avi Cohen; Zvi Lotker; David Peleg20222022, vol.922
Sample complexity of hidden subgroup problemZekun Ye; Lvzhou Li20222022, vol.922
An improved kernel for planar vertex-disjoint triangle packingZimo Sheng; Mingyu Xiao20222022, vol.922
1234



制造业外文文献服务平台