中国机械工程学会生产工程分会知识服务平台
主页
文献资源
外文期刊
外文会议
中文期刊
专业机构
生产工程
智能制造
高级检索
关于我们
版权声明
使用帮助
期刊
ISSN
0304-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
2009, vol.410, no.1
2009, vol.410, no.11
2009, vol.410, no.12-13
2009, vol.410, no.14
2009, vol.410, no.15
2009, vol.410, no.16
2009, vol.410, no.17
2009, vol.410, no.18
2009, vol.410, no.19
2009, vol.410, no.20
2009, vol.410, no.21/23
2009, vol.410, no.2-3
2009, vol.410, no.24/25
2009, vol.410, no.26
2009, vol.410, no.27/29
2009, vol.410, no.30/32
2009, vol.410, no.33/34
2009, vol.410, no.35
2009, vol.410, no.36
2009, vol.410, no.37
2009, vol.410, no.38/40
2009, vol.410, no.41
2009, vol.410, no.42
2009, vol.410, no.43
2009, vol.410, no.44
2009, vol.410, no.45
2009, vol.410, no.4-5
2009, vol.410, no.46
2009, vol.410, no.47/49
2009, vol.410, no.50
2009, vol.410, no.51
2009, vol.410, no.52
2009, vol.410, no.6-7
2009, vol.410, no.8-10
题名
作者
出版年
年卷期
On the parameterized complexity of multiple-interval graph problems
Michael R. Fellows; Danny Hermelin; Frances Rosamond; Stephane Vialette
2009
2009, vol.410, no.1
A cyclic binary morphism avoiding Abelian fourth powers
James D. Currie; Ali Aberkane
2009
2009, vol.410, no.1
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Christian Choffrut; Serge Grigorieff
2009
2009, vol.410, no.1
Minimal interval completion through graph exploration
Karol Suchan; Ioan Todinca
2009
2009, vol.410, no.1
Fault-tolerant computation of distributed regular path queries
Maryam Shoaran; Alex Thomo
2009
2009, vol.410, no.1
All-pairs nearly 2-approximate shortest paths in O(n{sup}2polylogn) time
Surender Baswana; Vishrut Goyal; Sandeep Sen
2009
2009, vol.410, no.1
The minimal Laplacian spectral radius of trees with a given diameter
Ruifang Liu; Zhonghua Lu; Jinlong Shu
2009
2009, vol.410, no.1
On the descriptional complexity of scattered context grammars
Tomas Masopust
2009
2009, vol.410, no.1
The complexity of power-index comparison
Piotr Faliszewski; Lane Hemaspaandra
2009
2009, vol.410, no.1
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
Pinar Heggernes; Charis Papadopoulos
2009
2009, vol.410, no.1
1
2
国家科技图书文献中心
全球文献资源网
京ICP备05055788号-26
京公网安备11010202008970号 机械工业信息研究院 2018-2024