On the public citation graph
A parallelization of Dijkstra's shortest path algorithm
0 signed · 152 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.1002/rsa.3240010106openalex-snapshot
The transitive closure of a random digraph
inferredcites →https://doi.org/10.1006/jagm.1996.0048openalex-snapshot
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
inferredcites →https://doi.org/10.1006/jpdc.1998.1429openalex-snapshot
Randomized Priority Queues for Fast Parallel Access
inferredcites →https://doi.org/10.1006/jpdc.2000.1646openalex-snapshot
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
inferredcites →https://doi.org/10.1007/3-540-68530-8_33openalex-snapshot
Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
inferredcites →https://doi.org/10.1007/978-1-4757-6130-6_11openalex-snapshot
A Randomized Parallel Search Strategy
inferredcites →https://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bfb0030108openalex-snapshot
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
inferredcites →https://doi.org/10.1007/bfb0055823openalex-snapshot
A parallelization of Dijkstra's shortest path algorithm
inferredcites →https://doi.org/10.1016/0166-218x(85)90059-9openalex-snapshot
The shortest-path problem for graphs with random arc-lengths
inferredcites →https://doi.org/10.1109/ipps.1997.580979openalex-snapshot
A parallel priority data structure with applications
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1109/sfcs.1997.646088openalex-snapshot
Undirected single source shortest paths in linear time
inferredcites →https://doi.org/10.1109/spdp.1996.570330openalex-snapshot
Improved algorithms and data structures for solving graph problems in external memory
inferredcites →https://doi.org/10.1145/140901.141913openalex-snapshot
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
inferredcites →https://doi.org/10.1145/195058.195089openalex-snapshot
Polylog-time and near-linear work approximation scheme for undirected shortest paths
inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferredcites →https://doi.org/10.1287/moor.10.4.557openalex-snapshot
On Shortest Paths in Graphs with Random Weights
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118711897.ch15openalex-snapshot
The All‐Pair Shortest‐Path Problem in Shared‐Memory Heterogeneous Systems
inferred← citeshttps://doi.org/10.1002/cmm4.1056openalex-snapshot
On parallel computation of indicators of centrality and its application to speeding up RDA
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_49openalex-snapshot
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_9openalex-snapshot
Distributed LTL Model Checking Based on Negative Cycle Detection
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_16openalex-snapshot
How to Employ Reverse Search in Distributed Single Source Shortest Paths
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_33openalex-snapshot
Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4020-6448-7_40openalex-snapshot
A New Parallelization Approach for Sequential Simulation
inferred← citeshttps://doi.org/10.1007/978-3-030-77970-2_13openalex-snapshot
Pruned Simulation-Based Optimal Sailboat Path Search Using Micro HPC Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-22941-1_32openalex-snapshot
Fast Parallel Bellman-Ford-Moore Algorithm Implementation for Small Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-05164-2_3openalex-snapshot
Machine Learning for Auspicious Social Network Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-68953-1_5openalex-snapshot
Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-73814-7_5openalex-snapshot
Parallelizing Single Source Shortest Path with OpenSHMEM
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_40openalex-snapshot
I/O-Efficient Undirected Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_15openalex-snapshot
Via Detours to I/O-Efficient Shortest Paths
inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot
Mathematical Foundations of Computer Science 1998
inferred← citeshttps://doi.org/10.1007/s00170-014-6080-4openalex-snapshot
Optimization of 3D laser cutting head orientation based on the minimum energy consumption
inferred← citeshttps://doi.org/10.1007/s10766-015-0349-6openalex-snapshot
TuCCompi: A Multi-layer Model for Distributed Heterogeneous Computing with Tuning Capabilities
inferred← citeshttps://doi.org/10.1007/s10766-015-0351-zopenalex-snapshot
Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/s10846-016-0382-8openalex-snapshot
Toward Optimal Rendezvous of Multiple Underwater Gliders: 3D Path Planning with Combined Sawtooth and Spiral Motion
inferred← citeshttps://doi.org/10.1007/s11227-014-1212-zopenalex-snapshot
Optimizing an APSP implementation for NVIDIA GPUs using kernel characterization criteria
inferred← citeshttps://doi.org/10.1007/s11227-017-2225-1openalex-snapshot
A survey of graph processing on graphics processing units
inferred← citeshttps://doi.org/10.1007/s11227-018-2654-5openalex-snapshot
On parallel computation of centrality measures of graphs
inferred← citeshttps://doi.org/10.1007/s13222-017-0255-8openalex-snapshot
Big Graph Data Analytics on Single Machines – An Overview
inferred← citeshttps://doi.org/10.1016/j.comnet.2017.07.013openalex-snapshot
EIR: Edge-aware inter-domain routing protocol for the future mobile internet
inferred← citeshttps://doi.org/10.1016/j.endm.2017.11.007openalex-snapshot
Utilization of OpenCL for Large Graph Problems on Graphics Processing Unit
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.07.003openalex-snapshot
Parallel implementation of a transportation network model
inferred← citeshttps://doi.org/10.1016/j.ndteint.2013.08.002openalex-snapshot
Novel ray-tracing algorithms in NDE: Application of Dijkstra and A⁎ algorithms to the inspection of an anisotropic weld
inferred← citeshttps://doi.org/10.1016/j.trc.2019.05.020openalex-snapshot
A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot
Δ-stepping: a parallelizable shortest path algorithm
inferred← citeshttps://doi.org/10.1016/s0927-5452(04)80040-6openalex-snapshot
Distributed negative cycle detection algorithms
inferred← citeshttps://doi.org/10.1080/13658816.2016.1191637openalex-snapshot
The benefits of a high-resolution analysis of transit accessibility
inferred← citeshttps://doi.org/10.1080/13658816.2022.2052885openalex-snapshot
An efficient multiple scanning order algorithm for accumulative least-cost surface calculation
inferred← citeshttps://doi.org/10.1090/dimacs/074/09openalex-snapshot
Single-source shortest paths with the parallel boost graph library
inferred← citeshttps://doi.org/10.1109/access.2020.3026677openalex-snapshot
Route Planning Through Distributed Computing by Road Side Units
inferred← citeshttps://doi.org/10.1109/carpathiancc.2015.7145044openalex-snapshot
Dijkstra algorithm in parallel- Case study
inferred← citeshttps://doi.org/10.1109/discover50404.2020.9278058openalex-snapshot
A Heuristic Algorithm to Find a Path to be Blocked by Minimizing Traffic Disruption
inferred← citeshttps://doi.org/10.1109/fskd.2018.8687194openalex-snapshot
An Improved Index Based on MapReduce for Path Queries in Public Transportation Networks
inferred← citeshttps://doi.org/10.1109/hipc.2010.5713180openalex-snapshot
A space-efficient parallel algorithm for computing betweenness centrality in distributed memory
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys57074.2022.00176openalex-snapshot
Parallel-Friendly and Work-Efficient Single Source Shortest Path Algorithm on Single-Node System
inferred← citeshttps://doi.org/10.1109/hpcsim.2013.6641461openalex-snapshot
A new GPU-based approach to the Shortest Path problem
inferred← citeshttps://doi.org/10.1109/hpec.2014.7040974openalex-snapshot
Efficient extraction of high centrality vertices in distributed graphs
inferred← citeshttps://doi.org/10.1109/hspr.2008.4734433openalex-snapshot
A prototype of a dynamically reconfigurable processor based off-loading engine for accelerating the shortest path calculation with GNU zebra
inferred← citeshttps://doi.org/10.1109/ia335182.2014.10612687openalex-snapshot
Distributed Control: Priority Scheduling for Single Source Shortest Paths Without Synchronization
inferred← citeshttps://doi.org/10.1109/icai67591.2025.11324080openalex-snapshot
Minimizing Road Curvature Through Parallel Computing in Pathfinding Algorithms
inferred← citeshttps://doi.org/10.1109/iccct.2011.6075214openalex-snapshot
A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA
inferred← citeshttps://doi.org/10.1109/iccitechn.2016.7860235openalex-snapshot
AN intelligent road traffic management system using NVIDIA GPU
inferred← citeshttps://doi.org/10.1109/icfc49376.2020.00009openalex-snapshot
On Decentralized Route Planning Using the Road Side Units as Computing Resources
inferred← citeshttps://doi.org/10.1109/icicta.2012.154openalex-snapshot
Traffic Route Dynamic Guidance Based on Coupling of Time Recursive and Artificial Neuron Network
inferred← citeshttps://doi.org/10.1109/icnsc.2008.4525475openalex-snapshot
Path Planning Based on Ceiling Light Landmarks for a Mobile Robot
inferred← citeshttps://doi.org/10.1109/icoip.2010.58openalex-snapshot
Traffic Route Dynamic Guidance Based on Coupling of Time Recursive and Artificial Neuron Network
inferred← citeshttps://doi.org/10.1109/icpads.2015.90openalex-snapshot
Comparison of Single Source Shortest Path Algorithms on Two Recent Asynchronous Many-task Runtime Systems
inferred← citeshttps://doi.org/10.1109/icpp.2006.34openalex-snapshot
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
inferred← citeshttps://doi.org/10.1109/icppw.2006.72openalex-snapshot
Tetrahedral Mesh Refinement in Distributed Environments
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320762openalex-snapshot
Optimizing Alternative Routes Retrieval in an Agent-based Transportation Management System
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015582openalex-snapshot
Buckets strike back: improved parallel shortest-paths
inferred← citeshttps://doi.org/10.1109/ipdps.2011.50openalex-snapshot
A Very Fast Simulator for Exploring the Many-Core Future
inferred← citeshttps://doi.org/10.1109/ipdps.2013.101openalex-snapshot
Deploying Graph Algorithms on GPUs: An Adaptive Solution
inferred← citeshttps://doi.org/10.1109/ipdps.2013.89openalex-snapshot
Parallel Label-Setting Multi-objective Shortest Path Search
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00032openalex-snapshot
Excavating the Potential of GPU for Accelerating Graph Traversal
inferred← citeshttps://doi.org/10.1109/isorc49007.2020.00018openalex-snapshot
Time-dependent Decentralized Routing using Federated Learning
inferred← citeshttps://doi.org/10.1109/ispdc51135.2020.00034openalex-snapshot
Efficient Parallel Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1109/metroautomotive50197.2021.9502869openalex-snapshot
Calculation of the minimum distance of driving route for average speed control based on three-dimensional modeling
inferred← citeshttps://doi.org/10.1109/oceansap.2016.7485374openalex-snapshot
Optimal path planning of underwater glider in 3D dubins motion with minimal energy consumption
inferred← citeshttps://doi.org/10.1109/robio.2014.7090603openalex-snapshot
Path planning as a service PPaaS: Cloud-based robotic path planning
inferred← citeshttps://doi.org/10.1109/sc.2005.4openalex-snapshot
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
inferred← citeshttps://doi.org/10.1109/sibgrapi.2014.1openalex-snapshot
Parallel Shortest Path Algorithm for Voronoi Diagrams with Generalized Distance Functions
inferred← citeshttps://doi.org/10.1109/tcsii.2015.2505998openalex-snapshot
An FPGA Implementation for Solving the Large Single-Source-Shortest-Path Problem
inferred← citeshttps://doi.org/10.1109/tii.2020.2974252openalex-snapshot
Accurate and Efficient Indoor Pathfinding Based on Building Information Modeling Data
inferred← citeshttps://doi.org/10.1109/tnet.2024.3367995openalex-snapshot
Parallelized In-Network Aggregation for Failure Repair in Erasure-Coded Storage Systems
inferred← citeshttps://doi.org/10.1109/tpds.2025.3536357openalex-snapshot
Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks
inferred← citeshttps://doi.org/10.1111/tgis.12453openalex-snapshot
A distributed approach for calculating inundation height based on Dijkstra's algorithm
inferred← citeshttps://doi.org/10.1137/s0097539702419650openalex-snapshot
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
inferred← citeshttps://doi.org/10.1145/1094811.1094844openalex-snapshot
Lifting sequential graph algorithms for distributed-memory parallel computation
inferred← citeshttps://doi.org/10.1145/1103845.1094844openalex-snapshot
Lifting sequential graph algorithms for distributed-memory parallel computation
inferred← citeshttps://doi.org/10.1145/2442516.2442549openalex-snapshot
Expressing graph algorithms using generalized active messages
inferred← citeshttps://doi.org/10.1145/2452376.2452413openalex-snapshot
Efficient breadth-first search on large graphs with skewed degree distributions
inferred← citeshttps://doi.org/10.1145/2464996.2465441openalex-snapshot
Expressing graph algorithms using generalized active messages
inferred← citeshttps://doi.org/10.1145/2555243.2555284openalex-snapshot
Provably good scheduling for parallel programs that use data structures through implicit batching
inferred← citeshttps://doi.org/10.1145/2612669.2612688openalex-snapshot
Provably good scheduling for parallel programs that use data structures through implicit batching
inferred← citeshttps://doi.org/10.1145/2803172openalex-snapshot
Tilewise Accumulated Cost Surface Computation with Graphics Processing Units
inferred← citeshttps://doi.org/10.1145/3409964.3461782openalex-snapshot
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
inferred← citeshttps://doi.org/10.1145/3490148.3538574openalex-snapshot
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
inferred← citeshttps://doi.org/10.1145/3490422.3502358openalex-snapshot
Accelerating SSSP for Power-Law Graphs
inferred← citeshttps://doi.org/10.1145/351827.384259openalex-snapshot
An experimental study of priority queues in external memory
inferred← citeshttps://doi.org/10.1145/3712285.3759872openalex-snapshot
Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing
inferred← citeshttps://doi.org/10.1155/2013/865643openalex-snapshot
Analysis of Average Shortest-Path Length of Scale-Free Network
inferred← citeshttps://doi.org/10.1155/2015/180214openalex-snapshot
Parallel Framework for Dimensionality Reduction of Large-Scale Datasets
inferred← citeshttps://doi.org/10.1177/1094342007085025openalex-snapshot
BlueGene/L applications: Parallelism On a Massive Scale
inferred← citeshttps://doi.org/10.1201/9781420011296.ch31openalex-snapshot
Design of Multithreaded Algorithms for Combinatorial Problems
inferred← citeshttps://doi.org/10.13140/2.1.1707.3603openalex-snapshot
Faster Upper Body Pose Recognition and Estimation using Compute Unified Device Architecture
inferred← citeshttps://doi.org/10.14288/1.0066786openalex-snapshot
3D livewire and live-vessel : minimal path methods for interactive medical image segmentation
inferred← citeshttps://doi.org/10.1504/ijids.2010.031887openalex-snapshot
On the integration of hybrid recommendation techniques into an agent-based transportation transactions management platform
inferred← citeshttps://doi.org/10.1515/amcs-2016-0025openalex-snapshot
An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems
inferred← citeshttps://doi.org/10.15407/pp2016.02-03.105openalex-snapshot
Research and development of Johnson's algorithm parallel schemes in GPGPU technology
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i33/87795openalex-snapshot
Modified Dijkstra’s Algorithm for Dense Graphs on GPU using CUDA
inferred← citeshttps://doi.org/10.22028/d291-25687openalex-snapshot
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice
inferred← citeshttps://doi.org/10.22028/d291-25720openalex-snapshot
Design and analysis of sequential and parallel single-source shortest-paths algorithms
inferred← citeshttps://doi.org/10.23919/elinfocom.2018.8330701openalex-snapshot
Acceleration of Dijkstra's algorithm on multi-core processors
inferred← citeshttps://doi.org/10.23919/eusipco.2017.8081563openalex-snapshot
Ongoing tests and improvements of the MPS algorithm for the automatic crack detection within grey level pavement images
inferred← citeshttps://doi.org/10.23919/iconac.2017.8082071openalex-snapshot
Study on parking spaces analyzing and guiding system based on video
inferred← citeshttps://doi.org/10.2478/amcs-2014-0040openalex-snapshot
High-performance simulation-based algorithms for an alpine ski racer’s trajectory optimization in heterogeneous computer systems
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5104openalex-snapshot
Shortest Path Calculation Using Contraction Hierarchy Graph Algorithms on Nvidia GPUs
inferred← citeshttps://doi.org/10.3233/fi-2000-43123412openalex-snapshot
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors
inferred← citeshttps://doi.org/10.32628/cseit1952146openalex-snapshot
Data Security and Shortest Path Finding in IOT
inferred← citeshttps://doi.org/10.32657/10356/6468openalex-snapshot
Applied graph- theoretic approach for two- way to one- way road network conversion
inferred← citeshttps://doi.org/10.32657/10356/72092openalex-snapshot
GPU-based commonsense reasoning for real-time query answering and multimodal analysis
inferred← citeshttps://doi.org/10.3390/computers14120545openalex-snapshot
Time and Memory Trade-Offs in Shortest-Path Algorithms Across Graph Topologies: A*, Bellman–Ford, Dijkstra, AI-Augmented A* and a Neural Baseline
inferred← citeshttps://doi.org/10.3390/electronics13112167openalex-snapshot
Analysis and Construction of Hardware Accelerators for Calculating the Shortest Path in Real-Time Robot Route Planning
inferred← citeshttps://doi.org/10.3390/math9111217openalex-snapshot
Finding Equilibria in the Traffic Assignment Problem with Primal-Dual Gradient Methods for Stable Dynamics Model and Beckmann Model
inferred← citeshttps://doi.org/10.33915/etd.4551openalex-snapshot
A faster algorithm for the single source shortest path problem with few distinct positive lengths
inferred← citeshttps://doi.org/10.35376/10324/16003openalex-snapshot
Parallel approaches to shortest-path problems for multilevel heterogeneous computing
inferred← citeshttps://doi.org/10.4236/jcc.2015.38005openalex-snapshot
Improving Global Performance on GPU for Algorithms with Main Loop Containing a Reduction Operation: Case of Dijkstra’s Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.0909.2376openalex-snapshot
Performing Hybrid Recommendation in Intermodal Transportation-the FTMarket System's Recommendation Module
inferred← citeshttps://doi.org/10.48550/arxiv.1307.5438openalex-snapshot
Towards Distribution-Free Multi-Armed Bandits with Combinatorial Strategies
inferred← citeshttps://doi.org/10.48550/arxiv.1812.10499openalex-snapshot
Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1903.12085openalex-snapshot
More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm
inferred← citeshttps://doi.org/10.5120/13424-1104openalex-snapshot
Performance Analysis of Single Source Shortest Path Algorithm over Multiple GPUs in a Network of Workstations using OpenCL and MPI
inferred← citeshttps://doi.org/10.5120/19375-1027openalex-snapshot
New Approach of Bellman Ford Algorithm on GPU using Compute Unified Design Architecture (CUDA)
inferred← citeshttps://doi.org/10.5120/8603-2371openalex-snapshot
A Study of Different Parallel Implementations of Single Source Shortest Path Algorithms
inferred← citeshttps://doi.org/10.51889/2022-2.1728-7901.11openalex-snapshot
РЕШЕНИЕ ЗАДАЧ В ОПТИМИЗАЦИИ ТРАНСПОРТНОЙ ЛОГИСТИКИ С ПОМОЩЬЮ ГРАФ-СХЕМ
inferred← citeshttps://doi.org/10.5220/0002461900870092openalex-snapshot
PROVIDING RECOMMENDATIONS IN AN AGENT-BASED TRANSPORTATION TRANSACTIONS MANAGEMENT PLATFORM
inferred← citeshttps://doi.org/10.5281/zenodo.13938420openalex-snapshot
TuCCompi: A Multi-Layer Programing Model for Heterogeneous Systems with Auto-Tuning Capabilities
inferred← citeshttps://doi.org/10.5281/zenodo.14014032openalex-snapshot
A Tuned, Concurrent-Kernel Approach to Speed Up the APSP problem
inferred← citeshttps://doi.org/10.5555/2688283.2688286openalex-snapshot
Distributed control: priority scheduling for single source shortest paths without synchronization
inferred← citeshttps://doi.org/10.5815/ijcnis.2020.03.02openalex-snapshot
MapReduce Algorithm for Single Source Shortest Path Problem
inferred← citeshttps://doi.org/10.58168/mstt2025_61-69openalex-snapshot
ASSESSMENT THE FEASIBILITY OF USING THE PROPOSED EQUIPMENT AND MONITORING FORCENTER FOR FORCES AND ASSETS
inferred← citeshttps://doi.org/10.7494/csci.2016.17.4.461openalex-snapshot
SIMULATION-BASED SAILBOAT TRAJECTORY OPTIMIZATION USING ON-BOARD HETEROGENEOUS COMPUTERS
showing the first 132 of 133 · page through all 133
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.