scientific article; zbMATH DE number 934538
From MaRDI portal
Publication:4895237
Recommendations
- Parallel Greedy Randomized Adaptive Search Procedures
- Publication:4953917
- Parallel randomized best-first minimax search.
- A randomized parallel backtracking algorithm
- scientific article; zbMATH DE number 1302200
- scientific article; zbMATH DE number 1304350
- scientific article; zbMATH DE number 1014712
- Efficiency of randomized parallel backtrack search
- Parallel strategies for direct multisearch
Cited in
(15)- The parallel complexity of approximating the high degree subgraph problem
- Graph algorithms with small communication costs
- One side cut accelerated random search
- Parallel strategies for direct multisearch
- High-Probability Parallel Transitive-Closure Algorithms
- Evaluation of a simple, scalable, parallel best-first search strategy
- scientific article; zbMATH DE number 1222607 (Why is no real title available?)
- Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
- scientific article; zbMATH DE number 1304350 (Why is no real title available?)
- scientific article; zbMATH DE number 1305103 (Why is no real title available?)
- scientific article; zbMATH DE number 1334210 (Why is no real title available?)
- A Randomized Parallel Algorithm for Single-Source Shortest Paths
- scientific article; zbMATH DE number 1863286 (Why is no real title available?)
- Parallel exhaustive search without coordination
- A sharper analysis of a prallel algorithm for the all pairs shortest path problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895237)
