期刊


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

2005, vol.330, no.1 2005, vol.330, no.2 2005, vol.330, no.3 2005, vol.331, no.1 2005, vol.331, no.2-3 2005, vol.332, no.1-3
2005, vol.333, no.1-2 2005, vol.333, no.3 2005, vol.334, no.1-3 2005, vol.335, no.1 2005, vol.335, no.2-3 2005, vol.336, no.1
2005, vol.336, no.2-3 2005, vol.337, no.1-3 2005, vol.338, no.1-3 2005, vol.339, no.1 2005, vol.339, no.2-3 2005, vol.340, no.1
2005, vol.340, no.2 2005, vol.340, no.3 2005, vol.341, no.1-3 2005, vol.342, no.1 2005, vol.342, no.2-3 2005, vol.343, no.1-2
2005, vol.343, no.3 2005, vol.344, no.1 2005, vol.344, no.2-3 2005, vol.345, no.1 2005, vol.345, no.2-3 2005, vol.346, no.1
2005, vol.346, no.2-3 2005, vol.347, no.1-2 2005, vol.347, no.3 2005, vol.348, no.1 2005, vol.348, no.2-3 2005, vol.349, no.1
2005, vol.349, no.2 2005, vol.349, no.3

题名作者出版年年卷期
Compositional characterisations of λ-terms using intersection typesM. Dezani-Ciancaglini; F. Honsell; Y. Motohama20052005, vol.340, no.3
Subtractive reductions and complete problems for counting complexity classesArnaud Durand; Miki Hermann; Phokion G. Kolaitis20052005, vol.340, no.3
Radiocoloring in planar graphs: Complexity and approximationsD. A. Fotakis; S. E. Nikoletseas; V. G. Papadopbulou; P. G. Spirakis20052005, vol.340, no.3
Structured coalgebras and minimal HD-automata for the π-calculusUgo Montanari; Marco Pistore20052005, vol.340, no.3
Informative labeling schemes for graphsDavid Peleg20052005, vol.340, no.3
A hierarchy result for read-once branching programs with restricted parity nondeterminismPetr Savicky; Detlef Sieling20052005, vol.340, no.3
Explicit fusionsLucian Wischik; Philippa Gardner20052005, vol.340, no.3



制造业外文文献服务平台