期刊


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

题名作者出版年年卷期
Setting port numbers for fast graph explorationDavid Ilcinkas20082008, vol.401, no.1-3
Solving difference equations whose coefficients are not transcendentalManuel Kauers20082008, vol.401, no.1-3
Embedding of meshes in Mobius cubesChang-Hsiung Tsai20082008, vol.401, no.1-3
Analysis of set-up time models: A metric perspectiveEitan Bachmat; Tao Kai Lam; Avner Magen20082008, vol.401, no.1-3
Reversal complexity revisitedAndre Hernich; Nicole Schweikardt20082008, vol.401, no.1-3
The complexity of Tarski's fixed point theoremChing-Lueh Chang; Yuh-Dauh Lyuu; Yen-Wu Ti20082008, vol.401, no.1-3
On bases of identities for the ω-variety generated by locally testable semigroupsJose Carlos Costa; Conceicao Nogueira20082008, vol.401, no.1-3
How many runs can a string contain?Simon J. Puglisi; Jamie Simpson; W. F. Smyth20082008, vol.401, no.1-3
Schutzenberger's theorem on formal power series follows from Kleene's theoremDietrich Kuske20082008, vol.401, no.1-3
Seeing the trees and their branches in the network is hardIyad A. Kanj; Luay Nakhleh; Cuong Than; Ge Xia20082008, vol.401, no.1-3
123



制造业外文文献服务平台