Journals in DBLP

Theor. Comput. Sci.
1993, volume: 107, number: 1

1. Carme Àlvarez, Birgit Jenner
   A Very Hard log-Space Counting Class. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:3-30 [Journal]
   
2. François Bédard, François Lemieux, Pierre McKenzie
   Extensions to Barrington's M-Program Model. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:31-61 [Journal]
   
3. Rafi Heiman, Ilan Newman, Avi Wigderson
   On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:63-76 [Journal]
   
4. Klaus-Jörn Lange
   Unambiguity of Circuits. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:77-94 [Journal]
   
5. Jack H. Lutz, William J. Schmidt
   Circuit Size Relative to Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:95-120 [Journal]
   
6. Yishay Mansour, Noam Nisan, Prasoon Tiwari
   The Computational Complexity of Universal Hashing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:121-133 [Journal]
   
7. Noam Nisan
   On Read-Once vs. Multiple Access to Randomness in Logspace. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:135-144 [Journal]
   
8. Alessandro Panconesi, Desh Ranjan
   Quantifiers and Approximation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:107, n:1, pp:145-163 [Journal]