Journals in DBLP

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

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