1. F.M. Ablayev, M. Karpinski, A lower bound for integer multiplication on randomized read-once branching programs, Proceedings of CSIT ’99, Electronic Edition.
2. Complexity classes in communication complexity theory;Babai,1986
3. On the complexity of the hidden weighted bit function for various BDD models;Bollig;RAIRO Theoret. Comput. Sci.,1999
4. On the nonapproximability of boolean functions by OBDDs and read-k-times branching programs;Bollig;Inform. Comput.,2002
5. B. Bollig, I. Wegener, Approximability and nonapproximability by binary decision diagrams, Electronic Colloquium on Computational Complexity ECCC 7(52).