On the public citation graph
A fast parallel SAT-solver — efficient workload balancing
0 signed · 123 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1996.0016openalex-snapshot
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
inferredcites →https://doi.org/10.1007/3-540-61680-2_44openalex-snapshot
Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-1-4899-5327-8_25openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/bfb0026309openalex-snapshot
Is average superlinear speedup possible?
inferredcites →https://doi.org/10.1016/0166-218x(85)90050-2openalex-snapshot
Solving satisfiability in less than 2n steps
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1137/0220069openalex-snapshot
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1996.0030openalex-snapshot
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
inferred← citeshttps://doi.org/10.1007/11814948_12openalex-snapshot
A Complete Random Jump Strategy with Guiding Paths
inferred← citeshttps://doi.org/10.1007/11814948_39openalex-snapshot
A Distribution Method for Solving SAT in Grids
inferred← citeshttps://doi.org/10.1007/3-540-45683-x_14openalex-snapshot
Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_27openalex-snapshot
QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_5openalex-snapshot
Asynchronous Random Polling Dynamic Load Balancing
inferred← citeshttps://doi.org/10.1007/978-1-4020-5571-3_11openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1007/978-1-4419-0944-2openalex-snapshot
Hardware Acceleration of EDA Algorithms: Custom ICs, FPGAs and GPUs
inferred← citeshttps://doi.org/10.1007/978-1-4419-0944-2_6openalex-snapshot
Accelerating Boolean Satisfiability on a Graphics Processing Unit
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_2openalex-snapshot
Approximate Algorithms and Heuristics for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-08974-9_50openalex-snapshot
A Parallel Declarative Framework for Mining High Utility Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-031-66064-1_1openalex-snapshot
Picky CDCL: SMT-Solving with Flexible Literal Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-23404-5_16openalex-snapshot
Parallel SAT-Based Parameterised Three-Valued Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_27openalex-snapshot
Search-Space Partitioning for Parallelizing SMT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_12openalex-snapshot
DPLL: The Core of Modern Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_3openalex-snapshot
Parallel Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_35openalex-snapshot
Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-30176-9_8openalex-snapshot
Parallel SAT Solving with Microcontrollers
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_28openalex-snapshot
SAT-Based Cooperative Planning: A Proposal
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_4openalex-snapshot
SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_30openalex-snapshot
Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_21openalex-snapshot
Parallel SAT Solving in Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_16openalex-snapshot
From Idempotent Generalized Boolean Assignments to Multi-bit Search
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_11openalex-snapshot
Strategies for Solving SAT in Grids by Randomized Search
inferred← citeshttps://doi.org/10.1007/978-3-540-85776-1_21openalex-snapshot
Incorporating Learning in Grid-Based Randomized SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-03251-6_4openalex-snapshot
Challenges in Constraint-Based Analysis of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-10291-2_25openalex-snapshot
Partitioning Search Spaces of a Randomized Search
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_22openalex-snapshot
Diversification and Intensification in Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_27openalex-snapshot
Partitioning SAT Instances for Distributed Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_10openalex-snapshot
Control-Based Clause Sharing in Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_30openalex-snapshot
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_17openalex-snapshot
Designing Scalable Parallel SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_10openalex-snapshot
Asynchronous Multi-core Incremental SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_10openalex-snapshot
Concurrent Clause Strengthening
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_4openalex-snapshot
Soundness of Inprocessing in Clause Sharing SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-41482-4_3openalex-snapshot
Parallel Tree Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_6openalex-snapshot
Sharing Information in Parallel Search with Search Space Partitioning
inferred← citeshttps://doi.org/10.1007/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/s10009-005-0203-zopenalex-snapshot
Efficient distributed SAT and SAT-based distributed Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/s10462-018-9628-0openalex-snapshot
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
inferred← citeshttps://doi.org/10.1007/s10601-012-9121-3openalex-snapshot
An overview of parallel SAT solving
inferred← citeshttps://doi.org/10.1007/s10703-021-00385-1openalex-snapshot
Distributed bounded model checking
inferred← citeshttps://doi.org/10.1007/s10723-010-9160-1openalex-snapshot
Parallel SAT Solving on Peer-to-Peer Desktop Grids
inferred← citeshttps://doi.org/10.1007/s10817-005-1970-7openalex-snapshot
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
inferred← citeshttps://doi.org/10.1007/s10817-005-9002-1openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.015openalex-snapshot
A competitive and cooperative approach to propositional satisfiability
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.031openalex-snapshot
Linear CNF formulas and satisfiability
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.030openalex-snapshot
XSAT and NAE-SAT of linear CNF classes
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.10.020openalex-snapshot
Parallel Multithreaded Satisfiability Solver: Design and Implementation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104816openalex-snapshot
Read/write fence-free work-stealing with multiplicity
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00373-9openalex-snapshot
Backjumping for Quantified Boolean Logic satisfiability
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00249-3openalex-snapshot
Solving satisfiability problems using elliptic approximations – effective branching rules
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00068-1openalex-snapshot
Parallel propositional satisfiability checking with distributed dynamic learning
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00321-xopenalex-snapshot
Parallelizing Satz Using Dynamic Workload Balancing
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00323-3openalex-snapshot
PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1017/s147106840200162xopenalex-snapshot
Learning in a compiler for MINSAT algorithms
inferred← citeshttps://doi.org/10.1023/a:1006310219368openalex-snapshot
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
inferred← citeshttps://doi.org/10.1023/a:1018946526109openalex-snapshot
Parallel cooperative propositional theorem proving
inferred← citeshttps://doi.org/10.1023/a:1021200130191openalex-snapshot
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights
inferred← citeshttps://doi.org/10.1023/a:1021264516079openalex-snapshot
An Overview of Backtrack Search Satisfiability Algorithms
inferred← citeshttps://doi.org/10.1080/0952813x.2014.954274openalex-snapshot
CUD@SAT: SAT solving on GPUs
inferred← citeshttps://doi.org/10.1093/comjnl/45.5.561openalex-snapshot
Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
inferred← citeshttps://doi.org/10.1093/logcom/exp002openalex-snapshot
Parallel SAT Solving in Bounded Model Checking
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/aiccsa.2015.7507151openalex-snapshot
Parallel SAT based closed frequent itemsets enumeration
inferred← citeshttps://doi.org/10.1109/ccgrid.2005.1558680openalex-snapshot
ZetaSAT - Boolean SATisfiability solving on Desktop Grids
inferred← citeshttps://doi.org/10.1109/cicc.2000.852637openalex-snapshot
Parallel and scalable architecture for solving SATisfiability on reconfigurable FPGA
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133195openalex-snapshot
Property-driven Parallel Symbolic Model Checking of LTL
inferred← citeshttps://doi.org/10.1109/ecbs.2007.40openalex-snapshot
Exploring Clause Symmetry in a Distributed Bounded Model Checking Algorithm
inferred← citeshttps://doi.org/10.1109/ecbs.2009.26openalex-snapshot
Distributed BMC: A Depth-First Approach to Explore Clause Symmetry
inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547119openalex-snapshot
Portfolio-based Parallel SAT solving
inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547121openalex-snapshot
Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids
inferred← citeshttps://doi.org/10.1109/icces.2015.7393031openalex-snapshot
On the parallelization of SAT solvers
inferred← citeshttps://doi.org/10.1109/icpp.2013.20openalex-snapshot
A Dynamic Moldable Job Scheduling Based Parallel SAT Solver
inferred← citeshttps://doi.org/10.1109/icppw.2017.35openalex-snapshot
Programming Model to Develop Supercomputer Combinatorial Solvers
inferred← citeshttps://doi.org/10.1109/ictai.2010.56openalex-snapshot
Improving Search Space Splitting for Parallel SAT Solving
inferred← citeshttps://doi.org/10.1109/ictai.2011.19openalex-snapshot
Dynamic Polarity Adjustment in a Parallel SAT Solver
inferred← citeshttps://doi.org/10.1109/ictai.2016.0073openalex-snapshot
Non-Portfolio Approaches for Distributed Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/isvlsi.2005.47openalex-snapshot
Lemma exchange in a microcontroller based parallel SAT solver
inferred← citeshttps://doi.org/10.1109/mtv.2004.19openalex-snapshot
PICHAFF² — A Hierarchical Parallel SAT Solver
inferred← citeshttps://doi.org/10.1109/mtv.2005.17openalex-snapshot
PaMira - A Parallel SAT Solver with Knowledge Sharing
inferred← citeshttps://doi.org/10.1109/pdmc-hibi.2010.8openalex-snapshot
Parallel SAT solving [Invited paper abstract]
inferred← citeshttps://doi.org/10.1109/pdp.2017.70openalex-snapshot
Parallel Satisfiability Solver Based on Hybrid Partitioning Method
inferred← citeshttps://doi.org/10.1109/tkde.2018.2867504openalex-snapshot
Fog-enabled Event Processing Based on IoT Resource Models
inferred← citeshttps://doi.org/10.1142/s0218213017500117openalex-snapshot
Guiding SAT Solving by Formula Partitioning
inferred← citeshttps://doi.org/10.1145/1670412.1670417openalex-snapshot
Expressive description logics via SAT
inferred← citeshttps://doi.org/10.1145/3491210openalex-snapshot
On the Structure of the Boolean Satisfiability Problem: A Survey
inferred← citeshttps://doi.org/10.1613/jair.1.15827openalex-snapshot
MallobSat: Scalable SAT Solving by Clause Sharing
inferred← citeshttps://doi.org/10.18419/opus-2816openalex-snapshot
Skalierbare parallele Verfahren zur Boolean Constraint Propagation auf Multicore-Architekturen
inferred← citeshttps://doi.org/10.21941/kcss/2017/03openalex-snapshot
SAT and CP - Parallelisation and Applications
inferred← citeshttps://doi.org/10.21941/kcss/2017/3openalex-snapshot
SAT and CP - Parallelisation and Applications
inferred← citeshttps://doi.org/10.25209/2079-3316-2016-7-1-99-115openalex-snapshot
Non-paradoxical logical consequence and the problem of solving ML-equations
inferred← citeshttps://doi.org/10.3233/fi-2011-404openalex-snapshot
Partitioning Search Spaces of a Randomized Search
inferred← citeshttps://doi.org/10.3233/sat190040openalex-snapshot
Parallel SAT Solving using Bit-level Operations1
inferred← citeshttps://doi.org/10.3233/sat190068openalex-snapshot
PaMiraXT: Parallel SAT Solving with Threads and Message Passing
inferred← citeshttps://doi.org/10.3233/sat190069openalex-snapshot
Incorporating Clause Learning in Grid-Based Randomized SAT Solving1
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3563openalex-snapshot
Parallel algorithms for SAT in application to inversion problems of some discrete functions
inferred← citeshttps://doi.org/10.70675/8a8c1180zceedz4ab6z895fz48d59e9d97b1openalex-snapshot
Contributions aux approches par contraintes pour la fouille de données
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
inferred← citeshttps://doi.org/10.70675/f5b888c4zb2b8z4af0zb2ecz225ba5dbb791openalex-snapshot
Combinatorics in algebraic and logical cryptanalysis
inferred← citeshttps://doi.org/10.7494/csci.2012.13.1.25openalex-snapshot
Using BOINC desktop grid to solve large scale SAT problems
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.