期刊


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

题名作者出版年年卷期
Structural properties of XPath fragmentsMichael Benedikt; Wenfei Fan; Gabriel Kuper20052005, vol.336, no.1
Decidable containment of recursive queriesDiego Calvanese; Giuseppe De Giacomo; Moshe Y. Vardi20052005, vol.336, no.1
XML queries and constraints, containment and reformulationAlin Deutsch; Val Tannen20052005, vol.336, no.1
Data exchange: semantics and query answerinRonald Fagin; Phokion G. Kolaitis; Renee J. Miller; Lucian Popa20052005, vol.336, no.1
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databasesFloris Geerts; Bart Kuijpers20052005, vol.336, no.1
On the complexity of typechecking top-down XML transformationsWim Martens; Frank Neven20052005, vol.336, no.1
On reasoning about structural equality in XML: a description logic approachDavid Toman; Grant Weddell20052005, vol.336, no.1