Journals in DBLP

Theor. Comput. Sci.
2003, volume: 1, number: 297

1. Ali Akhavi
   The optimal LLL algorithm is still polynomial in fixed dimension. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:3-23 [Journal]
   
2. Pedro Berrizbeitia, Mauricio Odremán Vera, Juan Tena Ayuso
   Primality test for numbers M with a large power of 5 dividing M⁴-1. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:25-36 [Journal]
   
3. Olivier Carton, Max Michel
   Unambiguous Büchi automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:37-81 [Journal]
   
4. Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
   A fully dynamic algorithm for distributed shortest paths. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:83-102 [Journal]
   
5. Myra B. Cohen, Charles J. Colbourn
   Optimal and pessimal orderings of Steiner triple systems in disk arrays. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:103-117 [Journal]
   
6. Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise
   The permutation-path coloring problem on trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:119-143 [Journal]
   
7. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz
   Decompositions for the edge colouring of reduced indifference graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:145-155 [Journal]
   
8. Maribel Fernández, Ian Mackie
   Operational equivalence for interaction nets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:157-181 [Journal]
   
9. David Fernández-Baca
   Decomposable multi-parameter matroid optimization problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:183-198 [Journal]
   
10. Joachim von zur Gathen, Thomas Lücking
    Subresultants revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:199-239 [Journal]
    
11. Andreas Goerdt, Michael Molloy
    Analysis of edge deletion processes on faulty random regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:241-260 [Journal]
    
12. Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger
    Combinatorics of geometrically distributed random variables: run statistics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:261-270 [Journal]
    
13. Claudio Gutiérrez
    Equations in free semigroups with involution and their relation to equations in free groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:271-280 [Journal]
    
14. Valentine Kabanets
    Almost k-wise independence and hard Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:281-295 [Journal]
    
15. François Laroussinie, Ph. Schnoebelen, Mathieu Turuani
    On the expressivity and complexity of quantitative branching-time temporal logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:297-315 [Journal]
    
16. Guy Louchard, John W. Turner
    Generalized covariances of multi-dimensional Brownian excursion local times. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:317-336 [Journal]
    
17. Richard Mayr
    Undecidable problems in unreliable computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:337-354 [Journal]
    
18. Flávio Keidi Miyazawa, Yoshiko Wakabayashi
    Cube packing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:355-366 [Journal]
    
19. Lucia Moura
    Rank inequalities and separation algorithms for packing designs and sparse triple systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:367-384 [Journal]
    
20. Jaroslav Opatrny
    Uniform multi-hop all-to-all optical routings in rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:385-397 [Journal]
    
21. Brett Stevens
    The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:399-424 [Journal]
    
22. Stephen Taylor, Marianne Durand
    Emerging behavior as binary search trees are symmetrically updated. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:425-445 [Journal]
    
23. Brigitte Vallée
    Dynamical analysis of a class of Euclidean algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:447-486 [Journal]
    
24. Michele Zito
    Small maximal matchings in random graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:487-507 [Journal]