Theoretical Computer Science, Volume 310

Volume 310, Numbers 1-3, 1 January 2004

• Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo:
  Finite-state dimension. 1-33
  
• Marc Chemillier:
  Synchronization of musical words. 35-60
  
• Savio S. H. Tse, Francis C. M. Lau:
  New bounds for multi-label interval routing. 61-77
  
• Olivier Serre:
  Vectorial languages and linear temporal logic. 79-116
  
• Annie Choquet-Geniet, Emmanuel Grolleau:
  Minimal schedulability interval for real-time systems of periodic tasks with offsets. 117-134
  
• Eric Angel, Evripidis Bampis, Laurent Gourvès:
  Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. 135-146
  
• Hing Leung, Viktor Podolskiy:
  The limitedness problem on distance automata: Hashiguchi's method revisited. 147-158
  
• Ron Lavi, Noam Nisan:
  Competitive analysis of incentive compatible on-line auctions. 159-180
  
• Lothar M. Schmitt:
  Theory of Genetic Algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. 181-231
  
• Traian-Florin Serbanuta:
  Extending Parikh matrices. 233-246
  
• Oliver Jenkinson, Luca Q. Zamboni:
  Characterisations of balanced words via orderings. 247-271
  
• Wai-fong Chuan:
  Moments of conjugacy classes of binary words. 273-285
  
• Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar:
  Finding hidden independent sets in interval graphs. 287-307
  
• Richard Groult, Martine Léonard, Laurent Mouchard:
  Speeding up the detection of evolutive tandem repeats. 309-328
  
• Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
  Tree spanners on chordal graphs: complexity and algorithms. 329-354
  
• Anton Mityagin:
  On the complexity of finding a local maximum of functions on discrete planar subsets. 355-363
  
• Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
  Memoryless determinacy of parity and mean payoff games: a simple proof. 365-378
  
• Yoshifumi Manabe, Naka Tajima:
  (h, k)-Arbiters for h-out-of-k mutual exclusion problem. 379-392
  
• Michal Kunc:
  Undecidability of the trace coding problem and some decidable cases. 393-456
  
• Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
  Competitive facility location: the Voronoi game. 457-467
  
• Julien Cervelle, Bruno Durand:
  Tilings: recursivity and regularity. 469-477
  
• Peter Dukes, Alan C. H. Ling:
  A combinatorial error bound for t-point-based sampling. 479-488
  
• Jérémie Chalopin, Hing Leung:
  On factorization forests of finite height. 489-499
  
• Sanming Zhou:
  A channel assignment problem for optical networks modelled by Cayley graphs. 501-511
  
• Michael Alekhnovich:
  Mutilated chessboard problem is exponentially hard for resolution. 513-525
  
• Alejandro López-Ortiz, Sven Schuierer:
  On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. 527-537