Journals in DBLP

Theor. Comput. Sci.
2003, volume: 302, number: 1-3

1. Gwénaël Richomme
   Conjugacy and episturmian morphisms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:1-34 [Journal]
   
2. Peter Damaschke
   Nearly optimal strategies for special cases of on-line capital investment. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:35-44 [Journal]
   
3. Alois Panholzer
   Analysis of multiple quickselect variants. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:45-91 [Journal]
   
4. Zhe Dang
   Pushdown timed automata: a binary reachability characterization and safety verification. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:93-121 [Journal]
   
5. Jerzy Mycka
   mu -Recursion and infinite limits. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:123-133 [Journal]
   
6. Sándor Vágvölgyi
   Term rewriting restricted to ground terms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:135-165 [Journal]
   
7. Srecko Brlek, A. Ladouceur
   A note on differentiable palindromes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:167-178 [Journal]
   
8. Rocco De Nicola, Anna Labella
   Nondeterministic regular expressions as solutions of equational systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:179-189 [Journal]
   
9. Jingchao Chen
   Optimizing stable in-place merging. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:302, n:1-3, pp:191-210 [Journal]
   
10. Wojciech Rytter
    Application of Lempel-Ziv factorization to the approximation of grammar-based compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:211-222 [Journal]
    
11. Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park
    Generalizations of suffix arrays to multi-dimensional matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:223-238 [Journal]
    
12. Klaus Jansen
    Approximate strong separation with application in fractional graph coloring and preemptive scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:239-256 [Journal]
    
13. George Karakostas, Richard J. Lipton, Anastasios Viglas
    On the complexity of intersecting finite state automata and N L versus N P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:257-274 [Journal]
    
14. Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow
    Unification and extension of weighted finite automata applicable to image compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:275-294 [Journal]
    
15. Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes
    Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:295-317 [Journal]
    
16. Aleksei V. Fishkin, Guochuan Zhang
    On maximizing the throughput of multiprocessor tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:319-335 [Journal]
    
17. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Distributed broadcast in radio networks of unknown topology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:337-364 [Journal]
    
18. Alexander Okhotin
    A recognition and parsing algorithm for arbitrary conjunctive grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:365-399 [Journal]
    
19. Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park
    Generalizations of suffix arrays to multi-dimensional matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:401-416 [Journal]
    
20. Nadia Creignou, Hervé Daudé
    Generalized satisfiability problems: minimal elements and phase transitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:417-430 [Journal]
    
21. Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
    On the number of occurrences of a symbol in words of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:431-456 [Journal]
    
22. Lane A. Hemaspaandra, Harald Hempel
    P-immune sets with holes lack self-reducibility properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:457-466 [Journal]
    
23. Till Tantau
    Query complexity of membership comparable sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:467-474 [Journal]
    
24. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
    Palindrome recognition using a multidimensional tape. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:475-480 [Journal]
    
25. Juha Honkala
    Decidability results for Watson-Crick D0L systems with nonregular triggers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:481-488 [Journal]
    
26. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
    On polynomial-time approximation algorithms for the variable length scheduling problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:489-495 [Journal]