期刊


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

2010, vol.411, no.1 2010, vol.411, no.10 2010, vol.411, no.11/13 2010, vol.411, no.14/15 2010, vol.411, no.16/18 2010, vol.411, no.19
2010, vol.411, no.2 2010, vol.411, no.20 2010, vol.411, no.21 2010, vol.411, no.22/24 2010, vol.411, no.25 2010, vol.411, no.26/28
2010, vol.411, no.29/30 2010, vol.411, no.3 2010, vol.411, no.31/33 2010, vol.411, no.34/36 2010, vol.411, no.37 2010, vol.411, no.4/5
2010, vol.411, no.40/42 2010, vol.411, no.43 2010, vol.411, no.44/46 2010, vol.411, no.47 2010, vol.411, no.48 2010, vol.411, no.49
2010, vol.411, no.50 2010, vol.411, no.51/52 2010, vol.411, no.6 2010, vol.411, no.7/9

题名作者出版年年卷期
An efficient counting networkCostas Busch; Marios Mavronicolas20102010, vol.411, no.34/36
Continuous consensus with ambiguous failuresTal Mizrahi; Yoram Moses20102010, vol.411, no.34/36
Single source shortest paths in H-minor free graphsRaphael Yuster20102010, vol.411, no.34/36
The frequent items problem, under polynomial decay, in the streaming modelGuy Feigenblat; Ofra Itzhaki; Ely Porat20102010, vol.411, no.34/36
Approximating the max-edge-coloring problemN. Bourgeois; G. Lucarelli; I. Milis; V. Th. Paschos20102010, vol.411, no.34/36
Decomposing trees with large diameterRomain Ravaux20102010, vol.411, no.34/36
Class constrained bin packing revisitedLeah Epstein; Csanad Imreh; Asaf Levin20102010, vol.411, no.34/36
Adaptive star grammars and their languagesFrank Drewes; Berthold Hoffmann; Dirk Janssens; Mark Minas20102010, vol.411, no.34/36
Optimality of some algorithms to detect quasiperiodicitiesR. Groult; G. Richomme20102010, vol.411, no.34/36
Reconstructing hv-convex multi-coloured polyominoesAdam Bains; Therese Biedl20102010, vol.411, no.34/36
123



制造业外文文献服务平台