Information Processing Letters, Volume 106

Volume 106, Number 1, March 2008

• Krishnendu Chatterjee, Thomas A. Henzinger:
  Reduction of stochastic parity to stochastic mean-payoff games. 1-7
  Electronic Edition (link) BibTeX
• Joachim Biskup, David W. Embley, Jan-Hendrik Lochner:
  Reducing inference control to access control for normalized database schemas. 8-12
  Electronic Edition (link) BibTeX
• Costas S. Iliopoulos, Mohammad Sohel Rahman:
  New efficient algorithms for the LCS and constrained LCS problems. 13-18
  Electronic Edition (link) BibTeX
• Jyh-Jian Sheu, Wen-Tzeng Huang, Chin-Hsing Chen:
  Strong diagnosability of regular networks under the comparison model. 19-25
  Electronic Edition (link) BibTeX
• Weiping He, Ing-Ray Chen:
  Proxy-based hybrid cache management in Mobile IP systems. 26-32
  Electronic Edition (link) BibTeX
• Iain A. Stewart:
  On the fixed-parameter tractability of parameterized model-checking problems. 33-36
  Electronic Edition (link) BibTeX
• George F. Georgakopoulos:
  Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying. 37-43
  Electronic Edition (link) BibTeX

Volume 106, Number 2, April 2008

• Torben Amtoft:
  Slicing for modern program structures: a theory for eliminating irrelevant loops. 45-51
  Electronic Edition (link) BibTeX
• Banghe Li, Yuefeng Shen, Bo Li:
  A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation. 52-58
  Electronic Edition (link) BibTeX
• Meijie Ma, Guizhen Liu, Jun-Ming Xu:
  The super connectivity of augmented cubes. 59-63
  Electronic Edition (link) BibTeX
• Lun-Min Shih, Chieh-Feng Chiang, Lih-Hsing Hsu, Jimmy J. M. Tan:
  Strong Menger connectivity with conditional faults on the class of hypercube-like networks. 64-69
  Electronic Edition (link) BibTeX
• Feifeng Zheng, Yinfeng Xu, E. Zhang:
  How much can lookahead help in online single machine scheduling. 70-74
  Electronic Edition (link) BibTeX
• Maxime Crochemore, Lucian Ilie:
  Computing Longest Previous Factor in linear time and applications. 75-80
  Electronic Edition (link) BibTeX
• Jiong Guo, Rolf Niedermeier, Johannes Uhlmann:
  Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. 81-86
  Electronic Edition (link) BibTeX