Beate Bollig. The optimal read-once branching program complexity for the direct storage access function. Inf. Process. Lett., 106(4):171-174, 2008. [doi]
@article{Bollig08:1,
title = {The optimal read-once branching program complexity for the direct storage access function},
author = {Beate Bollig},
year = {2008},
doi = {10.1016/j.ipl.2007.11.009},
url = {http://dx.doi.org/10.1016/j.ipl.2007.11.009},
researchr = {https://researchr.org/publication/Bollig08%3A1},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {106},
number = {4},
pages = {171-174},
}