Journals in DBLP

Theor. Comput. Sci.
2001, volume: 250, number: 1-2

1. Giorgio Ausiello, Donald Sannella, Michael W. Mislove
   25 Years. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:- [Journal]
   
2. Maurice Nivat
   25 Years. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:- [Journal]
   
3. Ina Koch
   Enumerating all connected maximal common subgraphs in two graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:1-30 [Journal]
   
4. Joanna Jedrzejowicz, Andrzej Szepietowski
   Shuffle languages are in P. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:31-53 [Journal]
   
5. Satoshi Okawa, Sadaki Hirose
   Homomorphic characterizations of recursively enumerable languages with very small language classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:55-69 [Journal]
   
6. Christophe Prieur
   How to decide continuity of rational functions on infinite words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:71-82 [Journal]
   
7. Salvatore Caporaso, Michele Zito, Nicola Galesi
   A predicative and decidable characterization of the polynomial classes of languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:83-99 [Journal]
   
8. Wolfgang Merkle
   Structural properties of bounded relations with an application to NP optimization problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:101-124 [Journal]
   
9. Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
   A practical algorithm for making filled graphs minimal. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:250, n:1-2, pp:125-141 [Journal]
   
10. Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson
    Extended capabilities for visual cryptography. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:143-161 [Journal]
    
11. Valeria Mihalache, Arto Salomaa
    Language-theoretic aspects of DNA complematarity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:163-178 [Journal]
    
12. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    Generalized submodular cover problems and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:179-200 [Journal]
    
13. Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
    Semi-dynamic breadth-first search in digraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:201-217 [Journal]
    
14. Zoltán Fülöp, Sándor Vágvölgyi
    Restricted ground tree transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:219-233 [Journal]
    
15. Gerth Stølting Brodal, Maria Cristina Pinotti
    Comparator networks for binary heap construction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:235-245 [Journal]
    
16. Changwook Kim
    Double Greibach operator grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:247-264 [Journal]
    
17. Salah Labhalla, Henri Lombardi, E. Moutai
    Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:265-332 [Journal]
    
18. Timo Knuutila
    Re-describing an algorithm by Hopcroft. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:333-363 [Journal]
    
19. Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
    Automatic semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:365-391 [Journal]