期刊


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

题名作者出版年年卷期
Optimizing deletion cost for secure multicast key managementZhi-Zhong Chen; Ze Feng; Minming Li; Frances Yao20082008, vol.401, no.1-3
Complexity of unique list colorabilityDaniel Marx20082008, vol.401, no.1-3
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphismsDavid A. Cohen; Martin C. Cooper; Peter G. Jeavons20082008, vol.401, no.1-3
A near optimal scheduler for on-demand data broadcastsHing-Fung Ting20082008, vol.401, no.1-3
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functionsLane A. Hemaspaandra; Jorg Rothe; Amitabh Saxena20082008, vol.401, no.1-3
Online scheduling of equal-processing-time task systemsYumei Huo; Joseph Y. T. Leung; Xin Wang20082008, vol.401, no.1-3
Complexity and approximation for precedence constrained scheduling problems with large communication delaysRodolphe Giroudeau; Jean-Claude Konig; Farida Kamila Moulai; Jerome Palaysi20082008, vol.401, no.1-3
The complexity of uniform Nash equilibria and related regular subgraph problemsVincenzo Bonifaci; Ugo Di Iorio; Luigi Laura20082008, vol.401, no.1-3
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problemsJanina Brenner; Guido Schafer20082008, vol.401, no.1-3
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded lengthVictor Chepoi; Bertrand Estellon; Yann Vaxes20082008, vol.401, no.1-3
123



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024