On the public citation graph

Best-First Heuristic Search for Multicore Machines

0 signed · 58 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/jpdc.1995.1036openalex-snapshot
PRA*: Massively Parallel Heuristic Search
inferredcites →https://doi.org/10.1007/3-540-45414-4_21openalex-snapshot
A Pragmatic Implementation of Non-blocking Linked-lists
inferredcites →https://doi.org/10.1007/3-540-48153-2_6openalex-snapshot
Model Checking TLA+ Specifications
inferredcites →https://doi.org/10.1007/978-1-4612-3390-9_2openalex-snapshot
Parallel Heuristic Search: Two Approaches
inferredcites →https://doi.org/10.1016/j.artint.2005.12.002openalex-snapshot
Breadth-first heuristic search
inferredcites →https://doi.org/10.1023/a:1024452529781openalex-snapshot
KBFS: K-Best-First Search
inferredcites →https://doi.org/10.1109/icpp.2006.9openalex-snapshot
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
inferredcites →https://doi.org/10.1109/ipdps.2003.1213189openalex-snapshot
Fast and lock-free concurrent priority queues for multi-thread systems
inferredcites →https://doi.org/10.1109/tse.2007.70724openalex-snapshot
The Design of a Multicore Extension of the SPIN Model Checker
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13350openalex-snapshot
Scalable, Parallel Best-First Search for Optimal Sequential Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13375openalex-snapshot
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
inferredcites →https://doi.org/10.1609/icaps.v21i1.13479openalex-snapshot
Dynamic State-Space Partitioning in External-Memory Graph Search
inferredcites →https://doi.org/10.1609/socs.v1i1.18167openalex-snapshot
GPU Exploration of Two-Player Games with Perfect Hash Functions
inferredcites →https://doi.org/10.1613/jair.2096openalex-snapshot
Anytime Heuristic Search

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119619727.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_10openalex-snapshot
Planning in Artificial Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-319-14313-2_21openalex-snapshot
Exploiting Hidden Non-uniformity of Uniform Memory Access on Manycore CPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_6openalex-snapshot
External-Memory State Space Search
inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_32openalex-snapshot
Improving Hash Distributed A* for Shared Memory Architectures Using Abstraction
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-65482-9_62openalex-snapshot
A Hybrid Parallel Search Algorithm for Solving Combinatorial Optimization Problems on Multicore Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-16138-4_26openalex-snapshot
A Survey and Classification of A* Based Best-First Heuristic Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-28786-2_11openalex-snapshot
Towards Parallel Real-Time Trajectory Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-31759-0_13openalex-snapshot
Parallel Model Checking Using Abstraction
inferred← citeshttps://doi.org/10.1007/s10514-015-9440-5openalex-snapshot
Learning to plan for constrained manipulation from demonstrations
inferred← citeshttps://doi.org/10.1007/s11047-015-9490-9openalex-snapshot
Anytime pack search
inferred← citeshttps://doi.org/10.1007/s11227-021-03986-zopenalex-snapshot
Parallel best-first search algorithms for planning problems on multi-core processors
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.2015.01.004openalex-snapshot
The deterministic part of the seventh International Planning Competition
inferred← citeshttps://doi.org/10.1016/j.future.2021.04.011openalex-snapshot
Efficient parallel A* search on multi-GPU system
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2014.12.026openalex-snapshot
Training set size, scale, and features in Geographic Object-Based Image Analysis of very high resolution unmanned aerial vehicle imagery
inferred← citeshttps://doi.org/10.1016/j.sysarc.2024.103239openalex-snapshot
GPU implementation of the Frenet Path Planner for embedded autonomous systems: A case study in the F1tenth scenario
inferred← citeshttps://doi.org/10.1109/access.2023.3346898openalex-snapshot
K-Focal Search for Slow Learned Heuristics
inferred← citeshttps://doi.org/10.1109/itnec.2019.8729438openalex-snapshot
Dynamic Path Planning Based on Improved D* Algorithms of Gaode Map
inferred← citeshttps://doi.org/10.1109/lra.2022.3157544openalex-snapshot
MPLP: Massively Parallelized Lazy Planning
inferred← citeshttps://doi.org/10.1109/mcsoc67473.2025.00019openalex-snapshot
Parallel Heuristic Semantic Walk on Large Knowledge Graphs with Text Embeddings
inferred← citeshttps://doi.org/10.1109/tbme.2015.2477688openalex-snapshot
Fusion of Quantitative Image and Genomic Biomarkers to Improve Prognosis Assessment of Early Stage Lung Cancer Patients
inferred← citeshttps://doi.org/10.1109/tpds.2015.2419651openalex-snapshot
A Lock-Free Priority Queue Design Based on Multi-Dimensional Linked Lists
inferred← citeshttps://doi.org/10.1118/1.4948499openalex-snapshot
Improving lung cancer prognosis assessment by incorporating synthetic minority oversampling technique and score fusion method
inferred← citeshttps://doi.org/10.1145/3570326openalex-snapshot
Scheduling of Resource Allocation Systems with Timed Petri Nets: A Survey
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8192openalex-snapshot
Planning Under Time Pressure
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10065openalex-snapshot
Abstract Zobrist Hashing: An Efficient Work Distribution Method for Parallel Best-First Search
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30062openalex-snapshot
Parallel Beam Search Algorithms for Domain-Independent Dynamic Programming
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13350openalex-snapshot
Scalable, Parallel Best-First Search for Optimal Sequential Planning
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13375openalex-snapshot
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13464openalex-snapshot
Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18163openalex-snapshot
On the Scaling Behavior of HDA*
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18165openalex-snapshot
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18183openalex-snapshot
Edge Partitioning in Parallel Structured Duplicate Detection
inferred← citeshttps://doi.org/10.17877/de290r-3335openalex-snapshot
Large scale parallel state space search utilizing graphics processing units and solid state disks
inferred← citeshttps://doi.org/10.3390/jlpea8040035openalex-snapshot
Path Planning for Highly Automated Driving on Embedded GPUs
inferred← citeshttps://doi.org/10.3390/robotics4040435openalex-snapshot
IMPERA: Integrated Mission Planning for Multi-Robot Systems
inferred← citeshttps://doi.org/10.35537/10915/44478openalex-snapshot
Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore
inferred← citeshttps://doi.org/10.35537/10915/48825openalex-snapshot
Computer Science & Technology Series
inferred← citeshttps://doi.org/10.5555/2343896.2343955openalex-snapshot
Multi-agent A* for parallel and distributed systems
inferred← citeshttps://doi.org/10.7936/k7m043jropenalex-snapshot
Accelerating Heuristic Search for AI Planning
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.