2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2026
Monte Carlo to Las Vegas for Recursively Composed Functions
Bandar Al-Dhalaan, Shalev Ben-David
For a (possibly partial) Boolean function as well as a query complexity measure which maps Boolean functions to real numbers, define the compositio…
cs.DS2021★ 2 cited
Fast Construction of 4-Additive Spanners
Bandar Al-Dhalaan
A -additive spanner of a graph is a subgraph that preserves the distance between any two nodes up to a total additive error of . Efficient algorithms have been devised for c…