Journals in DBLP

Theor. Comput. Sci.
1993, volume: 110, number: 1

1. Joost Engelfriet, Hendrik Jan Hoogeboom
   X-Automata on omega-Words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:1-51 [Journal]
   
2. Eric Goles Ch., Alejandro Maass, Servet Martínez A.
   On the Limit Set of Some Universal Cellular Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:53-78 [Journal]
   
3. Wayne D. Blizard
   Dedekind Multisets and Function Shells. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:79-98 [Journal]
   
4. Boaz Patt-Shamir, David Peleg
   Time-Space Tradeoffs for Set Operations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:99-129 [Journal]
   
5. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
   On the Power of Inductive Inference from Good Examples. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:131-144 [Journal]
   
6. Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann
   A Comparison of Compatible, Finite, and Inductive Graph Properties. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:145-168 [Journal]
   
7. Uri Zwick, Mike Paterson
   The Memory Game. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:169-196 [Journal]
   
8. Aviezri S. Fraenkel, Shai Simonson
   Geography. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:197-214 [Journal]
   
9. Hans L. Bodlaender
   Complexity of Path-Forming Games. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:110, n:1, pp:215-245 [Journal]