Journals in DBLP

Theor. Comput. Sci.
1992, volume: 100, number: 1

1. Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran
   Multiplication, Division and Shift Instructions in Parallel Random Access Machines. [Citation Graph (1, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:1-44 [Journal]
   
2. Andreas Goerdt
   Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:45-66 [Journal]
   
3. Aldo de Luca, Stefano Varricchio
   On Noncounting Regular Classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:67-104 [Journal]
   
4. Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel
   Pinwheel Scheduling with Two Distinct Numbers. [Citation Graph (1, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:105-135 [Journal]
   
5. Daniel Benninger, Jürg Schmid
   Effective Subdirect Decomposition: A Case Study. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:137-156 [Journal]
   
6. Raymond A. Board, Leonard Pitt
   On the Necessity of Occam Algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:157-184 [Journal]
   
7. Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney
   A Distributed Selection Algorithm and its Expected Communication Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:185-204 [Journal]
   
8. Seinosuke Toda, Osamu Watanabe
   Polynomial Time 1-Turing Reductions from #PH to #P. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:205-221 [Journal]
   
9. Paul Erdös, D. Frank Hsu
   Distributed Loop Network with Minimum Transmission Delay. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:100, n:1, pp:223-241 [Journal]
   
10. Helmut Prodinger
    Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:243-251 [Journal]
    
11. Paul Beame, Erik Brisson, Richard E. Ladner
    The Complexity of Computing Symmetric Functions Using Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:253-0 [Journal]