Journals in DBLP

Theor. Comput. Sci.
2000, volume: 234, number: 1-2

1. François Puitg, Jean-François Dufourd
   Formalizing mathematics in higher-order logic: A case study in geometric modelling. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:1-57 [Journal]
   
2. 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. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:59-84 [Journal]
   
3. Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
   The complexity of shortest path and dilation bounded interval routing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:85-107 [Journal]
   
4. Klaus Weihrauch, Xizhong Zheng
   Computability on continuous, lower semi-continuous and upper semi-continuous real functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:109-133 [Journal]
   
5. Dennis Pixton
   Splicing in abstract families of languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:135-166 [Journal]
   
6. Kai Salomaa, Sheng Yu
   Alternating finite automata and star-free languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:167-176 [Journal]
   
7. Mehryar Mohri
   Minimization algorithms for sequential transducers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:177-201 [Journal]
   
8. Dimitris Achlioptas, Marek Chrobak, John Noga
   Competitive analysis of randomized paging algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:203-218 [Journal]
   
9. Cao An Wang, Binhai Zhu
   Three-dimensional weak visibility: Complexity and applications. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:234, n:1-2, pp:219-232 [Journal]
   
10. Jean Françon, Yves Bertrand
    Topological 3D-manifolds: a statistical study of the cells. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:233-254 [Journal]
    
11. Didier Arquès, Alain Giorgetti
    Counting rooted maps on a surface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:255-272 [Journal]
    
12. Aduri Pavan, Alan L. Selman
    Complete distributional problems, hard languages, and resource-bounded measure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:273-286 [Journal]
    
13. Zoltán Ésik
    A proof of the Krohn-Rhodes Decomposition Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:287-300 [Journal]
    
14. Tanja Lange, Arne Winterhof
    Factoring polynomials over arbitrary finite fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:301-308 [Journal]
    
15. Gérard Boudol
    On the semantics of the call-by-name CPS transform. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:309-321 [Journal]
    
16. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
    Erratum to "Reducibility classes of P-selective sets". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:323- [Journal]
    
17. Sergio De Agostino
    Erratum to "P-complete Problems in Data Compression". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:325-326 [Journal]