On the public citation graph
ManySAT: a Parallel SAT Solver
0 signed · 305 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/jsco.1996.0030openalex-snapshot
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/11564751_41openalex-snapshot
Boosting Distributed Constraint Satisfaction
inferredcites →https://doi.org/10.1007/978-3-030-80223-3openalex-snapshot
Theory and Applications of Satisfiability Testing – SAT 2021
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-540-79719-7_3openalex-snapshot
A Generalized Framework for Conflict Analysis
inferredcites →https://doi.org/10.1007/978-3-540-79719-7_4openalex-snapshot
Adaptive Restart Strategies for Conflict Driven SAT Solvers
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_60openalex-snapshot
A Concurrent Portfolio Approach to SMT Solving
inferredcites →https://doi.org/10.1007/978-3-642-21434-9_10openalex-snapshot
Control-Based Clause Sharing in Parallel SAT Solving
inferredcites →https://doi.org/10.1007/bf02127976openalex-snapshot
A fast parallel SAT-solver — efficient workload balancing
inferredcites →https://doi.org/10.1007/bfb0095116openalex-snapshot
Improving backtrack search for SAT by means of redundancy
inferredcites →https://doi.org/10.1007/s10817-005-1970-7openalex-snapshot
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
inferredcites →https://doi.org/10.1016/0020-0190(93)90029-9openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferredcites →https://doi.org/10.1016/s0167-8191(03)00068-1openalex-snapshot
Parallel propositional satisfiability checking with distributed dynamic learning
inferredcites →https://doi.org/10.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/iccad.2001.968634openalex-snapshot
Efficient conflict driven learning in a Boolean satisfiability solver
inferredcites →https://doi.org/10.1109/istcs.1993.253477openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.3233/sat190016openalex-snapshot
March_dl: Adding Adaptive Heuristics and a New Branching Strategy
inferredcites →https://doi.org/10.3233/sat190063openalex-snapshot
PMSat: a parallel version of MiniSAT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1855openalex-snapshot
Targeting the Cell Broadband Engine for constraint‐based local search
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_13openalex-snapshot
Connections and Integration with SAT Solvers: A Survey and a Case Study in Computational Biology
inferred← citeshttps://doi.org/10.1007/978-1-4614-4769-6_10openalex-snapshot
Computing Policy Options
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_5openalex-snapshot
Reasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_8openalex-snapshot
Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_28openalex-snapshot
Black-Box Optimization in an Extended Search Space for SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-36592-9_57openalex-snapshot
SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-40921-0_1openalex-snapshot
Revised Version of Block Cipher CHAM
inferred← citeshttps://doi.org/10.1007/978-3-030-43680-3_6openalex-snapshot
Cooperative Parallel SAT Local Search with Path Relinking
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_10openalex-snapshot
Reproducible Efficient Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_2openalex-snapshot
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_9openalex-snapshot
Distributed Cube and Conquer with Paracooba
inferred← citeshttps://doi.org/10.1007/978-3-030-55754-6_13openalex-snapshot
On the Usefulness of Clause Strengthening in Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_52openalex-snapshot
A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-66515-9_11openalex-snapshot
Finding Effective SAT Partitionings Via Black-Box Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_35openalex-snapshot
Scalable SAT Solving in the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_21openalex-snapshot
GPU Acceleration of Bounded Model Checking with ParaFROST
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-09850-5_14openalex-snapshot
Shared SAT Solvers and SAT Memory in Distributed Business Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-12597-3_8openalex-snapshot
Decentralized Online Scheduling of Malleable NP-hard Jobs
inferred← citeshttps://doi.org/10.1007/978-3-031-20862-1_5openalex-snapshot
Diversification of Parallel Search of Portfolio SAT Solver by Search Similarity Index
inferred← citeshttps://doi.org/10.1007/978-3-031-21213-0_14openalex-snapshot
Diversifying a Parallel SAT Solver with Bayesian Moment Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_18openalex-snapshot
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-031-37989-5_7openalex-snapshot
Impact of Satisfiability Solvers on Logic Locking
inferred← citeshttps://doi.org/10.1007/978-3-031-44505-7_40openalex-snapshot
Unleashing the Potential of Restart by Detecting the Search Stagnation
inferred← citeshttps://doi.org/10.1007/978-3-031-71294-4_1openalex-snapshot
Parallel Assembly Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_3openalex-snapshot
D-Painless: A Framework for Distributed Portfolio SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-95973-8_13openalex-snapshot
Parallelising Lazy Clause Generation with Trail Sharing
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_9openalex-snapshot
Massively Parallel Bit-Precise Verification with Bitwuzla and Mallob
inferred← citeshttps://doi.org/10.1007/978-3-032-30494-0_9openalex-snapshot
Efficient Satisfiability-Based Approach for Mining Partially-Ordered Sequential Rules
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_5openalex-snapshot
Mallob: Scalable Automated Reasoning on Demand
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_27openalex-snapshot
Parallel Depth-Bounded Discrepancy Search
inferred← citeshttps://doi.org/10.1007/978-3-319-09099-3_10openalex-snapshot
JTACO: Test Execution for Faster Bounded Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_14openalex-snapshot
Community Branching for Parallel Portfolio SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_15openalex-snapshot
Lazy Clause Exchange Policy for Parallel SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_11openalex-snapshot
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_9openalex-snapshot
Propositional SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_22openalex-snapshot
Adaptive Concretization for Parallel Program Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_12openalex-snapshot
HordeSat: A Massively Parallel Portfolio SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_5openalex-snapshot
Laissez-Faire Caching for Parallel #SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_4openalex-snapshot
Exact Bounds for Distributed Graph Colouring
inferred← citeshttps://doi.org/10.1007/978-3-319-26287-1_14openalex-snapshot
Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_21openalex-snapshot
Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
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-43174-1_6openalex-snapshot
Improvements to the Equivalence Checking of Reversible Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_25openalex-snapshot
Parallel Strategies Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_3openalex-snapshot
An Adaptive Parallel SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_27openalex-snapshot
Clause Sharing and Partitioning for Cloud-Based SMT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-50349-3_21openalex-snapshot
Dynamic Strategy to Diversify Search Using a History Map in Parallel Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_11openalex-snapshot
Parallel A* for State-Space Search
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_15openalex-snapshot
Selection and Configuration of Parallel Portfolios
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_16openalex-snapshot
An Application of Parallel Satisfiability Solving to the Verification of Complex Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_2openalex-snapshot
Cube-and-Conquer for Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_3openalex-snapshot
Parallel Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_5openalex-snapshot
Parallel Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_9openalex-snapshot
Parallel Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_14openalex-snapshot
A Distributed Version of Syrup
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_15openalex-snapshot
PaInleSS: A Framework for Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_16openalex-snapshot
A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_6openalex-snapshot
Machine Learning-Based Restart Policy for CDCL SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_37openalex-snapshot
A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_60openalex-snapshot
A Concurrent Portfolio Approach to SMT Solving
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-14186-7_6openalex-snapshot
Automated Testing and Debugging of SAT and QBF Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-15211-5_28openalex-snapshot
Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture
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-20364-0_9openalex-snapshot
Experiments in Parallel Constraint-Based Local Search
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-21581-0_8openalex-snapshot
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
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-25566-3_4openalex-snapshot
Improving Parallel Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_16openalex-snapshot
Revisiting Clause Exchange in Parallel SAT Solving
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-31612-8_38openalex-snapshot
SatX10: A Scalable Plug&Play Parallel SAT Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_45openalex-snapshot
Towards Massively Parallel Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_38openalex-snapshot
Parallel SAT Solver Selection and Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_52openalex-snapshot
A Hybrid Paradigm for Adaptive Parallel Search
inferred← citeshttps://doi.org/10.1007/978-3-642-33675-1_38openalex-snapshot
Parallel NuSMV: A NuSMV Extension for the Verification of Complex Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34188-5_8openalex-snapshot
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_14openalex-snapshot
Quantifying Homogeneity of Instance Sets for Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_23openalex-snapshot
Learning Algorithm Portfolios for Parallel Execution
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_49openalex-snapshot
Counter Implication Restart for 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-37198-1_14openalex-snapshot
From Sequential to Parallel Local Search for SAT
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-39799-8_3openalex-snapshot
Multi-solver Support in Symbolic Execution
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_6openalex-snapshot
Parallel Discrepancy-Based Search
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_17openalex-snapshot
Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_25openalex-snapshot
Portfolio with Block Branching for Parallel SAT Solvers
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/978-981-92-3015-0_5openalex-snapshot
Evaluating SAT Accelerations for Cryptanalytic Trail Search
inferred← citeshttps://doi.org/10.1007/s10288-011-0191-7openalex-snapshot
Learning from conflicts in propositional satisfiability
inferred← citeshttps://doi.org/10.1007/s10462-016-9495-5openalex-snapshot
Parallelizing simplex within SMT solvers
inferred← citeshttps://doi.org/10.1007/s10479-015-2028-9openalex-snapshot
What we can learn from conflicts in propositional satisfiability
inferred← citeshttps://doi.org/10.1007/s10601-012-9121-3openalex-snapshot
An overview of parallel SAT solving
inferred← citeshttps://doi.org/10.1007/s10601-014-9168-4openalex-snapshot
Large-scale parallelism for constraint-based local search: the costas array case study
inferred← citeshttps://doi.org/10.1007/s10601-015-9207-9openalex-snapshot
Parallel search for maximum satisfiability
inferred← citeshttps://doi.org/10.1007/s10601-022-09339-8openalex-snapshot
Towards better heuristics for solving bounded model checking problems
inferred← citeshttps://doi.org/10.1007/s10703-017-0269-8openalex-snapshot
An empirical study of adaptive concretization for parallel program synthesis
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/s10732-010-9134-2openalex-snapshot
Boosting distributed constraint satisfaction
inferred← citeshttps://doi.org/10.1007/s10817-025-09725-wopenalex-snapshot
Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers
inferred← citeshttps://doi.org/10.1007/s11227-016-1712-0openalex-snapshot
Parallelized mining of domain knowledge on GPGPU and Xeon Phi clusters
inferred← citeshttps://doi.org/10.1007/s40012-015-0070-zopenalex-snapshot
Recursive optimization on converting CNF to DNF using grid computing
inferred← citeshttps://doi.org/10.1016/j.artint.2012.10.007openalex-snapshot
Evaluation of a simple, scalable, parallel best-first search strategy
inferred← citeshttps://doi.org/10.1016/j.artint.2016.05.004openalex-snapshot
Automatic construction of parallel portfolios via algorithm configuration
inferred← citeshttps://doi.org/10.1016/j.artint.2018.01.001openalex-snapshot
Parallelizing SMT solving: Lazy decomposition and conciliation
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104311openalex-snapshot
ICCMA 2023: 5th International Competition on Computational Models of Argumentation
inferred← citeshttps://doi.org/10.1016/j.asej.2026.104160openalex-snapshot
An enhanced discrete hopfield neural network framework for random boolean satisfiability optimization viaK-medoids clustering and evolutionary learning
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106069openalex-snapshot
Grid based clustering for satisfiability solving
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.03.004openalex-snapshot
Satisfiability modulo theories for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.039openalex-snapshot
Bose–Einstein condensation in satisfiability problems
inferred← citeshttps://doi.org/10.1016/j.jisa.2025.104203openalex-snapshot
Parallel SAT framework to find clustering of differential characteristics and its applications
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.07.002openalex-snapshot
An approach to multicore parallelism using functional programming: A case study based on Presburger Arithmetic
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.014openalex-snapshot
Hardware accelerated SAT solvers—A survey
inferred← citeshttps://doi.org/10.1016/j.microrel.2022.114551openalex-snapshot
Power-aware test scheduling framework for IEEE 1687 multi-power domain networks using formal techniques
inferred← citeshttps://doi.org/10.1016/j.procs.2017.05.140openalex-snapshot
Parallel Learning Portfolio-based solvers
inferred← citeshttps://doi.org/10.1016/j.procs.2017.11.163openalex-snapshot
Implementation of Concurrent Parallelization of Branch-and-bound algorithm in Everest Distributed Environment
inferred← citeshttps://doi.org/10.1017/s1471068412000166openalex-snapshot
Multi-threaded ASP solving with clasp
inferred← citeshttps://doi.org/10.1017/s1471068418000340openalex-snapshot
A review of literature on parallel constraint solving
inferred← citeshttps://doi.org/10.1038/s41586-023-06004-9openalex-snapshot
Faster sorting algorithms discovered using deep reinforcement learning
inferred← citeshttps://doi.org/10.1080/0952813x.2014.954274openalex-snapshot
CUD@SAT: SAT solving on GPUs
inferred← citeshttps://doi.org/10.1088/1367-2630/ada572openalex-snapshot
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
inferred← citeshttps://doi.org/10.1103/physrevresearch.5.023151openalex-snapshot
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
inferred← citeshttps://doi.org/10.1108/dta-07-2018-0068openalex-snapshot
Multidimensional appropriate clustering and DBSCAN for SAT solving
inferred← citeshttps://doi.org/10.1109/access.2020.2999382openalex-snapshot
An Effective SAT Solver Utilizing ACO Based on Heterogenous Systems
inferred← citeshttps://doi.org/10.1109/access.2020.3038228openalex-snapshot
When the Decomposition Meets the Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1109/access.2021.3120597openalex-snapshot
Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving
inferred← citeshttps://doi.org/10.1109/access.2023.3311898openalex-snapshot
Validity of Differential Characteristics of ARX Block Ciphers
inferred← citeshttps://doi.org/10.1109/aiccsa.2015.7507151openalex-snapshot
Parallel SAT based closed frequent itemsets enumeration
inferred← citeshttps://doi.org/10.1109/apccas67402.2025.11377204openalex-snapshot
Experimental Analysis of Quantum Annealing for Satisfiability Problems
inferred← citeshttps://doi.org/10.1109/ase.2013.6693075openalex-snapshot
Ranger: Parallel analysis of alloy models by range partitioning
inferred← citeshttps://doi.org/10.1109/candar.2015.75openalex-snapshot
An Efficient SAT Solving Algorithm Using Pseudo-Conflict Learning and Heterogeneous Computing
inferred← citeshttps://doi.org/10.1109/candar.2016.0087openalex-snapshot
How to Speed Up CUDA-WSat-PcL by 5x
inferred← citeshttps://doi.org/10.1109/candarw57323.2022.00080openalex-snapshot
Towards Massively Parallel GPU Assisted SAT
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304144openalex-snapshot
Distributedly Solving Boolean Equations over Networks
inferred← citeshttps://doi.org/10.1109/cloudcom.2011.11openalex-snapshot
Can Cloud Computing Be Used for Planning? An Initial Study
inferred← citeshttps://doi.org/10.1109/dac.2018.8465888openalex-snapshot
SAT Based Exact Synthesis using DAG Topology Families
inferred← citeshttps://doi.org/10.1109/dsd51259.2020.00016openalex-snapshot
Revisiting Explicit Enumeration for Exact Synthesis
inferred← citeshttps://doi.org/10.1109/get.2016.7916766openalex-snapshot
Neuro Fuzzy intelligent e-Learning systems
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408459openalex-snapshot
A PN-Free Digital 3-SAT Accelerator Using Crossbar Architecture and Frequency-Controlled Counters
inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547116openalex-snapshot
3-SAT on CUDA: Towards a massively parallel SAT solver
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/icact.2013.6710522openalex-snapshot
High dimension CNF to DNF conversion using grid computing
inferred← citeshttps://doi.org/10.1109/iccad.2013.6691124openalex-snapshot
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers
inferred← citeshttps://doi.org/10.1109/iccd.2010.5647645openalex-snapshot
EQUIPE: Parallel equivalence checking with GP-GPUs
inferred← citeshttps://doi.org/10.1109/icces.2015.7393031openalex-snapshot
On the parallelization of SAT solvers
inferred← citeshttps://doi.org/10.1109/icices.2014.7033875openalex-snapshot
Overview of sequential and parallel 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/icraie.2014.6909117openalex-snapshot
High dimension CNF to DNF conversion using grid computing in parallel
inferred← citeshttps://doi.org/10.1109/icse48619.2023.00184openalex-snapshot
Sibyl: Improving Software Engineering Tools with SMT Selection
inferred← citeshttps://doi.org/10.1109/ictai.2009.63openalex-snapshot
Toward Easy Parallel SAT Solving
inferred← citeshttps://doi.org/10.1109/ictai.2010.46openalex-snapshot
A Parallel Solving Algorithm for Quantified Constraints Problems
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.2011.54openalex-snapshot
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/ictai.2012.17openalex-snapshot
Massively Parallel Local Search for SAT
inferred← citeshttps://doi.org/10.1109/ictai.2014.110openalex-snapshot
Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving
inferred← citeshttps://doi.org/10.1109/ictai.2014.112openalex-snapshot
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied
inferred← citeshttps://doi.org/10.1109/ictai.2016.0150openalex-snapshot
Looking Inside Literal Blocks: Towards Mining More Promising Learnt Clauses in SAT Solving
inferred← citeshttps://doi.org/10.1109/ictai.2019.00018openalex-snapshot
Memory Efficient Parallel SAT Solving with Inprocessing
inferred← citeshttps://doi.org/10.1109/iintec.2017.8325923openalex-snapshot
An optimal scheduling algorithm for data parallel hardware architectures
inferred← citeshttps://doi.org/10.1109/ipdps.2011.357openalex-snapshot
Communication in Parallel Algorithms for Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1109/iscas48785.2022.9937527openalex-snapshot
Topology-Based Exact Synthesis for Majority Inverter Graph
inferred← citeshttps://doi.org/10.1109/iske.2017.8258783openalex-snapshot
Parallel hybrid genetic algorithm for sat problems based on OpenMP
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00106openalex-snapshot
Parallel Stochastic Portfolio Search for Constraint Solving
inferred← citeshttps://doi.org/10.1109/pdmc-hibi.2010.8openalex-snapshot
Parallel SAT solving [Invited paper abstract]
inferred← citeshttps://doi.org/10.1109/pdp.2014.92openalex-snapshot
An Effective Distributed D&C Approach for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1109/pdp.2017.70openalex-snapshot
Parallel Satisfiability Solver Based on Hybrid Partitioning Method
inferred← citeshttps://doi.org/10.1109/rtas.2019.00019openalex-snapshot
Bundled Scheduling of Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/sies.2016.7509415openalex-snapshot
Computing optimal communication schedules for time-triggered networks using an SMT solver
inferred← citeshttps://doi.org/10.1109/smc53654.2022.9945151openalex-snapshot
Portfolio Selection for SAT Instances
inferred← citeshttps://doi.org/10.1109/tac.2023.3241237openalex-snapshot
Distributed Algorithms for Boolean Equations Over Networks
inferred← citeshttps://doi.org/10.1109/tcad.2019.2897703openalex-snapshot
SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism
inferred← citeshttps://doi.org/10.1109/tcad.2019.2946254openalex-snapshot
Parallel Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/te.2014.2318678openalex-snapshot
ReAct!: An Interactive Educational Tool for AI Planning for Robotics
inferred← citeshttps://doi.org/10.1109/tse.2014.2331073openalex-snapshot
A Scalable Approach to Exact Model and Commonality Counting for Extended Feature Models
inferred← citeshttps://doi.org/10.1142/s0218213015500050openalex-snapshot
Deterministic Parallel MaxSAT Solving
inferred← citeshttps://doi.org/10.1142/s0218213018500331openalex-snapshot
Revisiting the Learned Clauses Database Reduction Strategies
inferred← citeshttps://doi.org/10.1145/1787275.1787325openalex-snapshot
Variant-based competitive parallel execution of sequential programs
inferred← citeshttps://doi.org/10.1145/1941553.1941558openalex-snapshot
Programming the memory hierarchy revisited
inferred← citeshttps://doi.org/10.1145/2038037.1941558openalex-snapshot
Programming the memory hierarchy revisited
inferred← citeshttps://doi.org/10.1145/2380445.2380480openalex-snapshot
Efficient self-learning techniques for SAT-based test generation
inferred← citeshttps://doi.org/10.1145/2491477.2491480openalex-snapshot
Thread-based multi-engine model checking for multicore platforms
inferred← citeshttps://doi.org/10.1145/2556624.2556645openalex-snapshot
Towards assessing the complexity of object migration in dynamic, feature-oriented software product lines
showing the first 200 of 277 · page through all 277
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.