期刊


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

2003, vol.290, no.1 2003, vol.290, no.2 2003, vol.290, no.3 2003, vol.291, no.1 2003, vol.291, no.2 2003, vol.291, no.3
2003, vol.292, no.1 2003, vol.292, no.2 2003, vol.292, no.3 2003, vol.293, no.1 2003, vol.293, no.2 2003, vol.293, no.3
2003, vol.294, no.1-2 2003, vol.294, no.3 2003, vol.295, no.1-3 2003, vol.296, no.1 2003, vol.296, no.2 2003, vol.296, no.3
2003, vol.297, no.1-3 2003, vol.298, no.1 2003, vol.298, no.2 2003, vol.298, no.3 2003, vol.299, no.1-3 2003, vol.300, no.1-3
2003, vol.301, no.1-3 2003, vol.302, no.1-3 2003, vol.303, no.1 2003, vol.303, no.2-3 2003, vol.304, no.1-3 2003, vol.305, no.1-3
2003, vol.306, no.1-3 2003, vol.307, no.1 2003, vol.307, no.2 2003, vol.307, no.3 2003, vol.308, no.1-3 2003, vol.309, no.1-3

题名作者出版年年卷期
A new framework for declarative programmingStacy E. Finkelstein; Peter Freyd; James Lipton20032003, vol.300, no.1-3
On the non-termination of M{sub}(DG)-based abstract state enumerationOtmane Ait Mohamed; Xiaoyu Song; Eduard Cerny20032003, vol.300, no.1-3
Decidability results for primitive recursive algorithmsR. David20032003, vol.300, no.1-3
The power of reachability testing for timed automataLuca Aceto; Patricia Bouyer; Augusto Burgueno; Kim G. Larsen20032003, vol.300, no.1-3
Typing correspondence assertions for communication protocolsAndrew D. Gordon; Alan Jeffrey20032003, vol.300, no.1-3
A new proof-theoretic proof of the independence of Kirby-Paris' hydra theoremLorenzo Carlucci20032003, vol.300, no.1-3
Automata over continuous timeAlexander Rabinovich20032003, vol.300, no.1-3
Decision procedures for inductive Boolean functions based on alternating automataAbdelwaheb Ayari; David Basin; Felix Klaedtke20032003, vol.300, no.1-3
General parameterized refinement and recursion for the M-net calculusRaymond Devillers; Hanna Klaudel; Robert-C. Riemann20032003, vol.300, no.1-3
A polynomial space constriction of tree-like models for logics with local chains of modal connectivesStephane Demri20032003, vol.300, no.1-3
12



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024