知识中心主页
文献服务
文献资源
外文期刊
外文会议
专业机构
智能制造
高级检索
版权声明
使用帮助
期刊
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
题名
作者
出版年
年卷期
An edge deletion model for complex networks
Pawel Pralat; Changping Wang
2011
2011, vol.412, no.39
Randomized competitive algorithms for online buffer management in the adaptive adversary model
Marcin Bienkowski; Marek Chrobak; Lukasz Jez
2011
2011, vol.412, no.39
Expressive power of LL(k) Boolean grammars
Alexander Okhotin
2011
2011, vol.412, no.39
Drawing graphs with right angle crossings
Walter Didimo; Peter Eades; Giuseppe Liotta
2011
2011, vol.412, no.39
Minimum energy broadcast on rectangular grid wireless networks
Atsushi Murata; Akira Matsubayashi
2011
2011, vol.412, no.39
Succinct data structures for Searchable Partial Sums with optimal worst-case performance
Wing-Kai Hon; Kunihiko Sadakane; Wing-Kin Sung
2011
2011, vol.412, no.39
Boolean-width of graphs
Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle
2011
2011, vol.412, no.39
Shortest paths between shortest paths
Marcin Kaminski; Paul Medvedev; Martin Milanic
2011
2011, vol.412, no.39
Improved bounds for online scheduling with eligibility constraints
Kyungkuk Lim; Kangbok Lee; Soo Y. Chang
2011
2011, vol.412, no.39
Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
Ming Liu; Feifeng Zheng; Chengbin Chu; Yinfeng Xu
2011
2011, vol.412, no.39
1
2
3
4
制造业外文文献服务平台