Journals in DBLP

Theor. Comput. Sci.
2002, volume: 276, number: 1-2

1. Robert Cori, Dominique Rossin, Bruno Salvy
   Polynomial ideals for sandpiles and their Gröbner bases. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:1-15 [Journal]
   
2. Vincent Bouchitté, Ioan Todinca
   Listing all potential maximal cliques of a graph. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:17-32 [Journal]
   
3. Gruia Calinescu, Peng-Jun Wan
   Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:33-50 [Journal]
   
4. Stefan Droste, Thomas Jansen, Ingo Wegener
   On the analysis of the (1+1) evolutionary algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:51-81 [Journal]
   
5. Amber Settle, Janos Simon
   Smaller solutions for the firing squad. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:83-109 [Journal]
   
6. Bin Ma, Lusheng Wang, Kaizhong Zhang
   Computing similarity between RNA structures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:111-132 [Journal]
   
7. Subhamoy Maitra, Palash Sarkar
   Cryptographically significant Boolean functions with five valued Walsh spectra. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:133-146 [Journal]
   
8. Harumichi Nishimura, Masanao Ozawa
   Computational complexity of uniform quantum circuit families and quantum Turing machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:147-181 [Journal]
   
9. Vesa Halava, Tero Harju, Mika Hirvensalo
   Binary (generalized) Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:276, n:1-2, pp:183-204 [Journal]
   
10. Erzsébet Csuhaj-Varjú, György Vaszil
    Parallel communicating grammar systems with bounded resources. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:205-219 [Journal]
    
11. Zoltán Fülöp, Alain Terlutte
    Iterated relabeling tree transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:221-244 [Journal]
    
12. Kai Salomaa, Sheng Yu
    Decidability of EDT0L structural equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:245-259 [Journal]
    
13. David Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
    Hard variants of stable marriage. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:261-279 [Journal]
    
14. Jacques Justin, Giuseppe Pirillo
    Episturmian words and episturmian morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:281-313 [Journal]
    
15. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
    Static and dynamic low-congested interval routing schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:315-354 [Journal]
    
16. Stavros Konstantinidis, Amber O'Hearn
    Error-detecting properties of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:355-375 [Journal]
    
17. Henning Fernau, Ralf Stiebe
    Sequential grammars and automata with valences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:377-405 [Journal]
    
18. Vladimir V. V'yugin
    Does snooping help? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:407-415 [Journal]
    
19. Chiuyuan Chen
    A necessary condition for a graph to be the visibility graph of a simple polygon. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:417-424 [Journal]
    
20. Gregorio Malajovich
    Lower bounds for some decision problems over C. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:425-434 [Journal]
    
21. J. M. Robson
    Constant bounds on the moments of the height of binary search trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:435-444 [Journal]
    
22. Christophe Prieur
    How to decide continuity of rational functions on infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:445-447 [Journal]
    
23. Yongge Wang
    A comparison of two approaches to pseudorandomness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:449-459 [Journal]