Journals in DBLP
Weili Wu , Hongwei Du , Xiaohua Jia , Yingshu Li , Scott C.-H. Huang Minimum connected dominating sets and maximal independent sets in unit disk graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:1-7 [Journal ] Pawel Hitczenko , Jeremy R. Johnson , Hung-Jen Huang Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:8-30 [Journal ] Amy Glen Occurrences of palindromes in characteristic Sturmian words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:31-46 [Journal ] Igor E. Zverovich Satgraphs and independent domination. Part 1. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:47-56 [Journal ] Genjiro Tanaka On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:57-70 [Journal ] E. C. Xavier , Flávio Keidi Miyazawa Approximation schemes for knapsack problems with shelf divisions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:71-84 [Journal ] Dhruv Mubayi , György Turán , Yi Zhao The DNF exception problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:85-96 [Journal ] Véronique Terrier Closure properties of cellular automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:97-107 [Journal ] Alessandro Dal Palù , Enrico Pontelli , Desh Ranjan Sequential and parallel algorithms for the NCA problem on pure pointer machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:108-135 [Journal ] Patricio V. Poblete , J. Ian Munro , Thomas Papadakis The binomial transform and the analysis of skip lists. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:136-158 [Journal ] Marie Ferbus-Zanda , Serge Grigorieff Kolmogorov complexities K max , K min on computable partially ordered sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:159-180 [Journal ] Periklis A. Papakonstantinou Hierarchies for classes of priority algorithms for Job Scheduling. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:181-189 [Journal ] Thomas Colcombet , Damian Niwinski On the positional determinacy of edge-labeled games. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:190-196 [Journal ] Xuewen Bao , Frank K. Hwang , Qiao Li Rearrangeability of bit permutation networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:197-214 [Journal ] Igor E. Zverovich , Olga I. Zverovich Independent domination in hereditary classes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:215-225 [Journal ] T. K. Subrahmonian Moothathu Set of periods of additive cellular automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:226-231 [Journal ] F. H. Chang , J. Y. Guo , Frank K. Hwang Wide-sense nonblocking for multi-logd N networks under various routing strategies. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:232-239 [Journal ] Trinh N. D. Huynh , Wing-Kai Hon , Tak Wah Lam , Wing-Kin Sung Approximate string matching using compressed suffix arrays. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:240-249 [Journal ] Greg N. Frederickson , Roberto Solis-Oba Efficient algorithms for robustness in resource allocation and scheduling problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:250-265 [Journal ] Gonzalo Navarro , Edgar Chávez A metric index for approximate string matching. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:266-279 [Journal ] Zhu Zhao , Zhongqi Dong , Yongge Wang Security analysis of a password-based authentication protocol proposed to IEEE 1363. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:280-287 [Journal ] A. M. Youssef , G. Gong On linear complexity of sequences over GF (2n ). [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:288-292 [Journal ] Stéphane Ballet An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:293-305 [Journal ] Srecko Brlek , Serge Dulucq , A. Ladouceur , Laurent Vuillon Combinatorial properties of smooth infinite words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:306-317 [Journal ] Mohammad Taghi Hajiaghayi , Tom Leighton On the max-flow min-cut ratio for directed multicommodity flows. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:318-321 [Journal ] Daming Zhu , Lusheng Wang On the complexity of unsigned translocation distance. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:322-328 [Journal ] Ioan Tomescu A characterization of the words occurring as factors in a minimum number of words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:329-331 [Journal ] Gautam K. Das , Sandip Das , Subhas C. Nandy Range assignment for energy efficient broadcasting in linear radio networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:332-341 [Journal ] Oscar H. Ibarra , Zhe Dang On the solvability of a class of diophantine equations and applications. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:342-346 [Journal ] Sven Oliver Krumke , Willem de Paepe , Diana Poensgen , Leen Stougie Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:347-348 [Journal ]