Worst-case/depth analysis of BDDs and related problems have been studied in additional contexts, e.g., testing edges to decide about graph properties (e.g., [1]}, [2]}, [3]}, [4]}) or letters to decide string properties [1]}. The Boolean functions considered are thus very different from ours. There is also work on computing BDDs with minimum depth for input-output sample pairs (e.g., [6]}, [7]}), but where a Boolean formula is not a-priori known.
