期刊


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

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 problemsMichael R. Fellows; Danny Hermelin; Frances Rosamond; Stephane Vialette20092009, vol.410, no.1
A cyclic binary morphism avoiding Abelian fourth powersJames D. Currie; Ali Aberkane20092009, vol.410, no.1
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.Christian Choffrut; Serge Grigorieff20092009, vol.410, no.1
Minimal interval completion through graph explorationKarol Suchan; Ioan Todinca20092009, vol.410, no.1
Fault-tolerant computation of distributed regular path queriesMaryam Shoaran; Alex Thomo20092009, vol.410, no.1
All-pairs nearly 2-approximate shortest paths in O(n{sup}2polylogn) timeSurender Baswana; Vishrut Goyal; Sandeep Sen20092009, vol.410, no.1
The minimal Laplacian spectral radius of trees with a given diameterRuifang Liu; Zhonghua Lu; Jinlong Shu20092009, vol.410, no.1
On the descriptional complexity of scattered context grammarsTomas Masopust20092009, vol.410, no.1
The complexity of power-index comparisonPiotr Faliszewski; Lane Hemaspaandra20092009, vol.410, no.1
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletionsPinar Heggernes; Charis Papadopoulos20092009, vol.410, no.1
12



制造业外文文献服务平台