37 citations · 133 across the 25 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 2 cited
Probabilistic Recurrence Relations for Work and Span of Parallel Algorithms
Joseph Tassarotti
In this paper we present a method for obtaining tail-bounds for random variables satisfying certain probabilistic recurrences that arise in the analysis of randomized parallel divi…
cs.PL2017★ 2 cited
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
Joseph Tassarotti, Ralf Jung, Robert Harper
Compiler correctness proofs for higher-order concurrent languages are difficult: they involve establishing a termination-preserving refinement between a concurrent high-level sourc…