Martin Sauerhoff. On the size of randomized OBDDs and read-once branching programs for k-stable functions. Computational Complexity, 10(2):155-178, 2001. [doi]
@article{Sauerhoff01:0,
title = {On the size of randomized OBDDs and read-once branching programs for k-stable functions},
author = {Martin Sauerhoff},
year = {2001},
url = {http://link.springer.de/link/service/journals/00037/bibs/1010002/10100155.htm},
researchr = {https://researchr.org/publication/Sauerhoff01%3A0},
cites = {0},
citedby = {0},
journal = {Computational Complexity},
volume = {10},
number = {2},
pages = {155-178},
}