On the public citation graph

Prioritization in parallel symbolic computing

https://doi.org/10.1007/bfb0018645
0 signed · 41 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.1007/3-540-51285-3_38openalex-snapshot
Pruning and scheduling speculative work in or-parallel Prolog
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/bf01379360openalex-snapshot
Parallel state-space search for a first solution with consistent linear speedups
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.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
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)90009-eopenalex-snapshot
The reduce-or process model for parallel execution of logic programs
inferredcites →https://doi.org/10.1109/dmcc.1991.633162openalex-snapshot
Efficient Parallel Execution of IDA on Shared and Distributed Memory Multiprocessors
inferredcites →https://doi.org/10.1109/iccad.1992.279371openalex-snapshot
Portable parallel test generation for sequential circuits
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/mc.1983.1654311openalex-snapshot
1983 International Conference on Parallel Processing August 23-26, 1983
inferredcites →https://doi.org/10.1109/mc.1986.1663306openalex-snapshot
Parallel Symbolic Computing
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/91556.91644openalex-snapshot
Speculative computation in multilisp
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.1145/99164.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
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.1006/jpdc.1998.1429openalex-snapshot
Randomized Priority Queues for Fast Parallel Access
inferred← citeshttps://doi.org/10.1007/0-387-28967-4_21openalex-snapshot
Modeling Analysis of Key Message Approach on Clusters
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_14openalex-snapshot
Atredia: A Mapping Environment for Dynamic Tree-Structured Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-44471-9_9openalex-snapshot
Controlling Concurrency and Expressing Synchronization in Charm++ Programs
inferred← citeshttps://doi.org/10.1007/bf01018695openalex-snapshot
An application of an OR-Parallel Prolog system to phylogenetic analysis
inferred← citeshttps://doi.org/10.1007/bfb0023062openalex-snapshot
Efficient parallel graph coloring with prioritization
inferred← citeshttps://doi.org/10.1007/s10766-005-3582-6openalex-snapshot
Simulation-Based Performance Prediction for Large Parallel Machines
inferred← citeshttps://doi.org/10.1007/s11227-005-0157-7openalex-snapshot
A Hybrid Analysis of an Optimization Approach for Cluster Applications
inferred← citeshttps://doi.org/10.1016/j.parco.2004.07.004openalex-snapshot
Key Messaging on SOME-Bus clusters
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.1023/a:1023603505117openalex-snapshot
Key Message Approach to Optimize Communication of Parallel Applications on Clusters
inferred← citeshttps://doi.org/10.1109/32.844491openalex-snapshot
A design methodology for data-parallel applications
inferred← citeshttps://doi.org/10.1109/icppw.2000.869146openalex-snapshot
Performance evaluation of a communication optimization model in network-based parallel computing
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303218openalex-snapshot
Performance modeling and programming environments for petaflops computers and the blue gene machine
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303322openalex-snapshot
Priority-driven active data prefetching
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/ipdpsw.2012.297openalex-snapshot
Dynamic Scheduling for Work Agglomeration on Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1109/iwcc.1999.810816openalex-snapshot
Key Message Algorithm: a communication optimization algorithm in cluster-based parallel computing
inferred← citeshttps://doi.org/10.1109/nca.2004.1347777openalex-snapshot
Dynamic key messaging for cluster computing
inferred← citeshttps://doi.org/10.1142/s0129626411000242openalex-snapshot
PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
inferred← citeshttps://doi.org/10.1145/378580.378639openalex-snapshot
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables
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.