We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs, where nodes represent hypotheses and edges specify a partial ordering in which the hypotheses ...

Under the assumptions of Weitzman’s sequential search algorithm, the proposed procedure recursively makes random draws for each quantity that requires numerical integration while enforcing the ...