Journals in DBLP

Theor. Comput. Sci.
2004, volume: 320, number: 2-3

1. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
   New spectral lower bounds on the bisection width of graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:155-174 [Journal]
   
2. Gillian Z. Elston, Gretchen Ostheimer
   On groups whose word problem is solved by a~counter automaton. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:175-185 [Journal]
   
3. Christian Choffrut, Y. Haddad
   String-matching with OBDDs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:187-198 [Journal]
   
4. J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
   The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:199-212 [Journal]
   
5. André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon
   Bounding the firing synchronization problem on a ring. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:213-228 [Journal]
   
6. Olivier Powell
   A note on measuring in P. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:229-246 [Journal]
   
7. Martin Middendorf, David Manlove
   Combined super-/substring and super-/subsequence problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:247-267 [Journal]
   
8. Carlo Blundo, Paolo D'Arco, Vanesa Daza, Carles Padró
   Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:269-291 [Journal]
   
9. Michael Domaratzki
   Deletion along trajectories. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:320, n:2-3, pp:293-313 [Journal]
   
10. Arto Salomaa, Derick Wood, Sheng Yu
    On the state complexity of reversals of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:315-329 [Journal]
    
11. Patrick Healy, Ago Kuusik
    Algorithms for multi-level graph planarity testing and layout. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:331-344 [Journal]
    
12. Simona Cocco, Rémi Monasson
    Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:345-372 [Journal]
    
13. Vilhelm Dahllöf, Peter Jonsson, Richard Beigel
    Algorithms for four variants of the exact satisfiability problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:373-394 [Journal]
    
14. Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
    An algorithmic view of gene teams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:395-418 [Journal]
    
15. Alexander Okhotin
    On the number of nonterminals in linear conjunctive grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:419-448 [Journal]
    
16. Asa Ben-Hur, Alexander Roitershtein, Hava T. Siegelmann
    On probabilistic analog automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:449-464 [Journal]
    
17. Markus Hunziker, António Machiavelo, Jihun Park
    Chebyshev polynomials over finite fields and reversibility of -automata on square grids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:465-483 [Journal]
    
18. Liying Kang, Moo Young Sohn, T. C. Edwin Cheng
    Paired-domination in inflated graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:485-494 [Journal]
    
19. John M. Hitchcock
    The size of SPP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:495-503 [Journal]