Journals in DBLP

Theor. Comput. Sci.
2005, volume: 348, number: 2-3

1. Josep Díaz, Juhani Karhumäki
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:129- [Journal]
   
2. Olivier Bournez, Emmanuel Hainry
   Elementarily computable functions over the real numbers and R-sub-recursive functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:130-147 [Journal]
   
3. Andrei A. Bulatov, Martin Grohe
   The complexity of partition functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:148-186 [Journal]
   
4. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
   Locally consistent constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:187-206 [Journal]
   
5. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
   On graph problems in a semi-streaming model. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:207-216 [Journal]
   
6. Lisa Fleischer
   Linear tolls suffice: New bounds and algorithms for tolls in single source networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:217-225 [Journal]
   
7. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis
   Selfish unsplittable flows. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:226-239 [Journal]
   
8. Eran Halperin, Richard M. Karp
   The minimum-entropy set cover problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:240-250 [Journal]
   
9. Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
   Simple permutations mix well. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:251-261 [Journal]
   
10. Robert Krauthgamer, James R. Lee
    The black-box complexity of nearest-neighbor search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:262-276 [Journal]
    
11. Michal Kunc
    Regular solutions of language inequalities and well quasi-orders. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:277-293 [Journal]
    
12. Emmanuelle Lebhar, Nicolas Schabanel
    Close to optimal decentralized routing in long-range contact networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:294-310 [Journal]
    
13. Dieter van Melkebeek, Ran Raz
    A time lower bound for satisfiability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:311-320 [Journal]
    
14. Michael Soltys
    LA, permutations, and the Hajós Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:321-333 [Journal]
    
15. Sergei Vassilvitskii, Mihalis Yannakakis
    Efficiently computing succinct trade-off curves. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:334-356 [Journal]
    
16. Ryan Williams
    A new algorithm for optimal 2-constraint satisfaction and its implications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:357-365 [Journal]