期刊


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

2012, vol.413, no.1 2012, vol.414, no.1 2012, vol.415 2012, vol.416 2012, vol.417 2012, vol.418
2012, vol.419 2012, vol.420 2012, vol.421 2012, vol.422 2012, vol.423 2012, vol.424
2012, vol.425 2012, vol.426/427 2012, vol.428 2012, vol.429 2012, vol.430 2012, vol.431
2012, vol.432 2012, vol.433 2012, vol.434 2012, vol.435 2012, vol.436 2012, vol.437
2012, vol.438 2012, vol.439 2012, vol.440/441 2012, vol.442 2012, vol.443 2012, vol.444
2012, vol.445 2012, vol.446 2012, vol.447 2012, vol.448 2012, vol.449 2012, vol.450
2012, vol.451 2012, vol.452 2012, vol.453 2012, vol.454 2012, vol.455 2012, vol.456
2012, vol.457 2012, vol.458 2012, vol.459 2012, vol.460 2012, vol.461 2012, vol.462
2012, vol.463 2012, vol.464 2012, vol.465 2012, vol.466

题名作者出版年年卷期
Randomized truthful algorithms for scheduling selfish tasks on parallel machinesEric Angel; Evripidis Bampis; Nicolas Thibault20122012, vol.414, no.1
Paperfolding morphisms, planefilling curves, and fractal tilesMichel Dekking20122012, vol.414, no.1
The possible cardinalities of global secure sets in cographsKatarzyna Jesse-Jozefczyk20122012, vol.414, no.1
On the complexity of a family of k-context-free sequencesMarion Le Gonidec20122012, vol.414, no.1
Characterizations of locally testable linear- and affine-invariant familiesAngsheng Li; Yicheng Pan20122012, vol.414, no.1
Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignmentFrancois Petitjean; Pierre Gancarski20122012, vol.414, no.1
Updating the complexity status of coloring graphs without a fixed induced linear forestHajo Broersma; Petr A. Golovach; Daniel Paulusma; Jian Song20122012, vol.414, no.1
Approximating edge dominating set in dense graphsRichard Schmied; Claus Viehmann20122012, vol.414, no.1



制造业外文文献服务平台