1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2009
Simpler Proofs by Symbolic Perturbation
Tobias Jacobs
In analyses of algorithms, a substantial amount of effort has often to be spent on the discussion of special cases. For example, when the analysis considers the cases X<Y and X>Y s…
cs.DS2009★ 1 cited
On the Complexity of Searching in Trees: Average-case Minimization
Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber +1
We focus on the average-case analysis: A function w : V -> Z+ is given which defines the likelihood for a node to be the one marked, and we want the strategy that minimizes the exp…