Journals in DBLP

Theor. Comput. Sci.
2007, volume: 380, number: 1-2

1. Giuseppe F. Italiano, Catuscia Palamidessi
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:1- [Journal]
   
2. Chen Avin, Gunes Ercal
   On the cover time and mixing time of random geometric graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:2-22 [Journal]
   
3. Eugen Czeizler, Jarkko Kari
   A tight linear bound on the synchronization delay of bijective automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:23-36 [Journal]
   
4. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
   Faster algorithms for finding lowest common ancestors in directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:37-46 [Journal]
   
5. Martin Dietzfelbinger, Christoph Weidling
   Balanced allocation and dictionaries with tightly packed constant size bins. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:47-68 [Journal]
   
6. Manfred Droste, Paul Gastin
   Weighted automata and weighted logics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:69-86 [Journal]
   
7. Martin Gairing, Burkhard Monien, Andreas Woclaw
   A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:87-99 [Journal]
   
8. Juraj Hromkovic, Georg Schnitger
   Comparing the size of NFAs with and without epsilon-transitions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:100-114 [Journal]
   
9. Pascal Koiran, Vincent Nesme, Natacha Portier
   The quantum query complexity of the abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:1-2, pp:115-126 [Journal]
   
10. Mihai Patrascu, Corina E. Tarnita
    On dynamic bit-probe complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:127-142 [Journal]
    
11. Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
    Recursively defined metric spaces without contraction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:143-163 [Journal]
    
12. Damien Pous
    New up-to techniques for weak bisimulation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:164-180 [Journal]
    
13. Michael W. Mislove
    Discrete random variables over domains. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:181-198 [Journal]
    
14. Martin Grohe, Christoph Koch, Nicole Schweikardt
    Tight lower bounds for query processing on streaming and external memory data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:199-217 [Journal]