期刊


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

2013, vol.467 2013, vol.468 2013, vol.469 2013, vol.470 2013, vol.471 2013, vol.472
2013, vol.473 2013, vol.474 2013, vol.475 2013, vol.476 2013, vol.477 2013, vol.478
2013, vol.479 2013, vol.480 2013, vol.481 2013, vol.482 2013, vol.483 2013, vol.484
2013, vol.485 2013, vol.486 2013, vol.487 2013, vol.488 2013, vol.489/490 2013, vol.491
2013, vol.492 2013, vol.493 2013, vol.494 2013, vol.495 2013, vol.496 2013, vol.497
2013, vol.498 2013, vol.499 2013, vol.500 2013, vol.501 2013, vol.502 2013, vol.503
2013, vol.504 2013, vol.505 2013, vol.506 2013, vol.507 2013, vol.508 2013, vol.509
2013, vol.510 2013, vol.511 2013, vol.512 2013, vol.513 2013, vol.514

题名作者出版年年卷期
Economic models for cloud service markets: Pricing and Capacity planningRanjan Pal; Pan Hui20132013, vol.496
Correctness of concurrent executions of closed nested transactions in transactional memory systemsSathya Peri; K. Vidyasankar20132013, vol.496
Towards a universal construction for transaction-based multiprocess programsTyler Crain; Damien Imbs; Michel Raynal20132013, vol.496
Optimizing Paxos with batching and pipeliningNuno Santos; Andre Schiper20132013, vol.496
MR4UM: A framework for adding fault tolerance to UML state diagramsJingshu Chen; Sandeep Kulkarni20132013, vol.496
Competitive and deterministic embeddings of virtual networksGuy Even; Moti Medina; Gregor Schaffrath; Stefan Schmid20132013, vol.496
Interplay between (im)perfectness, synchrony and connectivity: The case of reliable message transmissionAbhinav Mehta; Shashank Agrawal; Kannan Srinathan20132013, vol.496
Byzantine agreement with homonyms in synchronous systemsCarole Delporte-Gallet; Hugues Fauconnier; Hung Tran-The20132013, vol.496
Facilitating the design of fault tolerance in transaction level SystemC programsAli Ebnenasir; Reza Hajisheykhi; Sandeep S. Kulkarni20132013, vol.496
Solving the at-most-once problem with nearly optimal effectivenessSotirios Kentros; Aggelos Kiayias20132013, vol.496
12