15 citations · 66 across the 23 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.CR2023★ 12 cited
A Game-theoretic Approach for Provably-Uniform Random Number Generation in Decentralized Networks
Zhuo Cai
Many protocols in distributed computing rely on a source of randomness, usually called a random beacon, both for their applicability and security. This is especially true for proof…
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.DS2023
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
Giovanna K. Conrado, Amir K. Goharshady, Harshit J. Motwani +1
We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) th…