Theoretical Computer Science, Volume 352

Volume 352, Numbers 1-3, 7 March 2006

• Weili Wu, Hongwei Du, Xiaohua Jia, Yingshu Li, Scott C.-H. Huang:
  Minimum connected dominating sets and maximal independent sets in unit disk graphs. 1-7
  
• 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. 8-30
  
• Amy Glen:
  Occurrences of palindromes in characteristic Sturmian words. 31-46
  
• Igor E. Zverovich:
  Satgraphs and independent domination. Part 1. 47-56
  
• Genjiro Tanaka:
  On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups. 57-70
  
• E. C. Xavier, Flávio Keidi Miyazawa:
  Approximation schemes for knapsack problems with shelf divisions. 71-84
  
• Dhruv Mubayi, György Turán, Yi Zhao:
  The DNF exception problem. 85-96
  
• Véronique Terrier:
  Closure properties of cellular automata. 97-107
  
• Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan:
  Sequential and parallel algorithms for the NCA problem on pure pointer machines. 108-135
  
• Patricio V. Poblete, J. Ian Munro, Thomas Papadakis:
  The binomial transform and the analysis of skip lists. 136-158
  
• Marie Ferbus-Zanda, Serge Grigorieff:
  Kolmogorov complexities K_max, K_min on computable partially ordered sets. 159-180
  
• Periklis A. Papakonstantinou:
  Hierarchies for classes of priority algorithms for Job Scheduling. 181-189
  
• Thomas Colcombet, Damian Niwinski:
  On the positional determinacy of edge-labeled games. 190-196
  
• Xuewen Bao, Frank K. Hwang, Qiao Li:
  Rearrangeability of bit permutation networks. 197-214
  
• Igor E. Zverovich, Olga I. Zverovich:
  Independent domination in hereditary classes. 215-225
  
• T. K. Subrahmonian Moothathu:
  Set of periods of additive cellular automata. 226-231
  
• F. H. Chang, J. Y. Guo, Frank K. Hwang:
  Wide-sense nonblocking for multi-log_dN networks under various routing strategies. 232-239
  
• Trinh N. D. Huynh, Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung:
  Approximate string matching using compressed suffix arrays. 240-249
  
• Greg N. Frederickson, Roberto Solis-Oba:
  Efficient algorithms for robustness in resource allocation and scheduling problems. 250-265
  
• Gonzalo Navarro, Edgar Chávez:
  A metric index for approximate string matching. 266-279
  
• Zhu Zhao, Zhongqi Dong, Yongge Wang:
  Security analysis of a password-based authentication protocol proposed to IEEE 1363. 280-287
  
• Amr M. Youssef, Guang Gong:
  On linear complexity of sequences over GF(2ⁿ). 288-292
  
• Stéphane Ballet:
  An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields. 293-305
  
• Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon:
  Combinatorial properties of smooth infinite words. 306-317
  

• Mohammad Taghi Hajiaghayi, Tom Leighton:
  On the max-flow min-cut ratio for directed multicommodity flows. 318-321
  
• Daming Zhu, Lusheng Wang:
  On the complexity of unsigned translocation distance. 322-328
  
• Ioan Tomescu:
  A characterization of the words occurring as factors in a minimum number of words. 329-331
  
• Gautam K. Das, Sandip Das, Subhas C. Nandy:
  Range assignment for energy efficient broadcasting in linear radio networks. 332-341
  
• Oscar H. Ibarra, Zhe Dang:
  On the solvability of a class of diophantine equations and applications. 342-346
  

• 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]. 347-348
  

Last update Wed May 22 18:53:59 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page