Theoretical Computer Science, Volume 409

Volume 409, Number 1, December 2008

• Peter Hines:
  Machine semantics. 1-23
  
• Stéphane Demri, Régis Gascon:
  Verification of qualitative Z constraints. 24-40
  
• Alessandro Avellone, Guido Fiorino, Ugo Moscato:
  Optimization techniques for propositional intuitionistic logic and their implementation. 41-58
  
• Lucia Acciai, Michele Boreale:
  Responsiveness in process calculi. 59-93
  
• Nicola Gambino, Richard Garner:
  The identity type weak factorisation system. 94-109
  
• Xiaojun Liu, Edward A. Lee:
  CPO semantics of timed interactive actor networks. 110-125
  
• Wolfgang Reisig:
  The computable kernel of Abstract State Machines. 126-136
  
• David A. Cohen, Peter G. Jeavons, Stanislav Zivný:
  The expressive power of valued constraints: Hierarchies and collapses. 137-153
  

Volume 409, Number 2, December 2008

• Dario Andrea Bini, Victor Y. Pan, Jan Verschelde:
  Preface. 155-157
  

• Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Olshevsky:
  Computations with quasiseparable polynomials and matrices. 158-179
  
• Annie A. M. Cuyt, Wen-shin Lee:
  A new algorithm for sparse interpolation of multivariate polynomials. 180-185
  
• Ioannis Z. Emiris, Elias P. Tsigaridas:
  Real algebraic numbers and polynomial systems of small degree. 186-199
  
• Bin Li, Jiawang Nie, Lihong Zhi:
  Approximate GCDs of polynomials and sparse SOS relaxations. 200-210
  
• Greg Leibon, Daniel N. Rockmore, Wooram Park, Robert Taintor, Gregory S. Chirikjian:
  A fast Hermite transform. 211-228
  
• Bernard Mourrain, Philippe Trebuchet:
  Stable normal forms for polynomial system solving. 229-240
  
• Marc Eric Normandin, Adam Vajda, Sree Ram Valluri:
  Gravitational wave signal templates, pattern recognition, and reciprocal Eulerian gamma functions. 241-254
  
• Victor Y. Pan, D. Grady, Brian Murphy, Guoliang Qian, Rhys Eric Rosholt, Anatole D. Ruslanov:
  Schur aggregation for linear systems and determinants. 255-268
  
• Helfried Peyrl, Pablo A. Parrilo:
  Computing sum of squares decompositions with rational coefficients. 269-281
  
• Hiroshi Sekigawa:
  The nearest polynomial with a zero in a given domain. 282-291
  
• Vikram Sharma:
  Complexity of real root isolation using continued fractions. 292-310
  
• Kiyoshi Shirayanagi, Hiroshi Sekigawa:
  A new Gröbner basis conversion method based on stabilization techniques. 311-317
  
• Zhonggang Zeng:
  A numerical elimination method for polynomial computations. 318-331
  

Volume 409, Number 3, December 2008

• Edgar Fisher, Nándor Sieben:
  Rectangular polyomino set weak (1, 2)-achievement games. 333-340
  
• Antoniy Ganchev, Lata Narayanan, Sunil M. Shende:
  Games to induce specified equilibria. 341-350
  
• Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
  Sequential vector packing. 351-363
  
• Sarmad Abbasi, Numan Sheikh:
  Complexity of question/answer games. 364-381
  
• Jean-Luc Baril, Jean Marcel Pallo:
  The pruning-grafting lattice of binary trees. 382-393
  
• Cees H. Elzinga, Sven Rahmann, Hui Wang:
  Algorithms for subsequence combinatorics. 394-404
  
• Weigen Yan, Fuji Zhang:
  A quadratic identity for the number of perfect matchings of plane graphs. 405-410
  
• Alan Deckelbaum:
  Simulating one-reversal multicounter machines by partially blind multihead finite automata. 411-416
  
• Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su:
  Minimum-cost delegation in service composition. 417-431
  
• James D. Currie, Terry I. Visentin:
  Long binary patterns are Abelian 2-avoidable. 432-437
  
• Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur:
  Generalized LCS. 438-449
  
• Ping-Ying Tsai, Jung-Sheng Fu, Gen-Huey Chen:
  Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model. 450-460
  
• Christian Kassel, Christophe Reutenauer:
  A palindromization map for the free group. 461-470
  
• Stasys Jukna:
  Expanders and time-restricted branching programs. 471-476
  
• Xiaojun Shen, Jianyu Lou, Weifa Liang, Junzhou Luo:
  Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches. 477-485
  
• Philip Bille, Martin Farach-Colton:
  Fast and compact regular expression matching. 486-496
  
• A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
  Paths and trails in edge-colored graphs. 497-510
  
• Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell A. Martin:
  On weighted balls-into-bins games. 511-520
  
• Joseph Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong:
  Dynamic bin packing of unit fractions items. 521-529
  
• Amparo Fúster-Sabater, Pino Caballero-Gil:
  Strategic attack on the shrinking generator. 530-536
  
• Pedro V. Silva:
  Rational subsets of partially reversible monoids. 537-548
  
• Jérôme Leroux:
  Structural Presburger digit vector automata. 549-556
  
• Emmanuel Jeandel, Nicolas Ollinger:
  Playing with Conway's problem. 557-564
  
• Peter R. J. Asveld:
  Generating all permutations by context-free grammars in Greibach normal form. 565-577
  
• Amy Glen, Florence Levé, Gwénaël Richomme:
  Quasiperiodic and Lyndon episturmian words. 578-600
  
• Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet:
  Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. 601-616
  
• Maurice J. Jansen, Kenneth W. Regan:
  A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. 617-622