1. F. Ablayev, Randomization and Nondeterminism are Incomparable for ordered read-once branching programs, Proc. ICALP’97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 195–202; ECCC TR97-021, 1997, available at http://www.eccc.uni-trier.de/eccc/.
2. F. Ablayev, M. Karpinski, On the power of randomized ordered branching programs, ECCC TR98-004, 1998, available at http://www.eccc.uni-trier.de/eccc/.
3. F. Ablayev, M. Karpinski, A lower bound for integer multiplication on randomized read-once branching programs, ECCC TR98-011, 1998, available at http://www.eccc.uni-trier.de/eccc/.
4. F. Ablayev, M. Karpinski, R. Mubarakzjanov, On BPP versus NP∪ coNP for ordered read-once branching programs, Proc. Randomized Algorithms 1998, Bruno, 1998.