SIAM J. Comput. A Complexity Theory Based on Boolean Algebra. A Fast Parallel Algorithm for Routing in Permutation Networks. Computing Multivariate Polynomials in Parallel. Negation can be Exponentially Powerful.
Negation Can Be Exponentially Powerful.
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. The Complexity of Computing the Permanent. On Time Versus Space.