期刊


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

2008, vol.390, no.1 2008, vol.390, no.2-3 2008, vol.391, no.1-2 2008, vol.391, no.3 2008, vol.392, no.1-3 2008, vol.393, no.1-3
2008, vol.394, no.1-2 2008, vol.394, no.3 2008, vol.395, no.1 2008, vol.395, no.2-3 2008, vol.396, no.1-3 2008, vol.397, no.1-3
2008, vol.398, no.1-3 2008, vol.399, no.1-2 2008, vol.399, no.3 2008, vol.400, no.1-3 2008, vol.401, no.1-3 2008, vol.402, no.1
2008, vol.402, no.2-3 2008, vol.403, no.1 2008, vol.403, no.2-3 2008, vol.404, no.1-2 2008, vol.404, no.3 2008, vol.405, no.1-2
2008, vol.405, no.3 2008, vol.406, no.1-2 2008, vol.406, no.3 2008, vol.407, no.1-3 2008, vol.408, no.1 2008, vol.408, no.2-3
2008, vol.409, no.1 2008, vol.409, no.2 2008, vol.409, no.3

题名作者出版年年卷期
Comparison between parallel and serial dynamics of Boolean networksE. Goles; L. Salinas20082008, vol.396, no.1-3
Competitive analysis of most-request-first for scheduling broadcasts with start-up delayRegant Y. S. Hung; H. F. Ting20082008, vol.396, no.1-3
Tight bounds for the multiplicative complexity of symmetric functionsJoan Boyar; Rene Peralta20082008, vol.396, no.1-3
Partitioned probe comparability graphsDavid B. Chandler; Maw-Shang Chang; Ton Kloks; Jiping Liu; Sheng-Lung Peng20082008, vol.396, no.1-3
Palindrome positions in ternary square-free wordsJames D. Currie20082008, vol.396, no.1-3
A simple transitive signature scheme for directed treesGregory Neven20082008, vol.396, no.1-3
Paths in circuit graphs of matroidsGuizhen Liu; Ping Li20082008, vol.396, no.1-3
On the clique partitioning problem in weighted interval graphsYoung-Soo Myung20082008, vol.396, no.1-3
On the obfuscation complexity of planar graphsOleg Verbitsky20082008, vol.396, no.1-3
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespanLingfa Lu; Liqi Zhang; Jinjiang Yuan20082008, vol.396, no.1-3
123