Journals in DBLP
Karl Auinger , Benjamin Steinberg Constructing divisions into power groups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:1-21 [Journal ] Eden Chlamtac , Uriel Feige Improved approximation of the minimum cover time. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:22-38 [Journal ] Yan-Cheng Chang , Chi-Jen Lu Oblivious polynomial evaluation and oblivious neural learning. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:39-54 [Journal ] Clemens Heuberger , Rajendra Katti , Helmut Prodinger , Xiaoyu Ruan The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:55-72 [Journal ] J. Sawada Oracles for vertex elimination orderings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:73-90 [Journal ] Péter Gács Uniform test of algorithmic randomness over a general space. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:91-137 [Journal ] Atsuyuki Inoue , Akira Ito , Katsushi Inoue , Tokio Okazaki Some properties of one-pebble Turing machines with sublogarithmic space. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:138-149 [Journal ] Xiaochun Cheng , Dantong Ouyang , Yunfei Jiang , Chengqi Zhang An improved model-based method to test circuit faults. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:150-161 [Journal ] Pieter Collins Continuity and computability of reachable sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:162-195 [Journal ] Cheng-Nan Lai , Gen-Huey Chen Strong Rabin numbers of folded hypercubes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:196-215 [Journal ] Guido Schäfer , Naveen Sivadasan Topology matters: Smoothed competitiveness of metrical task systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:216-246 [Journal ] Blanca Cases , Manuel Alfonseca Moreno Towards a proof of the decidability of the momentary stagnation of the growth function of D 0L systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:247-262 [Journal ] Maurice H. ter Beek , Carlos Martín-Vide , Victor Mitrana Synchronized shuffles. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:263-275 [Journal ] Giuseppe Pirillo Inequalities characterizing standard Sturmian and episturmian words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:276-292 [Journal ] Valérie Berthé , Srecko Brlek , Philippe Choquette Smooth words over arbitrary alphabets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:293-310 [Journal ] Subhamoy Maitra , Kishan Chand Gupta , Ayineedi Venkateswarlu Results on multiples of primitive polynomials and their products over GF(2). [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:311-343 [Journal ] Zhe Dang , Oscar H. Ibarra , Jianwen Su On composition and lookahead delegation of e -services modeled by automata^{, } . [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:344-363 [Journal ] Hiroshi Nagamochi , Kengo Iwata , Toshimasa Ishii A robust algorithm for bisecting a triconnected graph with two resource sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:364-378 [Journal ] Zdenek Tronícek , Ayumi Shinohara The size of subsequence automaton. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:379-384 [Journal ] Quincy Wu , Chin Lung Lu , Richard Chia-Tung Lee The approximability of the weighted Hamiltonian path completion problem on a tree. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:385-397 [Journal ] Wei-Mei Chen Probabilistic analysis of algorithms for the Dutch national flag problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:398-410 [Journal ] Ruo-Wei Hung , Maw-Shang Chang Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs^{, } . [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:341, n:1-3, pp:411-440 [Journal ]