On the construction of parallel computers from various bases of Boolean functions

Parallel speedup of sequential machines: a defense of parallel computation thesis

ACM SIGACT News

A Note on Nondeterminism in Small, Fast Parallel Computers

IEEE Transactions on Computers

Complexity theory column 5: the not-ready-for-prime-time conjectures

ACM SIGACT News

Gap-definable counting classes

Journal of Computer and System Sciences

The satanic notations: counting classes beyond #P and other definitional adventures

ACM SIGACT News

Boolean Formulas are Hard to Learn for most Gate Bases

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory

Restrictive Acceptance Suffices for Equivalence Problems

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory

General-purpose computation with neural networks: a survey of complexity theoretic results

Neural Computation

Lower bounds and the hardness of counting properties

Theoretical Computer Science

Quantum and classical complexity classes: separations, collapses, and closure properties

Information and Computation

Quantum and classical complexity classes: Separations, collapses, and closure properties

Information and Computation

Completeness for parity problems

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Very sparse leaf languages

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Leaf language classes

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Survey: The consequences of eliminating NP solutions

Computer Science Review