Journals in DBLP

Theor. Comput. Sci.
2005, volume: 343, number: 1-2

1. Samson Abramsky, Marios Mavronicolas
   Game Theory Meets Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:1-3 [Journal]
   
2. Luis López, Gemma del Rey Almansa, Stéphane Paquelet, Antonio Fernández
   A mathematical model for the TCP Tragedy of the Commons. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:4-26 [Journal]
   
3. Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
   On the approximability of the range assignment problem on radio networks in presence of selfish agents. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:27-41 [Journal]
   
4. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
   Games on triangulations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:42-71 [Journal]
   
5. Robert A. Hearn, Erik D. Demaine
   PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:72-96 [Journal]
   
6. Yoav Shoham, Moshe Tennenholtz
   Non-cooperative computation: Boolean functions with correctness and exclusivity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:97-113 [Journal]
   
7. Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
   Computation in a distributed information market. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:114-132 [Journal]
   
8. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
   Structure and complexity of extreme Nash equilibria. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:133-157 [Journal]
   
9. Oleg Verbitsky
   The first order definability of graphs with separators via the Ehrenfeucht game. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:343, n:1-2, pp:158-176 [Journal]
   
10. Olivier Laurent
    Syntax vs. semantics: A polarized approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:177-206 [Journal]
    
11. Andrzej S. Murawski
    Games for complexity of second-order call-by-name programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:207-236 [Journal]
    
12. Paul-André Melliès
    Sequential algorithms and strongly stable functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:237-281 [Journal]