期刊


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

2009, vol.410, no.1 2009, vol.410, no.11 2009, vol.410, no.12-13 2009, vol.410, no.14 2009, vol.410, no.15 2009, vol.410, no.16
2009, vol.410, no.17 2009, vol.410, no.18 2009, vol.410, no.19 2009, vol.410, no.20 2009, vol.410, no.21/23 2009, vol.410, no.2-3
2009, vol.410, no.24/25 2009, vol.410, no.26 2009, vol.410, no.27/29 2009, vol.410, no.30/32 2009, vol.410, no.33/34 2009, vol.410, no.35
2009, vol.410, no.36 2009, vol.410, no.37 2009, vol.410, no.38/40 2009, vol.410, no.41 2009, vol.410, no.42 2009, vol.410, no.43
2009, vol.410, no.44 2009, vol.410, no.45 2009, vol.410, no.4-5 2009, vol.410, no.46 2009, vol.410, no.47/49 2009, vol.410, no.50
2009, vol.410, no.51 2009, vol.410, no.52 2009, vol.410, no.6-7 2009, vol.410, no.8-10

题名作者出版年年卷期
On the complexity of 2D discrete fixed point problemXi Chen; Xiaotie Deng20092009, vol.410, no.44
Optimal resilient sorting and searching in the presence of memory faultsIrene Finocchi; Fabrizio Grandoni; Giuseppe F. Italiano20092009, vol.410, no.44
A parameterized view on matroid optimization problemsDaniel Marx20092009, vol.410, no.44
Maximum weight bipartite matching in matrix multiplication timePiotr Sankowski20092009, vol.410, no.44
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroidsKamalika Chaudhuri; Satish Rao; Samantha Riesenfeld; Kunal Talwar20092009, vol.410, no.44
Approximation algorithms for orthogonal packing problems for hypercubesRolf Harren20092009, vol.410, no.44