期刊


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

题名作者出版年年卷期
Covering the edges of bipartite graphs using K_(2,2) graphsDorit S. Hochbaum; Asaf Levin20102010, vol.411, no.1
NP-hard and linear variants of hypergraph partitioningLaurent Lyaudet20102010, vol.411, no.1
Theory of one-tape linear-time Turing machinesKohtaro Tadaki; Tomoyuki Yamakami; Jack C. H. Lin20102010, vol.411, no.1
Maximizing the minimum load for selfish agentsLeah Epstein; Rob van Stee20102010, vol.411, no.1
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower boundAchour Mostefaoui; Michel Raynal; Corentin Travers20102010, vol.411, no.1
On graphs of central episturmian wordsAldo de Luca; Luca Q. Zamboni20102010, vol.411, no.1
A graph theoretic approach to general Euler diagram drawingGem Stapleton; John Howse; Peter Rodgers20102010, vol.411, no.1
Stationary algorithmic probabilityMarkus Muller20102010, vol.411, no.1
Three results on frequency assignment in linear cellular networksMarek Chrobak; Jiri Sgall20102010, vol.411, no.1
Maximal width learning of binary functionsMartin Anthony; Joel Ratsaby20102010, vol.411, no.1
123



制造业外文文献服务平台