Journals in DBLP

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

1. G. E. Farr
   The Go polynomials of a graph. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:1-18 [Journal]
   
2. Mark Daley, Oscar H. Ibarra, Lila Kari
   Closure and decidability properties of some language classes with respect to ciliate bio-operations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:19-38 [Journal]
   
3. Dietmar Wätjen
   Function-dependent teams in eco-grammar systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:39-53 [Journal]
   
4. Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee
   The full Steiner tree problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:55-67 [Journal]
   
5. József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz
   Private computation using a PEZ dispenser. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:69-84 [Journal]
   
6. Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc
   Regular closed sets of permutations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:85-100 [Journal]
   
7. Petr Sosík
   Watson-Crick D0L systems: generative power and undecidable problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:101-112 [Journal]
   
8. Stefan Andrei, Salvador Valerio Cavadini, Wei-Ngan Chin
   A new algorithm for regularizing one-letter context-free grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:113-122 [Journal]
   
9. Liang Zhang, Kar-Ping Shum, Shou-Li Peng
   Completion of codes with finite bi-decoding delays. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:306, n:1-3, pp:123-137 [Journal]
   
10. Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa
    Non-cryptographic primitive for pseudorandom permutation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:139-154 [Journal]
    
11. Nissim Francez, Michael Kaminski
    An algebraic characterization of deterministic regular languages over infinite alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:155-175 [Journal]
    
12. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
    Almost complete sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:177-194 [Journal]
    
13. L. A. Bunimovich, D. M. Kreslavskiy
    Lorentz gas cellular automata on graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:195-221 [Journal]
    
14. Annalisa De Bonis, Ugo Vaccaro
    Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:223-243 [Journal]
    
15. Laurent Rosaz
    The word problem for 1LC congruences is NP-hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:245-268 [Journal]
    
16. Alexis Bienvenüe, Olivier François
    Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:269-289 [Journal]
    
17. Sylvain Gravier, Mehdi Mhalla, Eric Tannier
    On a modular domination game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:291-303 [Journal]
    
18. Leah Epstein, Csanád Imreh, Rob van Stee
    More on weighted servers or FIFO is better than LRU. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:305-317 [Journal]
    
19. Eric Angel, Evripidis Bampis, Alexander Kononov
    On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:319-338 [Journal]
    
20. Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
    The complexity of makespan minimization for pipeline transportation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:339-351 [Journal]
    
21. Jirí Síma, Pekka Orponen
    Exponential transients in continuous-time Liapunov systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:353-372 [Journal]
    
22. Lucian Ilie, Sheng Yu
    Reducing NFAs by invariant equivalences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:373-390 [Journal]
    
23. Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    The stable marriage problem with restricted pairs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:391-405 [Journal]
    
24. Patricia A. Evans, Andrew D. Smith, Harold T. Wareham
    On the complexity of finding common approximate substrings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:407-430 [Journal]
    
25. Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott
    Approximability results for stable marriage problems with ties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:431-447 [Journal]
    
26. Alexander Meduna, Martin Svec
    Forbidding ET0L grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:449-469 [Journal]
    
27. Serge Dulucq, Laurent Tichit
    RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:471-484 [Journal]
    
28. Víctor Dalmau, Peter Jeavons
    Learnability of quantified formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:485-511 [Journal]
    
29. René Ndoundam, Maurice Tchuente
    Exponential transient length generated by a neuronal recurrence equation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:513-533 [Journal]
    
30. Anna E. Frid
    Arithmetical complexity of symmetric D0L words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:535-542 [Journal]
    
31. Klaus Jansen, Roberto Solis-Oba
    An asymptotic fully polynomial time approximation scheme for bin covering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:543-551 [Journal]