Journals in DBLP

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

1. Andris Ambainis, Arnolds Kikusts
   Exact results for accepting probabilities of quantum automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:3-25 [Journal]
   
2. Albert Atserias
   Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:27-39 [Journal]
   
3. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
   Reachability problems for sequential dynamical systems with threshold functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:41-64 [Journal]
   
4. Markus Bläser
   The complexity of bivariate power series arithmetic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:65-83 [Journal]
   
5. Ahmed Bouajjani, Peter Habermehl, Richard Mayr
   Automatic verification of recursive procedures with one integer parameter. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:85-106 [Journal]
   
6. Sabin Cautis, Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang, Soroosh Yazdani
   Periodicity, morphisms, and matrices. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:107-121 [Journal]
   
7. Giovanni Di Crescenzo
   Sharing one secret vs. sharing many secrets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:123-140 [Journal]
   
8. Pavol Duris, Ján Manuch
   On the computational complexity of infinite words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:141-151 [Journal]
   
9. Hervé Fournier
   Quantifier rank for parity of embedded finite models. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:153-169 [Journal]
   
10. Viliam Geffert
    Space hierarchy theorem revised. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:171-187 [Journal]
    
11. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Converting two-way nondeterministic unary automata into simpler automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:189-203 [Journal]
    
12. Thanh Minh Hoang, Thomas Thierauf
    The complexity of the characteristic and the minimal polynomial. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:205-222 [Journal]
    
13. Jarkko Kari
    Synchronizing finite automata on Eulerian digraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:223-232 [Journal]
    
14. Andreas Klein, Martin Kutrib
    Fast one-way cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:233-250 [Journal]
    
15. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To
    On-line scheduling with tight deadlines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:251-261 [Journal]
    
16. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
    Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:263-278 [Journal]
    
17. Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie
    News from the online traveling repairman. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:279-294 [Journal]
    
18. Nir Piterman, Moshe Y. Vardi
    From bidirectionality to alternation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:295-321 [Journal]
    
19. Pavel Pudlák
    On reducibility and symmetry of disjoint NP pairs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:323-339 [Journal]
    
20. Luigi Santocanale
    On the equational definition of the least prefixed point. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:341-370 [Journal]
    
21. Klaus Sutner
    The size of power automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:371-386 [Journal]
    
22. Martin Thimm
    On the approximability of the Steiner tree problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:387-402 [Journal]