长垣产业园区科技文献服务平台

期刊


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

2005, vol.330, no.1 2005, vol.330, no.2 2005, vol.330, no.3 2005, vol.331, no.1 2005, vol.331, no.2-3 2005, vol.332, no.1-3
2005, vol.333, no.1-2 2005, vol.333, no.3 2005, vol.334, no.1-3 2005, vol.335, no.1 2005, vol.335, no.2-3 2005, vol.336, no.1
2005, vol.336, no.2-3 2005, vol.337, no.1-3 2005, vol.338, no.1-3 2005, vol.339, no.1 2005, vol.339, no.2-3 2005, vol.340, no.1
2005, vol.340, no.2 2005, vol.340, no.3 2005, vol.341, no.1-3 2005, vol.342, no.1 2005, vol.342, no.2-3 2005, vol.343, no.1-2
2005, vol.343, no.3 2005, vol.344, no.1 2005, vol.344, no.2-3 2005, vol.345, no.1 2005, vol.345, no.2-3 2005, vol.346, no.1
2005, vol.346, no.2-3 2005, vol.347, no.1-2 2005, vol.347, no.3 2005, vol.348, no.1 2005, vol.348, no.2-3 2005, vol.349, no.1
2005, vol.349, no.2 2005, vol.349, no.3

题名作者出版年年卷期
A mathematical model for the TCP Tragedy of the CommonsLuis Lopez; Gemma del Rey Almansa; Stephane Paquelet; Antonio Fernandez20052005, vol.343, no.1-2
On the approximability of the range assignment problem on radio networks in presence of selfish agentsChristoph Ambuhl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri20052005, vol.343, no.1-2
Games on triangulationsOswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia20052005, vol.343, no.1-2
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computationRobert A. Hearn; Erik D. Demaine20052005, vol.343, no.1-2
Non-cooperative computation: Boolean functions with correctness and exclusivityYoav Shoham; Moshe Tennenholtz20052005, vol.343, no.1-2
Computation in a distributed information marketJoan Feigenbaum; Lance Fortnow; David M. Pennock; Rahul Sami20052005, vol.343, no.1-2
Structure and complexity of extreme Nash equilibriaM. Gairing; T. Lucking; M. Mavronicolas; B. Monien; P. Spirakis20052005, vol.343, no.1-2
The first order definability of graphs with separators via the Ehrenfeucht gameOleg Verbitsky20052005, vol.343, no.1-2
Syntax vs. semantics: A polarized approachOlivier Laurent20052005, vol.343, no.1-2
Games for complexity of second-order call-by-name programsAndrzej S. Murawski20052005, vol.343, no.1-2
12



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