Journals in DBLP

Theor. Comput. Sci.
2004, volume: 314, number: 3

1. Kenichiro Noguchi
   Simple 8-state minimal time solution to the firing squad synchronization problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:303-334 [Journal]
   
2. Nicola Dimitri
   Efficiency and equilibrium in the electronic mail game; the general case. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:335-349 [Journal]
   
3. Annalisa De Bonis, Alfredo De Santis
   Randomness in secret sharing and visual cryptography schemes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:351-374 [Journal]
   
4. F. H. Chang, J. Y. Guo, Frank K. Hwang, C. K. Lin
   Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:375-386 [Journal]
   
5. Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler
   Hierarchies of tree series transformations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:387-429 [Journal]
   
6. Chang-Hsiung Tsai
   Linear array and ring embeddings in conditional faulty hypercubes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:431-443 [Journal]
   
7. Henning Bordihn
   Context-freeness of the power of context-free languages is undecidable. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:445-449 [Journal]
   
8. Michael Domaratzki, Alexander Okhotin
   Representing recursively enumerable languages by iterated deletion. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:451-457 [Journal]
   
9. Amr Elmasry
   On the sequential access theorem and deque conjecture for splay trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:314, n:3, pp:459-466 [Journal]