On the public citation graph

Parallel state-space search for a first solution with consistent linear speedups

https://doi.org/10.1007/bf01379360
0 signed · 38 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.1002/chin.197352146openalex-snapshot
ChemInform Abstract: THE DISCOVERY OF ORGANIC SYNTHETIC ROUTES BY COMPUTER
inferredcites →https://doi.org/10.1007/3-540-51285-3_38openalex-snapshot
Pruning and scheduling speculative work in or-parallel Prolog
inferredcites →https://doi.org/10.1007/978-1-4612-3390-9_5openalex-snapshot
Parallel Problem Solving
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_7openalex-snapshot
Optimal Path-Finding Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00128177openalex-snapshot
OR parallel execution of Prolog programs with side effects
inferredcites →https://doi.org/10.1007/bf01389000openalex-snapshot
Parallel depth first search. Part I. Implementation
inferredcites →https://doi.org/10.1007/bf01389001openalex-snapshot
Parallel depth first search. Part II. Analysis
inferredcites →https://doi.org/10.1007/bf03037208openalex-snapshot
The Aurora or-parallel Prolog system
inferredcites →https://doi.org/10.1007/bfb0018367openalex-snapshot
Automatic test pattern generation on multiprocessors: a summary of results
inferredcites →https://doi.org/10.1016/0004-3702(84)90045-6openalex-snapshot
Planning routes through uncertain territory
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
inferredcites →https://doi.org/10.1109/12.9744openalex-snapshot
Concurrent access of priority queues
inferredcites →https://doi.org/10.1109/mc.1986.1663306openalex-snapshot
Parallel Symbolic Computing
inferredcites →https://doi.org/10.1109/mc.1987.1663350openalex-snapshot
Guest Editor's Introduction: New Computers for Artificial Intelligence Processing
inferredcites →https://doi.org/10.1109/mc.1987.1663360openalex-snapshot
Initial Performance of the DADO2 Prototype
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/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
inferredcites →https://doi.org/10.1145/362637.362651openalex-snapshot
Symbolic integration
inferredcites →https://doi.org/10.1145/63238.63249openalex-snapshot
Concurrent operations on priority queues
inferredcites →https://doi.org/10.1147/rd.314.0464openalex-snapshot
Efficient search techniques—An empirical study of the N-Queens Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470053928.ch1openalex-snapshot
Parallel Branch‐and‐Bound Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_22openalex-snapshot
Loop transformations for Prolog programs
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_14openalex-snapshot
An efficient implementation of parallel A*
inferred← citeshttps://doi.org/10.1007/bfb0018645openalex-snapshot
Prioritization in parallel symbolic computing
inferred← citeshttps://doi.org/10.1007/bfb0027123openalex-snapshot
Building a parallel branch and bound library
inferred← citeshttps://doi.org/10.1016/b978-0-12-372512-7.00020-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50014-2openalex-snapshot
A First Step Towards the Massively Parallel Game-Tree Search: a SIMD Approach
inferred← citeshttps://doi.org/10.1109/69.755612openalex-snapshot
State of the art in parallel search techniques for discrete optimization problems
inferred← citeshttps://doi.org/10.1109/dmcc.1990.556310openalex-snapshot
A Distributed and Adaptive Dynamic Load Balancing Scheme for Parallel Processing of Medium-Grain Tasks
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633162openalex-snapshot
Efficient Parallel Execution of IDA on Shared and Distributed Memory Multiprocessors
inferred← citeshttps://doi.org/10.1109/ipdps.2011.338openalex-snapshot
An Adaptive Framework for Large-Scale State Space Search
inferred← citeshttps://doi.org/10.1109/isps.2011.5898879openalex-snapshot
Using processor virtualization to load balancing distributed state space construction
inferred← citeshttps://doi.org/10.1109/spdp.1993.395556openalex-snapshot
Parallel bidirectional A* search on a symmetry multiprocessor
inferred← citeshttps://doi.org/10.1142/s0129626411000242openalex-snapshot
PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
inferred← citeshttps://doi.org/10.1613/jair.518openalex-snapshot
Adaptive Parallel Iterative Deepening Search
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.