Theoretical Computer Science, Volume 297

Volume 297, Number 1-3, 17 March 2003

• Ali Akhavi:
  The optimal LLL algorithm is still polynomial in fixed dimension. 3-23
  
• Pedro Berrizbeitia, Mauricio Odremán Vera, Juan Tena Ayuso:
  Primality test for numbers M with a large power of 5 dividing M⁴-1. 25-36
  
• Olivier Carton, Max Michel:
  Unambiguous Büchi automata. 37-81
  
• Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni:
  A fully dynamic algorithm for distributed shortest paths. 83-102
  
• Myra B. Cohen, Charles J. Colbourn:
  Optimal and pessimal orderings of Steiner triple systems in disk arrays. 103-117
  
• Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise:
  The permutation-path coloring problem on trees. 119-143
  
• Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz:
  Decompositions for the edge colouring of reduced indifference graphs. 145-155
  
• Maribel Fernández, Ian Mackie:
  Operational equivalence for interaction nets. 157-181
  
• David Fernández-Baca:
  Decomposable multi-parameter matroid optimization problems. 183-198
  
• Joachim von zur Gathen, Thomas Lücking:
  Subresultants revisited. 199-239
  
• Andreas Goerdt, Michael Molloy:
  Analysis of edge deletion processes on faulty random regular graphs. 241-260
  
• Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger:
  Combinatorics of geometrically distributed random variables: run statistics. 261-270
  
• Claudio Gutiérrez:
  Equations in free semigroups with involution and their relation to equations in free groups. 271-280
  
• Valentine Kabanets:
  Almost k-wise independence and hard Boolean functions. 281-295
  
• François Laroussinie, Ph. Schnoebelen, Mathieu Turuani:
  On the expressivity and complexity of quantitative branching-time temporal logics. 297-315
  
• Guy Louchard, John W. Turner:
  Generalized covariances of multi-dimensional Brownian excursion local times. 317-336
  
• Richard Mayr:
  Undecidable problems in unreliable computations. 337-354
  
• Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
  Cube packing. 355-366
  
• Lucia Moura:
  Rank inequalities and separation algorithms for packing designs and sparse triple systems. 367-384
  
• Jaroslav Opatrny:
  Uniform multi-hop all-to-all optical routings in rings. 385-397
  
• Brett Stevens:
  The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs. 399-424
  
• Stephen Taylor, Marianne Durand:
  Emerging behavior as binary search trees are symmetrically updated. 425-445
  
• Brigitte Vallée:
  Dynamical analysis of a class of Euclidean algorithms. 447-486
  
• Michele Zito:
  Small maximal matchings in random graphs. 487-507