1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2023★ 1 cited
Automated Tail Bound Analysis for Probabilistic Recurrence Relations
Yican Sun, Hongfei Fu, Krishnendu Chatterjee +1
Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit , we consider the classical…
cs.PL2020★ 1 cited
Quantitative Analysis of Assertion Violations in Probabilistic Programs
Jinyi Wang, Yican Sun, Hongfei Fu +2
In this work, we consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide autom…
cs.PL2020
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations
Jinyi Wang, Yican Sun, Hongfei Fu +3
Analyzing probabilistic programs and randomized algorithms are classical problems in computer science. The first basic problem in the analysis of stochastic processes is to conside…