Probabilistic recurrence relations
From MaRDI portal
Publication:4327630
DOI10.1145/195613.195632zbMath0830.68046OpenAlexW1973393028MaRDI QIDQ4327630
Publication date: 10 April 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195613.195632
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ Probabilistic recurrence relations revisited ⋮ Optimal algorithms for finding connected components of an unknown graph ⋮ Nearly Work-Efficient Parallel Algorithm for Digraph Reachability ⋮ An efficient distributed algorithm for constructing small dominating sets ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops ⋮ A Real Elementary Approach to the Master Recurrence and Generalizations ⋮ Verified analysis of random binary tree structures ⋮ Computing expected runtimes for constant probability programs
This page was built for publication: Probabilistic recurrence relations
