期刊


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

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

题名作者出版年年卷期
Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristicsMinming Li20112011, vol.412, no.32
Complexity and approximation of the Constrained Forest problemCristina Bazgan; Basile Couetoux; Zsolt Tuza20112011, vol.412, no.32
Computing large matchings in planar graphs with fixed minimum degreeRobert Franke; Ignaz Rutter; Dorothea Wagner20112011, vol.412, no.32
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n~(1+∈)) timeQian-Ping Gu; Hisao Tamaki20112011, vol.412, no.32
Linear and sublinear time algorithms for the basis of abelian groupsLi Chen; Bin Fu20112011, vol.412, no.32
Electric routing and concurrent flow cuttingJonathan Kelner; Petar Maymounkov20112011, vol.412, no.32
Good programming in transactional memory Game theory meets multicore architectureRaphael Eidenbenz; Roger Wattenhofer20112011, vol.412, no.32
Bounds on contention management algorithmsJohannes Schneider; Roger Wattenhofer20112011, vol.412, no.32
Reconstructing polygons from scanner dataTherese Biedl; Stephane Durocher; Jack Snoeyink20112011, vol.412, no.32
The directed Hausdorff distance between imprecise point setsChristian Knauer; Maarten Loffler; Marc Scherfenberg; Thomas Wolle20112011, vol.412, no.32
12



制造业外文文献服务平台