Theoretical Computer Science, Volume 234

Volume 234, Numbers 1-2, March 2000

• François Puitg, Jean-François Dufourd:
  Formalizing mathematics in higher-order logic: A case study in geometric modelling. 1-57
  
• Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot:
  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. 59-84
  
• Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic:
  The complexity of shortest path and dilation bounded interval routing. 85-107
  
• Klaus Weihrauch, Xizhong Zheng:
  Computability on continuous, lower semi-continuous and upper semi-continuous real functions. 109-133
  
• Dennis Pixton:
  Splicing in abstract families of languages. 135-166
  
• Kai Salomaa, Sheng Yu:
  Alternating finite automata and star-free languages. 167-176
  
• Mehryar Mohri:
  Minimization algorithms for sequential transducers. 177-201
  
• Dimitris Achlioptas, Marek Chrobak, John Noga:
  Competitive analysis of randomized paging algorithms. 203-218
  
• Cao An Wang, Binhai Zhu:
  Three-dimensional weak visibility: Complexity and applications. 219-232
  
• Jean Françon, Yves Bertrand:
  Topological 3D-manifolds: a statistical study of the cells. 233-254
  
• Didier Arquès, Alain Giorgetti:
  Counting rooted maps on a surface. 255-272
  
• Aduri Pavan, Alan L. Selman:
  Complete distributional problems, hard languages, and resource-bounded measure. 273-286
  
• Zoltán Ésik:
  A proof of the Krohn-Rhodes Decomposition Theorem. 287-300
  
• Tanja Lange, Arne Winterhof:
  Factoring polynomials over arbitrary finite fields. 301-308
  
• Gérard Boudol:
  On the semantics of the call-by-name CPS transform. 309-321
  
• Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara:
  Erratum to "Reducibility classes of P-selective sets". 323
  
• Sergio De Agostino:
  Erratum to "P-complete Problems in Data Compression". 325-326