Journals in DBLP
Yiannis N. Moschovakis On primitive recursive algorithms and the greatest common divisor function. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:1-30 [Journal ] Andrei Kelarev , Olga Sokratova On congruences of automata defined by directed graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:31-43 [Journal ] Martin Sauerhoff Approximation of boolean functions by combinatorial rectangles. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:45-78 [Journal ] Masashi Katsura , Yuji Kobayashi , Friedrich Otto Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:79-101 [Journal ] Kyriakos N. Sgarbas , Nikos Fakotakis , George K. Kokkinakis Optimal insertion in deterministic DAWGs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:103-117 [Journal ] Alexandros V. Gerbessiotis , Constantinos J. Siniolakis Architecture independent parallel selection with applications to parallel priority queues. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:119-142 [Journal ] Richard Nock Complexity in the case against accuracy estimation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:143-165 [Journal ] Véronique Terrier Two-dimensional cellular automata and deterministic on-line tessalation automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:167-186 [Journal ] Arto Salomaa , Petr Sosík Watson-Crick D0L systems: the power of one transition. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:187-200 [Journal ] Claudio Ferretti , Giancarlo Mauri , Gheorghe Paun , Claudio Zandron On three variants of rewriting P systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:201-215 [Journal ] Olivier Finkel Ambiguity in omega context free languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:217-270 [Journal ] Rodica Boliac , Vadim V. Lozin Independent domination in finitely defined classes of graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:271-284 [Journal ] Manfred Peter The asymptotic distribution of elements in automatic sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:285-312 [Journal ] Andries P. J. van der Walt , Sigrid Ewert A property of random context picture grammars. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:313-320 [Journal ] John Ellis , Frank Ruskey , Joe Sawada , Jamie Simpson Euclidean strings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:321-340 [Journal ] Enrico Formenti On the sensitivity of additive cellular automata in Besicovitch topologies. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:341-354 [Journal ] Paola Flocchini , Alessandro Roncato , Nicola Santoro Computing on anonymous networks with sense of direction. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:355-379 [Journal ] Chin Lung Lu , Sheng-Lung Peng , Chuan Yi Tang Efficient minus and signed domination in graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:381-397 [Journal ] Nguyen Huong Lam Completing comma-free codes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:399-415 [Journal ] Igor Dolinka The multiplicative fragment of the Yanov equational theory. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:417-425 [Journal ] Leonidas Georgiadis Arborescence optimization problems solvable by Edmonds' algorithm. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:427-437 [Journal ] Marcy Barge , Beverly Diamond , Charles Holton Asymptotic orbits of primitive substitutions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:439-450 [Journal ] Kazuo Iwama , Akihiro Matsuura , Mike Paterson A family of NFAs which need 2n- deterministic states. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:451-462 [Journal ] Van Bang Le , Bert Randerath On stable cutsets in line graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:463-475 [Journal ] Joe Sawada A fast algorithm to generate necklaces with fixed content. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:477-489 [Journal ] L. H. Harper On the bandwidth of a Hamming graph. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:491-498 [Journal ]