Stoyan Dimitrov

collaborators

2 papers

math.NT2024

Lower bounds on expressions dependent on functions $φ (n)$ , $ψ (n)$ and $σ (n)$ , II

S. I. Dimitrov

In this paper we establish lower bounds on several expressions dependent on functions $φ (n)$ , $ψ (n)$ and $σ (n)$ .

cs.DS2024

BFS versus DFS for fixed-level targets in ordered trees

Stoyan Dimitrov, Martin Minchev, Yan Zhuang

We find the average time complexity of the breadth-first search (BFS) and the depth-first search (DFS) algorithms, when one searches for a target node selected uniformly at random…

Lower bounds on expressions dependent on functions φ(n), ψ(n) and σ(n), II

BFS versus DFS for fixed-level targets in ordered trees

Lower bounds on expressions dependent on functions $φ (n)$ , $ψ (n)$ and $σ (n)$ , II