Sanjay Gupta The Power of Witness Reduction. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:43-59 [Conf]

William I. Gasarch Bounded Queries in Recursion Theory: A Survey. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:62-78 [Conf]

Uriel Feige On the Success Probability of the Two Provers in One-Round Proof Systems. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:116-123 [Conf]

Rafail Ostrovsky One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:133-138 [Conf]

Rafi Heiman, Avi Wigderson Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:172-179 [Conf]

Miklos Santha On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:180-187 [Conf]

Jack H. Lutz A Pseudorandom Oracle Characterization of BPP. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:190-195 [Conf]

Stephen A. Fenner Notions of Resource-Bounded Category and Genericity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:196-212 [Conf]

László Babai, Noam Nisan BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:213-219 [Conf]

José L. Balcázar Adaptive Logspace and Depth-Bounded Reducibilities. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:240-254 [Conf]

Richard Chang, Jim Kadin, Pankaj Rohatgi Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:255-269 [Conf]

V. Vinay Counting Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:270-284 [Conf]

Matthias Krause Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:314-321 [Conf]

Jeff Edmonds Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:322-331 [Conf]

Erich Grädel Capturing Complexity Classes by Fragments of Second Order Logic. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:341-352 [Conf]

Jun Tarui Degree Compexity of Boolean Functions and Its Applications to Realivized Separations. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:382-390 [Conf]