Theoretical Computer Science, Volume 242

Volume 242, Numbers 1-2, 6 July 2000

• Sarit Kraus, Tatjana L. Plotkin:
  Algorithms of distributed task allocation for cooperative agents. 1-27
  
• Hsien-Kuei Hwang, Bo-Yin Yang, Yeong-Nan Yeh:
  Presorting algorithms: An average-case point of view. 29-40
  
• Klaus Meer:
  Counting problems over the reals. 41-58
  
• Hing Leung, Detlef Wotschke:
  On the size of parsers and LR(k)-grammars. 59-69
  
• Antonín Kucera:
  Effective decomposability of sequential behaviours. 71-89
  
• Pascal Hubert:
  Suites équilibrées. 91-108
  
• Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
  Strip tiling and regular grammars. 109-124
  
• Priti Shankar, Amitranjan Gantait, A. R. Yuvaraj, Maya Madhavan:
  A new algorithm for linear regular tree pattern matching. 125-142
  
• Friedrich Hubalek:
  On the variance of the internal path length of generalized digital trees - The Mellin convolution approach. 143-168
  
• Martha Escobar-Molano, Shahram Ghandeharizadeh:
  On the complexity of coordinated display of multimedia objects. 169-197
  
• Vikraman Arvind, N. V. Vinodchandran:
  The counting complexity of group-definable languages. 199-218
  
• Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
  Finite nondeterministic automata: Simulation and minimality. 219-235
  
• Samir Khuller, Robert Pless, Yoram J. Sussmann:
  Fault tolerant K-center problems. 237-245
  
• Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil:
  PSPACE-complete problems for subgroups of free groups and inverse finite automata. 247-281
  
• Drew Vandeth:
  Sturmian words and words with a critical exponent. 283-300
  
• Martin Mundhenk:
  On hard instances. 301-311
  
• Conrado Martínez, Salvador Roura:
  On the competitiveness of the move-to-front rule. 313-325
  
• Lucian Ilie:
  On lengths of words in context-free languages. 327-359
  
• Pascal Caron:
  Families of locally testable languages. 361-376
  
• Biing-Feng Wang:
  Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. 377-401
  
• G. S. Makanin, Tatiana A. Makanina:
  Parametrisation of solutions of parametric equation in free monoid. 403-475
  
• Pál Gyenizse, Sándor Vágvölgyi:
  A property of left-linear rewrite systems preserving recognizability. 477-498