PaperBounded-depth, polynomial-size circuits for symmetric functionsRonald Fagin, Maria M. Klawe, et al.Theoretical Computer Science
PaperA new approach to fault-tolerant wormhole routing for mesh-connected parallel computersChing-Tien Ho, Larry StockmeyerIEEE TC
PaperCosmological lower bound on the circuit complexity of a small problem in logicLarry Stockmeyer, Albert R. MeyerJournal of the ACM
