Develops Shapley-based ex-ante influence attribution with polynomial algorithms for single-step activation, #P-hardness beyond one step, and approximations for the IC model.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Cofola language and three-phase compiler reduce combinatorial counting problems to practical WFOMC instances while preserving symmetries.
Introduces a stochastic connectivity model combining typed dependency graphs, replication maps, probability measures, and success predicates for microservice availability analysis reconstructible from traces.
citing papers explorer
-
Efficient Shapley-Based Influence Attribution in Social Networks
Develops Shapley-based ex-ante influence attribution with polynomial algorithms for single-step activation, #P-hardness beyond one step, and approximations for the IC model.
-
Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
Cofola language and three-phase compiler reduce combinatorial counting problems to practical WFOMC instances while preserving symmetries.
-
Stochastic Connectivity as the Foundation of a Runtime Model for Microservice Availability Analysis
Introduces a stochastic connectivity model combining typed dependency graphs, replication maps, probability measures, and success predicates for microservice availability analysis reconstructible from traces.