Information Processing Letters, Volume 98

Volume 98, Number 1, 15 April 2006

• Fanyu Kong, Zhun Cai, Jia Yu, Daxing Li:
  Improved generalized Atkin algorithm for computing square roots in finite fields. 1-5
  
• Henrik Brosenne, Matthias Homeister, Stephan Waack:
  Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. 6-10
  
• Cinzia Bernardeschi, Giuseppe Lettieri, Luca Martini, Paolo Masci:
  Using postdomination to reduce space requirements of data flow analysis. 11-18
  
• Marc Mosko, J. J. Garcia-Luna-Aceves:
  Fraction interpolation walking a Farey tree. 19-23
  
• Mikko Koivisto:
  Optimal 2-constraint satisfaction via sum-product algorithms. 24-28
  
• Minghui Jiang:
  Approximating minimum coloring and maximum independent set in dotted interval graphs. 29-33
  
• Jing-Chao Chen:
  A simple algorithm for in-place merging. 34-40
  

Volume 98, Number 2, 30 April 2006

• Wu Jigang, Thambipillai Srikanthan:
  Low-complex dynamic programming algorithm for hardware/software partitioning. 41-46
  
• Borislav Nikolik:
  Test suite oscillations. 47-55
  
• Robert M. Hierons:
  Applying adaptive test cases to nondeterministic implementations. 56-60
  
• Paolo Liberatore:
  On the complexity of extension checking in default logic. 61-65
  
• Shiri Dori, Gad M. Landau:
  Construction of Aho Corasick automaton in linear time for integer alphabets. 66-72
  
• Gur Mosheiov, Daniel Oron:
  Single machine scheduling with batch-dependent setup times. 73-78
  
• Daniel Berend, Amir Sapir:
  The diameter of Hanoi graphs. 79-85
  

Volume 98, Number 3, 16 May 2006

• Claudson F. Bornstein, Celina M. Herrera de Figueiredo, Vinícius G. P. de Sá:
  The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. 87-91
  
• Refael Hassin, Shlomi Rubinstein:
  An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. 92-95
  
• Dariusz Dereniowski, Adam Nadolski:
  Vertex rankings of chordal graphs and weighted trees. 96-100
  
• San Skulrattanakulchai:
  Delta-List vertex coloring in linear time. 101-106
  
• Shailesh Patil, Vijay K. Garg:
  Adaptive general perfectly periodic scheduling. 107-114
  
• Mehri Javanian, Mohammad Vahidi-Asl:
  Depth of nodes in random recursive k-ary trees. 115-118
  
• Li Chunlin, Li Layuan:
  QoS based resource scheduling by computational economy in computational grid. 119-126
  

Volume 98, Number 4, 31 May 2006

• Uwe Schöning:
  Smaller superconcentrators of density 28. 127-129
  
• Yijie Han:
  Improved algorithm for the symmetry number problem on trees. 130-132
  
• Andreas Brandstädt, Van Bang Le:
  Structure and linear time recognition of 3-leaf powers. 133-138
  
• Renato C. Dutra, Valmir C. Barbosa:
  Finding routes in anonymous sensor networks. 139-144
  
• Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
  Parameterized power domination complexity. 145-149
  
• Sebastian Hack, Gerhard Goos:
  Optimal register allocation for SSA-form programs in polynomial time. 150-155
  
• Dieter Hofbauer, Johannes Waldmann:
  Termination of {aa->bc, bb->ac, cc->ab}. 156-158
  
• Rao Li:
  A new sufficient condition for Hamiltonicity of graphs. 159-161
  
• Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik:
  The number of guillotine partitions in d dimensions. 162-167
  

Volume 98, Number 5, June 2006

• Weifan Wang, Yiqiao Wang:
  L(p, q)-labelling of K₄-minor free graphs. 169-173
  
• Andrzej Szepietowski:
  A note on alternating one-pebble Turing machines with sublogarithmic space. 174-176
  
• Jessica Chen, Robert M. Hierons, Hasan Ural:
  Overcoming observability problems in distributed test architectures. 177-182
  
• Nikolaj Tatti:
  Computational complexity of queries based on itemsets. 183-187
  
• Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
  Improved undecidability results on weighted timed automata. 188-194
  
• Aaron Stump, Bernd Löchner:
  Knuth-Bendix completion of theories of commuting group endomorphisms. 195-198
  
• José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès:
  On finding a widest empty 1-corner corridor. 199-205
  
• N. Raja, R. K. Shyamasundar:
  A closer look at constraints as processes. 206-210
  

Volume 98, Number 6, June 2006

• Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich:
  Multiple serial episodes matching. 211-218
  
• Ichiro Mitsuhashi, Michio Oyamaguchi, Toshiyuki Yamada:
  The reachability and related decision problems for monadic and semi-constructor TRSs. 219-224
  
• Enrique Alba, Bernabé Dorronsoro:
  Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm. 225-230
  
• Narad Rampersad:
  The state complexity of L² and L^k. 231-234
  
• Mickaël Montassier, André Raspaud:
  A note on 2-facial coloring of plane graphs. 235-241
  
• Lucian Ilie, Solomon Marcus, Ion Petre:
  Periodic and Sturmian languages. 242-246
  
• Mohammad Hosseini Dolama, Eric Sopena:
  On the oriented chromatic number of Halin graphs. 247-252
  
• Yangjun Chen, Yibin Chen:
  A new tree inclusion algorithm. 253-262