Well... the description unfortunately applies to ABDADA and YBWC as well. Which is why all of my chess work is entirely focused on trying to discover a work-efficient search methodology.
I hoped that my current methodology would be 100% work efficient, but alas... a fully work efficient methodology would have limited parallelism (average case speedup of fractions of a percent), and require an exponential amount of RAM to store the huge amount of parallel processing (roughly O(ply^(depth/2)) storage costs). Needless to say, that's unworkable as ply-searched grows. Again, MY method has this problem, maybe someone else's future discovery can figure out a way around these problems.
Still, I think I've discovered something that is more work efficient than current methodologies. So I'm willing to code it up and test it. I think I've come up with a better speculative execution heuristic than YBWC or ABDADA.