Journals in DBLP

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

1. Bruno Courcelle
   The monadic second-order logic of graphs XII: planar graphs and planar maps. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:1-32 [Journal]
   
2. Yongge Wang
   Resource bounded randomness and computational complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:33-55 [Journal]
   
3. Francesco M. Malvestuto, Marina Moscarini
   Decomposition of a hypergraph by partial-edge separators. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:57-79 [Journal]
   
4. Jean-Camille Birget
   Reductions and functors from problems to word problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:81-104 [Journal]
   
5. Petra Schuurman, Gerhard J. Woeginger
   A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:105-122 [Journal]
   
6. Paola Alimonti, Viggo Kann
   Some APX-completeness results for cubic graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:123-134 [Journal]
   
7. Niculae Mandache
   On the computational power of context-free PC grammar systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:135-148 [Journal]
   
8. Andries P. J. van der Walt, Sigrid Ewert
   A shrinking lemma for random forbidding context languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:149-158 [Journal]
   
9. Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
   Asymptotically efficient in-place merging. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:159-181 [Journal]
   
10. Changwook Kim, Ivan Hal Sudborough
    Leftmove-bounded picture languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:183-195 [Journal]
    
11. Rimli Sengupta, H. Venkateswaran
    Non-cancellative Boolean circuits: A generalization of monotone boolean circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:197-212 [Journal]
    
12. Siu-Wing Cheng
    The Steiner tree problem for terminals on the boundary of a rectilinear polygon. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:213-238 [Journal]
    
13. Jean Senellart
    Fast pattern matching in indexed texts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:239-262 [Journal]
    
14. Alberto Apostolico, Valentin E. Brimkov
    Fibonacci arrays and their two-dimensional repetitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:263-273 [Journal]
    
15. Cristopher Moore, James P. Crutchfield
    Quantum automata and quantum grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:275-306 [Journal]
    
16. Petr Kurka, Alejandro Maass
    Realtime subshifts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:307-325 [Journal]
    
17. Chung Keung Poon
    A space lower bound for st-connectivity on node-named JAGs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:327-345 [Journal]
    
18. Kamal Lodaya, Pascal Weil
    Series-parallel languages and the bounded-width property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:347-380 [Journal]
    
19. Hiroaki Tohyama, Akeo Adachi
    Complexity of path discovery game problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:381-406 [Journal]
    
20. U. K. Sarkar
    On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:407-421 [Journal]
    
21. Alexander Meduna
    Terminating left-hand sides of scattered context productions M. Nivat. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:423-427 [Journal]
    
22. Janos Simon, Shi-Chun Tsai
    On the bottleneck counting argument. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:429-437 [Journal]
    
23. James A. Anderson
    The intersection of retracts of A*. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:439-445 [Journal]
    
24. Bruce E. Litow
    On Hadamard square roots of unity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:447-454 [Journal]
    
25. Gonzalo Navarro
    Improved approximate pattern matching on hypertext. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:455-463 [Journal]
    
26. Viliam Geffert
    A variant of inductive counting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:465-475 [Journal]
    
27. Satyanarayana V. Lokam
    On the rigidity of Vandermonde matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:477-483 [Journal]
    
28. Kazuo Iwama, Yahiko Kambayashi, Kazuya Takaki
    Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:485-494 [Journal]