期刊


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

2004, vol.310, no.1-3 2004, vol.311, no.1-3 2004, vol.312, no.1 2004, vol.312, no.2-3 2004, vol.313, no.1 2004, vol.313, no.2
2004, vol.313, no.3 2004, vol.314, no.1-2 2004, vol.314, no.3 2004, vol.315, no.1 2004, vol.315, no.2-3 2004, vol.316, no.1-3
2004, vol.317, no.1-3 2004, vol.318, no.1-2 2004, vol.318, no.3 2004, vol.319, no.1-3 2004, vol.320, no.1 2004, vol.320, no.2-3
2004, vol.321, no.1 2004, vol.321, no.2-3 2004, vol.322, no.1 2004, vol.322, no.2 2004, vol.322, no.3 2004, vol.323, no.1-3
2004, vol.324, no.1 2004, vol.324, no.2-3 2004, vol.325, no.1 2004, vol.325, no.2 2004, vol.325, no.3 2004, vol.326, no.1-3
2004, vol.327, no.1-2 2004, vol.327, no.3 2004, vol.328, no.1-2 2004, vol.328, no.3 2004, vol.329, no.1-3

题名作者出版年年卷期
On dart-free perfectly contractile graphsClaudia Linhares Sales; Frederic Maffray20042004, vol.321, no.2-3
Analysis of randomized load distribution for reproduction trees in linear arrays and ringsKeqin Li20042004, vol.321, no.2-3
Graph traversal and graph transformationJason J. Holdsworth20042004, vol.321, no.2-3
Evolution and observation-a non-standard way to generate formal languagesMatteo Cavaliere; Peter Leupold20042004, vol.321, no.2-3
On Kurtz randomnessRodney G. Downey; Evan J. Griffiths; Stephanie Reid20042004, vol.321, no.2-3
On the least exponential growth admitting uncountably many closed permutation classesMartin Klazar20042004, vol.321, no.2-3
Average complexity of exact and approximate multiple string matchingGonzalo Navarro; Kimmo Fredriksson20042004, vol.321, no.2-3
Updatable timed automataPatricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit20042004, vol.321, no.2-3
On the complexity of resolution with bounded conjunctionsJuan Luis Esteban; Nicola Galesi; Jochen Messner20042004, vol.321, no.2-3
On domain-partitioning induction criteria: worst-case bounds for the worst-case basedRichard Nock; Frank Nielsen20042004, vol.321, no.2-3
12