Journals in DBLP

Theor. Comput. Sci.
2004, volume: 326, number: 1-3

1. Lane A. Hemaspaandra, Mayur Thakur
   Lower bounds and the hardness of counting properties. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:1-28 [Journal]
   
2. Cedric Chauve, Guillaume Fertin
   On maximal instances for the original syntenic distance. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:29-43 [Journal]
   
3. Pascal Michel
   Small Turing machines and generalized busy beaver competition. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:45-56 [Journal]
   
4. Friedrich Eisenbrand, Fabrizio Grandoni
   On the complexity of fixed parameter clique and dominating set. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:57-67 [Journal]
   
5. James Allen Fill, Nevin Kapur
   Limiting distributions for additive functionals on Catalan trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:69-102 [Journal]
   
6. Yashar Ganjali, Mohammad Taghi Hajiaghayi
   Characterization of networks supporting multi-dimensional linear interval routing schemes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:103-116 [Journal]
   
7. Tomomi Matsui, Yasuko Matsui, Yoko Ono
   Random generation of 2 times 2 times ... times 2 times J contingency tables. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:117-135 [Journal]
   
8. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
   On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]
   
9. Teofilo F. Gonzalez, David Serena
   Complexity of pairwise shortest path routing in the grid. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:326, n:1-3, pp:155-185 [Journal]
   
10. Martin Ziegler, Vasco Brattka
    Computability in linear algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:187-211 [Journal]
    
11. Svante Janson, Stefano Lonardi, Wojciech Szpankowski
    On average sequence complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:213-227 [Journal]
    
12. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
    Linear-time computation of local periods. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:229-240 [Journal]
    
13. Marcia Edson, Luca Q. Zamboni
    On representations of positive integers in the Fibonacci base. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:241-260 [Journal]
    
14. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
    On distance constrained labeling of disk graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:261-292 [Journal]
    
15. Predrag R. Jelenkovic, Ana Radovanovic
    Least-recently-used caching with dependent requests. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:293-327 [Journal]
    
16. Marcos A. Kiwi, Alexander Russell
    The chilean highway problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:329-342 [Journal]
    
17. Anders Dessmark, Andrzej Pelc
    Optimal graph exploration without good maps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:343-362 [Journal]
    
18. Xun Yi
    Authenticated key agreement in dynamic peer groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:363-382 [Journal]
    
19. Thorsten Bernholt, Paul Fischer
    The complexity of computing the MCD-estimator. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:383-398 [Journal]
    
20. Minming Li, Shawn L. Huang, Xiaoming Sun, Xiao Huang
    Performance evaluation for energy efficient topologic control in ad hoc wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:399-408 [Journal]
    
21. Alan Gibbons, Paul Sant
    Rotation sequences and edge-colouring of binary tree pairs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:409-418 [Journal]
    
22. Qi Cheng
    On the ultimate complexity of factorials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:419-429 [Journal]
    
23. Stefano Leonardi, Guido Schäfer
    Cross-monotonic cost sharing methods for connected facility location games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:431-442 [Journal]