主页
外文期刊
OA 期刊
电子期刊
外文会议
中文期刊
标准
网络数据库
专业机构
企业门户
起重机械
生产工程
高级检索
关于我们
版权声明
使用帮助
期刊
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
2011, vol.412, no.1/2
2011, vol.412, no.11
2011, vol.412, no.12/14
2011, vol.412, no.15
2011, vol.412, no.16
2011, vol.412, no.17
2011, vol.412, no.18
2011, vol.412, no.19
2011, vol.412, no.20
2011, vol.412, no.21
2011, vol.412, no.22
2011, vol.412, no.23
2011, vol.412, no.24
2011, vol.412, no.25
2011, vol.412, no.26
2011, vol.412, no.27
2011, vol.412, no.28
2011, vol.412, no.29
2011, vol.412, no.3
2011, vol.412, no.30
2011, vol.412, no.31
2011, vol.412, no.32
2011, vol.412, no.33
2011, vol.412, no.34
2011, vol.412, no.35
2011, vol.412, no.36
2011, vol.412, no.37
2011, vol.412, no.38
2011, vol.412, no.39
2011, vol.412, no.4/5
2011, vol.412, no.40
2011, vol.412, no.41
2011, vol.412, no.42
2011, vol.412, no.43
2011, vol.412, no.44
2011, vol.412, no.45
2011, vol.412, no.46
2011, vol.412, no.47
2011, vol.412, no.48
2011, vol.412, no.50
2011, vol.412, no.51
2011, vol.412, no.52
2011, vol.412, no.6
2011, vol.412, no.7
2011, vol.412, no.8/10
题名
作者
出版年
年卷期
Return time complexity of Sturmian sequences
Dong Han Kim
2011
2011, vol.412, no.29
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
Jianxi Fan; Xiaohua Jia; Baolei Cheng; Jia Yu
2011
2011, vol.412, no.29
Multiplication of polynomials modulo x~n
Murat Cenk; Ferruh Ozbudak
2011
2011, vol.412, no.29
Complexity of clique coloring and related problems
Daniel Marx
2011
2011, vol.412, no.29
Recognisability for algebras of infinite trees
Achim Blumensath
2011
2011, vol.412, no.29
Approximate string matching with stuck address bits
Amihood Amir; Estrella Eisenberg; Orgad Keller; Avivit Levy; Ely Porat
2011
2011, vol.412, no.29
Boundary properties of graphs for algorithmic graph problems
Nicholas Korpelainen; Vadim V. Lozin; Dmitriy S. Malyshev; Alexander Tiskin
2011
2011, vol.412, no.29
An improved lower bound on the sensitivity complexity of graph properties
Xiaoming Sun
2011
2011, vol.412, no.29
An exact algorithm for minimum distortion embedding
Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh
2011
2011, vol.412, no.29
Restricted ambiguity of erasing morphisms
Daniel Reidenbach; Johannes C. Schneider
2011
2011, vol.412, no.29
1
2
3
4
国家科技图书文献中心
全球文献资源网
京ICP备05055788号-26
京公网安备11010202008970号 机械工业信息研究院 2018-2024