期刊


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

题名作者出版年年卷期
Rectangular polyomino set weak (1,2)-achievement gamesEdgar Fisher; Nandor Sieben20082008, vol.409, no.3
Games to induce specified equilibriaAntoniy Ganchev; Lata Narayanan; Sunil Shende20082008, vol.409, no.3
Sequential vector packingMark Cieliebak; Alexander Hall; Riko Jacob; Marc Nunkesser20082008, vol.409, no.3
Complexity of question/answer gamesSarmad Abbasi; Numan Sheikh20082008, vol.409, no.3
The pruning-grafting lattice of binary treesJ. L. Baril; J. M. Pallo20082008, vol.409, no.3
Algorithms for subsequence combinatoricsCees Elzinga; Sven Rahmann; Hui Wang20082008, vol.409, no.3
A quadratic identity for the number of perfect matchings of plane graphsWeigen Yan; Fuji Zhang20082008, vol.409, no.3
Simulating one-reversal multicounter machines by partially blind multihead finite automataAlan Deckelbaum20082008, vol.409, no.3
Minimum-cost delegation in service compositionCagdas E. Gerede; Oscar H. Ibarra; Bala Ravikumar; Jianwen Su20082008, vol.409, no.3
Long binary patterns are Abelian 2-avoidableJames D. Currie; Terry I. Visentin20082008, vol.409, no.3
123