no. 1
A note on read-k times branching programs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 1, pp. 75-83. 
@article{ITA_1995__29_1_75_0,
     author = {Jukna, Stasys},
     title = {A note on read-$k$ times branching programs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {75--83},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {1},
     year = {1995},
     mrnumber = {1315701},
     zbl = {0889.68021},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1995__29_1_75_0/}
}
TY  - JOUR
AU  - Jukna, Stasys
TI  - A note on read-$k$ times branching programs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1995
SP  - 75
EP  - 83
VL  - 29
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1995__29_1_75_0/
LA  - en
ID  - ITA_1995__29_1_75_0
ER  - 
%0 Journal Article
%A Jukna, Stasys
%T A note on read-$k$ times branching programs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1995
%P 75-83
%V 29
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1995__29_1_75_0/
%G en
%F ITA_1995__29_1_75_0
Jukna, Stasys. A note on read-$k$ times branching programs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 1, pp. 75-83. http://www.numdam.org/item/ITA_1995__29_1_75_0/

1. A. Borodin, A. Razborov, R. Smolensky, On lower bounds for read-k times branching programs, Computational Complexity, 1993, 3, pp. 1-18. | MR | Zbl

2. R. C. Bose, D. K. Ray-Chaudhuri, On a class of error-correcting binary group codes, Information and Control, 1960, 3, 1, pp. 68-79. | MR | Zbl

3. N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput, 1988, 77, pp. 935-938. | MR | Zbl

4. S. Jukna, The effect of null-chains on the complexity of contact circuits, Springer Lecture Notes in Computer Science, 1989, 380, pp. 246-256. | MR | Zbl

5. M. Krause, Ch. Meinel, S. Waack, Separating the eraser Turing machine classes Le, NLe, co - NLe and Pe, Theor. Comp. Sci., 1991, 86, pp. 267-275. | MR | Zbl

6. S. E. Kuznetsov, The influence of null-chains on the complexity of contact circuits, Probabilistic Methods in Cybernetics, 1984, 20, in Russian.

7. E. A. Okolnishnikova, Lower bounds on the complexity of realization of characteristic functions of binary codes by branching programs, Diskretnii Analiz, 1991, Novosibirsk, 57, pp. 61-83, in Russian. | MR | Zbl

8. A. A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, Springer Lecture Notes in Computer Science, 1991, 529, pp. 47-60. | MR

9. R. Szelepcényi, The method of forcing for nondeterministic automata, Bull. European Assoc. Theoret. Comput. Sci., 1987, 33, pp. 96-100. | Zbl

10. I. Wegener, On the complexity of branching programs and décision trees for clique functions, Internal Rept. 5/84, FB Inforrnatik, Univ. of Frankfurt, 1984 [see also: Journal of the ACM, 1988, 35, pp. 461-471]. | MR | Zbl

11. S. Žak, An exponential lower bound for one-time-only branching programs, Springer Lecture Notes in Computer Science, 1984, 176, pp. 562-566. | MR | Zbl