2 papers
cs.DS2026
Scalable Algorithms for Approximate DNF Model Counting
Paul Burkhardt, David G. Harris, Kevin T Schmitt
Model counting of Disjunctive Normal Form (DNF) formulas is a critical problem in applications such as probabilistic inference and network reliability. For example, it is often use…
cs.DS2024
Improved parallel derandomization via finite automata with applications
Jeff Giliberti, David G. Harris
A central approach to algorithmic derandomization is to construct probability distributions with small support that "fool" randomized algorithms, often enabling efficient parallel…