Theoretical Computer Science, Volume 255

Volume 255, Number 1-2, 28 March 2001

• Colin Stirling:
  Decidability of DPDA equivalence. 1-31
  
• Thomas Erlebach, Klaus Jansen:
  The complexity of path coloring and call scheduling. 33-50
  
• Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
  Approximation algorithms for maximum two-dimensional pattern matching. 51-62
  
• Ivo Düntsch, Hui Wang, Stephen McCloskey:
  A relation - algebraic approach to the region connection calculus. 63-83
  
• S. S. Yu:
  Post-plus languages. 85-105
  
• Sanjay Jain:
  Branch and bound on the network model. 107-123
  
• Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
  Recursively enumerable reals and Chaitin Omega numbers. 125-149
  
• Jean Neraud, Carla Selmi:
  On codes with a finite deciphering delay: constructing uncompletable words. 151-162
  
• Dietmar Wätjen:
  Parallel communicating limited and uniformly limited 0L systems. 163-191
  
• Vesa Halava, Mika Hirvensalo, Ronald de Wolf:
  Marked PCP is decidable. 193-204
  
• Vikraman Arvind, Johannes Köbler:
  On pseudorandomness and resource-bounded measure. 205-221
  
• Olivier Finkel:
  Locally finite languages. 223-261
  
• Tiziana Calamoneri, Annalisa Massini:
  Optimal three-dimensional layout of interconnection networks. 263-279
  
• Tomás Feder:
  Fanout limitations on constraint systems. 281-293
  
• Bruno Apolloni, Dario Malchiodi:
  Gaining degrees of freedom in subsymbolic learning. 295-321
  
• Luis-Miguel Lopez, Philippe Narbel:
  Substitutions and interval exchange transformations of rotation class. 323-344
  
• Jean-Guy Penaud, Elisa Pergola, Renzo Pinzani, Olivier Roques:
  Chemins de Schröder et hiérarchies aléatoires. 345-361
  
• Jacques Justin, Giuseppe Pirillo:
  Fractional powers in Sturmian words. 363-376
  
• George Rahonis:
  Alphabetic and synchronized tree transducers. 377-399
  
• Jukka A. Koskinen:
  Non-injective knapsack public-key cryptosystems. 401-422
  
• Paul F. Fischer, Franco P. Preparata, John E. Savage:
  Generalized scans and tridiagonal systems. 423-436
  
• Christophe Picouleau:
  Reconstruction of domino tiling from its two orthogonal projections. 437-447
  
• Guohua Jin, Zhiyuan Li, Fujie Chen:
  A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing. 449-481
  
• Sabrina Mantaci, Antonio Restivo:
  Codes and equations on trees. 483-509
  
• Erzsébet Csuhaj-Varjú, György Vaszil:
  On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. 511-538
  
• Xavier Droubay, Jacques Justin, Giuseppe Pirillo:
  Episturmian words and some constructions of de Luca and Rauzy. 539-553
  
• Guoliang Xue:
  A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM. 555-568
  
• Jorge Almeida, Pedro V. Silva:
  SC-hyperdecidability of R. 569-591
  
• Felipe Cucker:
  On weak and weighted computations over the real closure of Q. 593-600
  
• Roberto Incitti:
  The growth function of context-free languages. 601-605
  
• Hervé Fournier:
  Sparse NP-complete problems over the reals with addition. 607-610
  
• Olga Sokratova:
  The Mal'cev Lemma and rewriting on semirings. 611-614
  
• Macha Nikolskaia, L. Nikolskaia:
  Size of OBDD representation of 2-level redundancies functions. 615-625
  
• Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano:
  Dynamically maintaining the widest k-dense corridor. 627-639
  
• Ravi Kumar, D. Sivakumar:
  On the unique shortest lattice vector problem. 641-648
  
• Yu-Wei Chen, Kuo-Liang Chung:
  Improved fault-tolerant sorting algorithm in hypercubes. 649-658
  
• Chiuyuan Chen, Kaiping Wu:
  Disproving a conjecture on planar visibility graphs. 659-665
  
• Juha Honkala:
  On Parikh slender context-free languages. 667-677
  
• Elena Barcucci, Simone Rinaldi:
  Some linear recurrences and their combinatorial interpretation by means of regular languages. 679-686
  
• Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis:
  Deciding stability and mortality of piecewise affine dynamical systems. 687-696
  
• A. N. Trahtman:
  Erratum to ``Optimal estimation on the order of local testability of finite automata'' - [TCS 231(2000) 59-74]. 697