On the public citation graph

Knowledge Compilation meets Uniform Sampling

0 signed · 89 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.2000.2885openalex-snapshot
Uniform Generation of NP-Witnesses Using an NP-Oracle
inferredcites →https://doi.org/10.1007/10722167_12openalex-snapshot
Building Circuits from Relations
inferredcites →https://doi.org/10.1007/11499107_24openalex-snapshot
A New Approach to Model Counting
inferredcites →https://doi.org/10.1007/11889205_56openalex-snapshot
A New Algorithm for Sampling CSP Solutions Uniformly at Random
inferredcites →https://doi.org/10.1007/978-3-319-94144-8_9openalex-snapshot
Fast Sampling of Perfectly Uniform Satisfying Assignments
inferredcites →https://doi.org/10.1007/978-3-642-30353-1_36openalex-snapshot
Dsharp: Fast d-DNNF Compilation with sharpSAT
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_40openalex-snapshot
A Scalable and Nearly Uniform Generator of SAT Witnesses
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_25openalex-snapshot
On Parallel Scalable Uniform SAT Witness Generation
inferredcites →https://doi.org/10.1016/0004-3702(90)90060-dopenalex-snapshot
The computational complexity of probabilistic inference using bayesian belief networks
inferredcites →https://doi.org/10.1016/0004-3702(94)00092-1openalex-snapshot
On the hardness of approximate reasoning
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1016/j.artint.2007.11.002openalex-snapshot
On probabilistic inference by weighted model counting
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/fmcad.2013.6679385openalex-snapshot
Syntax-guided synthesis
inferredcites →https://doi.org/10.1109/iccad.2007.4397275openalex-snapshot
Stimulus generation for constrained random simulation
inferredcites →https://doi.org/10.1109/tcad.2004.823348openalex-snapshot
Simplifying Boolean Constraint Solving for Random Simulation-Vector Generation
inferredcites →https://doi.org/10.1109/test.2003.1270852openalex-snapshot
Race a word-level atpg-based constraints solver system for smart random simulation
inferredcites →https://doi.org/10.1109/tse.2017.2785841openalex-snapshot
Coverage-Based Greybox Fuzzing as Markov Chain
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/2593069.2593097openalex-snapshot
Balancing Scalability and Uniformity in SAT Witness Generator
inferredcites →https://doi.org/10.1145/2976749.2978428openalex-snapshot
Coverage-based Greybox Fuzzing as Markov Chain
inferredcites →https://doi.org/10.1145/3180155.3180248openalex-snapshot
Efficient sampling of SAT solutions for testing
inferredcites →https://doi.org/10.1145/3236024.3236084openalex-snapshot
Bug synthesis: challenging bug-finding tools with deep faults
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/774572.774590openalex-snapshot
Simplifying Boolean constraint solving for random simulation-vector generation
inferredcites →https://doi.org/10.1145/800191.805647openalex-snapshot
A program testing system
inferredcites →https://doi.org/10.1184/r1/6582245.v1openalex-snapshot
Probability-Based Parameter Selection for Black-Box Fuzz Testing
inferredcites →https://doi.org/10.1609/aimag.v28i3.2052openalex-snapshot
Constraint-Based Random Stimuli Generation for Hardware Verification
inferredcites →https://doi.org/10.21236/ada610472openalex-snapshot
Probability-Based Parameter Selection for Black-Box Fuzz Testing
inferredcites →https://doi.org/10.24963/ijcai.2017/93openalex-snapshot
An Improved Decision-DNNF Compiler
inferredcites →https://doi.org/10.48550/arxiv.1404.6682openalex-snapshot
Sampling Techniques for Boolean Satisfiability
inferredcites →https://doi.org/10.48550/arxiv.1512.06633openalex-snapshot
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
inferredcites →https://doi.org/10.5555/1326073.1326127openalex-snapshot
Stimulus generation for constrained random simulation
inferredcites →https://doi.org/10.5555/777092.777098openalex-snapshot
Generating random solutions for constraint satisfaction problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_4openalex-snapshot
$$\mathsf {WAPS}$$ : Weighted and Projected Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_31openalex-snapshot
Manthan: A Data-Driven Approach for Boolean Function Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-76020-5_4openalex-snapshot
Product Optimization in Stepwise Design
inferred← citeshttps://doi.org/10.1007/978-3-031-95973-8_3openalex-snapshot
Determining the Most Promising Selective Backbone Size for Partial Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_10openalex-snapshot
SMT(LIA) Sampling with High Diversity
inferred← citeshttps://doi.org/10.1109/q-se59154.2023.00012openalex-snapshot
Can Quantum Computing Improve Uniform Random Sampling of Large Configuration Spaces?
inferred← citeshttps://doi.org/10.1109/tse.2024.3419919openalex-snapshot
A Scalable t-Wise Coverage Estimator: Algorithms and Applications
inferred← citeshttps://doi.org/10.1109/tse.2026.3696093openalex-snapshot
Tackling Expressive Feature-Modeling Constructs With Pseudo-Boolean d-DNNF Compilation
inferred← citeshttps://doi.org/10.1145/3368089.3409744openalex-snapshot
Baital: an adaptive weighted sampling approach for improved t-wise coverage
inferred← citeshttps://doi.org/10.1145/3375395.3387642openalex-snapshot
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases
inferred← citeshttps://doi.org/10.1145/3400302.3415707openalex-snapshot
On uniformly sampling traces of a transition system
inferred← citeshttps://doi.org/10.1145/3442391.3442404openalex-snapshot
Applications of #SAT Solvers on Feature Models
inferred← citeshttps://doi.org/10.1145/3644033openalex-snapshot
Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)
inferred← citeshttps://doi.org/10.1145/3654988openalex-snapshot
StarfishDB: A Query Execution Engine for Relational Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3715340.3715442openalex-snapshot
When to Sample from Feature Diagrams?
inferred← citeshttps://doi.org/10.1145/3731302openalex-snapshot
Science of Software Product Lines
inferred← citeshttps://doi.org/10.1145/3731302.3731303openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1145/3731302.3731304openalex-snapshot
Acknowledgments
inferred← citeshttps://doi.org/10.1145/3731302.3731305openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3731302.3731306openalex-snapshot
How to and Who Should Read This Book
inferred← citeshttps://doi.org/10.1145/3731302.3731307openalex-snapshot
Modern Software Design Paradigms
inferred← citeshttps://doi.org/10.1145/3731302.3731308openalex-snapshot
Software Product Lines
inferred← citeshttps://doi.org/10.1145/3731302.3731309openalex-snapshot
Model-Driven Engineering
inferred← citeshttps://doi.org/10.1145/3731302.3731310openalex-snapshot
Basics of Category Theory
inferred← citeshttps://doi.org/10.1145/3731302.3731311openalex-snapshot
Feature Modularity
inferred← citeshttps://doi.org/10.1145/3731302.3731312openalex-snapshot
Pragmatic Issues
inferred← citeshttps://doi.org/10.1145/3731302.3731313openalex-snapshot
Feature Interactions
inferred← citeshttps://doi.org/10.1145/3731302.3731314openalex-snapshot
Cubes: SPLs of SPLs of SPLs of SPLs…
inferred← citeshttps://doi.org/10.1145/3731302.3731315openalex-snapshot
Refactorings and Design Patterns
inferred← citeshttps://doi.org/10.1145/3731302.3731316openalex-snapshot
The X15 SPL Refactoring Engine
inferred← citeshttps://doi.org/10.1145/3731302.3731317openalex-snapshot
Searching Colossal Product Spaces
inferred← citeshttps://doi.org/10.1145/3731302.3731318openalex-snapshot
Dataflow Program Design
inferred← citeshttps://doi.org/10.1145/3731302.3731319openalex-snapshot
Advanced: Optimal Dataflow Programs and Dataflow SPLs
inferred← citeshttps://doi.org/10.1145/3731302.3731320openalex-snapshot
Advanced: Functor Applications
inferred← citeshttps://doi.org/10.1145/3731302.3731321openalex-snapshot
Open Problems
inferred← citeshttps://doi.org/10.1145/3731302.3731322openalex-snapshot
Epilog
inferred← citeshttps://doi.org/10.1145/3731302.3731323openalex-snapshot
Common Symbols, Acronyms and Tool Names Used
inferred← citeshttps://doi.org/10.1145/3731302.3731324openalex-snapshot
Grammars and Parsing
inferred← citeshttps://doi.org/10.1145/3731302.3731325openalex-snapshot
4-Level MOFs and Bootstrapping Tools
inferred← citeshttps://doi.org/10.1145/3731302.3731326openalex-snapshot
Summing Quark Values
inferred← citeshttps://doi.org/10.1145/3731302.3731327openalex-snapshot
Microsoft IP and COM
inferred← citeshttps://doi.org/10.1145/3731302.3731328openalex-snapshot
Expression Problem Source Code
inferred← citeshttps://doi.org/10.1145/3731302.3731329openalex-snapshot
Eclipse Refactoring Preconditions
inferred← citeshttps://doi.org/10.1145/3731302.3731330openalex-snapshot
Polymorphism and Distributivity Properties of MDE Model Refactorings
inferred← citeshttps://doi.org/10.1145/3731302.3731331openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/3731302.3731332openalex-snapshot
Author’s Biography/Index
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017777openalex-snapshot
On Testing of Uniform Samplers
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25516openalex-snapshot
Learning Markov Random Fields for Combinatorial Structures via Sampling through Lovász Local Lemma
inferred← citeshttps://doi.org/10.2139/ssrn.5149686openalex-snapshot
Pragmatic Random Sampling of Kconfig-Based Systems: A Unified Approach
inferred← citeshttps://doi.org/10.24251/hicss.2022.263openalex-snapshot
A Rule-Learning Approach for Detecting Faults in Highly Configurable Software Systems from Uniform Random Samples
inferred← citeshttps://doi.org/10.24251/hicss.2023.194openalex-snapshot
Circuit Testing Based on Fuzzy Sampling with BDD Bases
inferred← citeshttps://doi.org/10.24963/ijcai.2019/163openalex-snapshot
GANAK: A Scalable Probabilistic Exact Model Counter
inferred← citeshttps://doi.org/10.24963/ijcai.2022/250openalex-snapshot
DPSampler: Exact Weighted Sampling Using Dynamic Programming
inferred← citeshttps://doi.org/10.24963/kr.2023/40openalex-snapshot
Knowledge Compilation and More with SharpSAT-TD
inferred← citeshttps://doi.org/10.4230/lipics.sat.2022.30openalex-snapshot
Proofs for Propositional Model Counting
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.