Journals in DBLP

Theor. Comput. Sci.
2006, volume: 362, number: 1-3

1. Nazim Fatès, Eric Thierry, Michel Morvan, Nicolas Schabanel
   Fully asynchronous behavior of double-quiescent elementary cellular automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:1-16 [Journal]
   
2. Khaled El-Fakih, Nina Yevtushenko, Sergey Buffalov, Gregor von Bochmann
   Progressive solutions to a parallel automata equation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:17-32 [Journal]
   
3. Francesc Rosselló, Gabriel Valiente
   An algebraic view of the relation between largest common subtrees and smallest common supertrees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:33-53 [Journal]
   
4. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
   If P neq NP then some strongly noninvertible functions are invertible. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:54-62 [Journal]
   
5. Guizhen Yang
   Computational aspects of mining maximal frequent patterns. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:63-85 [Journal]
   
6. Beate Bollig, Stephan Waack, Philipp Woelfel
   Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:86-99 [Journal]
   
7. Pedro García, José Ruiz
   Learning in varieties of the form V^*LI from positive data. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:100-114 [Journal]
   
8. Min Ji, Yong He, T. C. Edwin Cheng
   Scheduling linear deteriorating jobs with an availability constraint on a single machine. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:115-126 [Journal]
   
9. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
   The maximum resource bin packing problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:362, n:1-3, pp:127-139 [Journal]
   
10. Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
    Minimal invariant sets in a vertex-weighted graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:140-161 [Journal]
    
11. Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
    Improved algorithms for the k maximum-sums problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:162-170 [Journal]
    
12. Turlough Neary, Damien Woods
    Small fast universal Turing machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:171-195 [Journal]
    
13. Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
    Deterministic M2M multicast in radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:196-206 [Journal]
    
14. Matthieu Picantin
    Finite transducers for divisibility monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:207-221 [Journal]
    
15. Arto Salomaa
    Independence of certain quantities indicating subword occurrences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:222-231 [Journal]
    
16. Mark Kambites
    Word problems recognisable by deterministic blind monoid automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:232-237 [Journal]
    
17. Mohamed Eid Hussein, Uwe Schwiegelshohn
    Utilization of nonclairvoyant online schedules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:238-247 [Journal]
    
18. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest repeats with a block of k don't cares. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:248-254 [Journal]
    
19. Alain Bretto, Alain Faisant, Thierry Vallée
    Compatible topologies on graphs: An application to graph isomorphism problem complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:255-272 [Journal]
    
20. T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
    Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:273-281 [Journal]
    
21. Aldo de Luca, Alessandro De Luca
    Pseudopalindrome closure operators in free monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:282-300 [Journal]