1. Ajtai, M. (1999). A non-linear time lower bound for boolean branching programs. Proc. of 40th FOCS, 60–70.
2. Beame, P., Saks, M., Sun, X., and Vee, E. (2000). Super-linear time-space tradeoff lower bounds for randomized computation. Proc. of 41st FOCS, 169–179.
3. Beame, P. and Vee, E. (2002). Time-space trade-offs, multiparty communication complexity, and nearest neighbor problems. Proc. of 34th STOC, 688–697.
4. Bollig, B. (2001). Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication. RAIRO Theoretical Informatics and Applications, 35:149-162.
5. Bollig, B., Waack, St., and Woelfel, P. (2002). Parity graph-driven read-onc branching programs and an exponential lower bound for integer multiplication. Proc. of 2nd IFIP International Conference on Theoretical Computer Science, 83–94.