On the public citation graph

PaMiraXT: Parallel SAT Solving with Threads and Message Passing

https://doi.org/10.3233/sat190068

0 signed · 78 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/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/978-3-540-24605-3_22openalex-snapshot

Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms

inferredcites →https://doi.org/10.1007/978-3-540-24605-3_26openalex-snapshot

Effective Preprocessing with Hyper-Resolution and Equality Reduction

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-642-81952-0_16openalex-snapshot

A Machine Program for Theorem Proving

inferredcites →https://doi.org/10.1007/bf02127976openalex-snapshot

A fast parallel SAT-solver — efficient workload balancing

inferredcites →https://doi.org/10.1016/0167-8191(96)00024-5openalex-snapshot

A high-performance, portable implementation of the MPI message passing interface standard

inferredcites →https://doi.org/10.1016/j.entcs.2004.10.020openalex-snapshot

Parallel Multithreaded Satisfiability Solver: Design and Implementation

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.1016/s1571-0653(04)00321-xopenalex-snapshot

Parallelizing Satz Using Dynamic Workload Balancing

inferredcites →https://doi.org/10.1016/s1571-0653(04)00323-3openalex-snapshot

PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications

inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot

GRASP: a search algorithm for propositional satisfiability

inferredcites →https://doi.org/10.1109/aspdac.2007.358108openalex-snapshot

Multithreaded SAT Solving

inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot

Chaff: engineering an efficient SAT solver

inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot

BerkMin: A fast and robust 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/mtv.2005.17openalex-snapshot

PaMira - A Parallel SAT Solver with Knowledge Sharing

inferredcites →https://doi.org/10.1145/1048935.1050188openalex-snapshot

GridSAT

inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot

A Computing Procedure for Quantification Theory

inferredcites →https://doi.org/10.1145/337292.337611openalex-snapshot

Boolean satisfiability in electronic design automation

inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot

A machine program for theorem-proving

inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot

Chaff

inferredcites →https://doi.org/10.5555/777092.777196openalex-snapshot

Dynamic restart policies

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-3-030-80223-3_35openalex-snapshot

Scalable SAT Solving in the Cloud

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-319-24318-4_5openalex-snapshot

Laissez-Faire Caching for Parallel #SAT Solving

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-63516-3_1openalex-snapshot

Parallel Satisfiability

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_3openalex-snapshot

Parallel Maximum Satisfiability

inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_4openalex-snapshot

Parallel Solving of Quantified Boolean Formulas

inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot

Parallel Theorem Proving

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-10291-2_25openalex-snapshot

Partitioning Search Spaces of a Randomized Search

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-20364-0_9openalex-snapshot

Experiments in Parallel Constraint-Based Local Search

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-29011-4_1openalex-snapshot

A Tutorial on High Performance Computing Applied to Cryptanalysis

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-33558-7_52openalex-snapshot

A Hybrid Paradigm for Adaptive Parallel Search

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/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/s10723-010-9160-1openalex-snapshot

Parallel SAT Solving on Peer-to-Peer Desktop Grids

inferred← citeshttps://doi.org/10.1007/s10766-009-0124-7openalex-snapshot

Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability Analysis

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.1016/j.dam.2014.05.007openalex-snapshot

On the van der Waerden numbers w(2;3,t)

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.1109/candarw57323.2022.00080openalex-snapshot

Towards Massively Parallel GPU Assisted SAT

inferred← citeshttps://doi.org/10.1109/cluster.2016.20openalex-snapshot

Distributed Parallel #SAT Solving

inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547114openalex-snapshot

A new parallel architecture for QBF tools

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/ictai.2010.56openalex-snapshot

Improving Search Space Splitting for Parallel SAT Solving

inferred← citeshttps://doi.org/10.1109/ictai.2014.111openalex-snapshot

Communication in Massively-Parallel SAT Solving

inferred← citeshttps://doi.org/10.1109/ictai.2015.17openalex-snapshot

Using Parallel Singleton Arc Consistency to Enhance Constraint Solving

inferred← citeshttps://doi.org/10.1109/ictai.2016.0073openalex-snapshot

Non-Portfolio Approaches for Distributed Maximum Satisfiability

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/vlsi.design.2009.20openalex-snapshot

TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis

inferred← citeshttps://doi.org/10.1142/s0218194020500242openalex-snapshot

Concurrent Bug Finding Based on Bounded Model Checking

inferred← citeshttps://doi.org/10.1504/ijica.2018.10011774openalex-snapshot

Hybrid algorithms for 3-SAT optimisation using MapReduce on clouds

inferred← citeshttps://doi.org/10.1609/socs.v3i1.18233openalex-snapshot

Adaptive Parallelization for Constraint Satisfaction Search

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-398openalex-snapshot

Parallel QBF Solving with Advanced Knowledge Sharing

inferred← citeshttps://doi.org/10.3233/fi-2011-404openalex-snapshot

Partitioning Search Spaces of a Randomized Search

inferred← citeshttps://doi.org/10.4204/eptcs.14.5openalex-snapshot

Tarmo: A Framework for Parallelized Bounded Model Checking

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.48550/arxiv.1309.3187openalex-snapshot

Cache Performance Study of Portfolio-Based Parallel CDCL SAT Solvers

inferred← citeshttps://doi.org/10.70675/37ac3f0fzf87ez4642zab6ez000b386a7a0eopenalex-snapshot

Learning during search

inferred← citeshttps://doi.org/10.70675/cf0edb8dz0512z4aeez99adzaaa58c3e2721openalex-snapshot

Declarative Approaches for Mining Frequent Itemsets over Transactional Databases

inferred← citeshttps://doi.org/10.70675/d79e1ec2zb3ffz45b6z9d97za60d60da54f1openalex-snapshot

SAT en Parallèle

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.