On the public citation graph
An Adaptive Framework for Large-Scale State Space Search
0 signed · 31 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/jpdc.1996.0107openalex-snapshot
Cilk: An Efficient Multithreaded Runtime System
inferredcites →https://doi.org/10.1007/3-540-50517-2_79openalex-snapshot
Superlinear speedup in parallel state-space search
inferredcites →https://doi.org/10.1007/978-3-540-72521-3_18openalex-snapshot
UTS: An Unbalanced Tree Search Benchmark
inferredcites →https://doi.org/10.1007/bf01379360openalex-snapshot
Parallel state-space search for a first solution with consistent linear speedups
inferredcites →https://doi.org/10.1007/bfb0018645openalex-snapshot
Prioritization in parallel symbolic computing
inferredcites →https://doi.org/10.1016/0020-0190(90)90156-ropenalex-snapshot
An almost perfect heuristic for the N nonattacking queens problem
inferredcites →https://doi.org/10.1016/0743-1066(91)80003-vopenalex-snapshot
And-parallel execution of logic programs on a shared-memory multiprocessor
inferredcites →https://doi.org/10.1016/0743-1066(91)90009-eopenalex-snapshot
The reduce-or process model for parallel execution of logic programs
inferredcites →https://doi.org/10.1109/52.120605openalex-snapshot
Unidirectional and bidirectional search algorithms
inferredcites →https://doi.org/10.1109/69.755612openalex-snapshot
State of the art in parallel search techniques for discrete optimization problems
inferredcites →https://doi.org/10.1109/ipps.1993.262887openalex-snapshot
A load balancing strategy for prioritized execution of tasks
inferredcites →https://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1145/174130.174145openalex-snapshot
Randomized parallel algorithms for backtrack search and branch-and-bound computation
inferredcites →https://doi.org/10.1145/181014.192325openalex-snapshot
Studying overheads in massively parallel MIN/MAX-tree evaluation
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferredcites →https://doi.org/10.1145/99163.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
inferredcites →https://doi.org/10.14236/ewic/fp1995.13openalex-snapshot
On the Granularity of Divide-and-Conquer Parallelism
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.7955openalex-snapshot
An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_16openalex-snapshot
Dynamic Distributed Scheduling Algorithm for State Space Search
inferred← citeshttps://doi.org/10.1007/s11227-023-05565-wopenalex-snapshot
Efficient Brute-force state space search for Yin-Yang puzzle
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.07.006openalex-snapshot
On scalable parallel recursive backtracking
inferred← citeshttps://doi.org/10.1016/j.parco.2023.103024openalex-snapshot
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms
inferred← citeshttps://doi.org/10.1109/cluster.2015.119openalex-snapshot
The Performance Implication of Task Size for Applications on the HPX Runtime System
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.232openalex-snapshot
High Performance Adaptive Distributed Scheduling Algorithm
inferred← citeshttps://doi.org/10.1109/sbac-pad.2012.42openalex-snapshot
Parallelizing Information Set Generation for Game Tree Search Applications
inferred← citeshttps://doi.org/10.1109/sc.2014.75openalex-snapshot
Optimizing Data Locality for Fork/Join Programs Using Constrained Work Stealing
inferred← citeshttps://doi.org/10.1145/2503210.2503284openalex-snapshot
A distributed dynamic load balancer for iterative applications
inferred← citeshttps://doi.org/10.48550/arxiv.1312.7626openalex-snapshot
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking
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.