1. K. Abrahamson, Time-Space Tradeoffs for Branching Programs Contrasted with Those for Straight-Line Programs, Proc. 27. FoCS, 1986, 402–409.
2. N. Alon, R. Boppana, The Monotone Circuit Complexity of Boolean Functions, Combinatorica 7, 1987, 1–22.
3. A. Borodin, On Relating Time and Space to Size and Depth, SIAM J. Cornput. 6, 1977, 733–744.
4. M. Ben-Or, Lower Bonds for Algebraic Computation Trees, Proc. 15. SToC, 1983, 80–86.
5. N. Blum, A Boolean Function Requiring 3n Network Size, TCS 28, 1984, 337–345.