Volume 100,
Number 1,
1992
- Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran:
Multiplication, Division and Shift Instructions in Parallel Random Access Machines.
1-44
- Andreas Goerdt:
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions.
45-66
- Aldo de Luca, Stefano Varricchio:
On Noncounting Regular Classes.
67-104
- Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel:
Pinwheel Scheduling with Two Distinct Numbers.
105-135
- Daniel Benninger, Jürg Schmid:
Effective Subdirect Decomposition: A Case Study.
137-156
- Raymond A. Board, Leonard Pitt:
On the Necessity of Occam Algorithms.
157-184
- Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney:
A Distributed Selection Algorithm and its Expected Communication Complexity.
185-204
- Seinosuke Toda, Osamu Watanabe:
Polynomial Time 1-Turing Reductions from #PH to #P.
205-221
- Paul Erdös, D. Frank Hsu:
Distributed Loop Network with Minimum Transmission Delay.
223-241
- Helmut Prodinger:
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet.
243-251
- Paul Beame, Erik Brisson, Richard E. Ladner:
The Complexity of Computing Symmetric Functions Using Threshold Circuits.
253-265
Volume 100,
Number 2,
1992
Last update Sat May 26 07:13:04 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
