Algorithms and insights for RaceTrack

DOI10.1016/J.TCS.2018.04.028zbMATH Open1403.68072OpenAlexW2801344357WikidataQ129920303 ScholiaQ129920303MaRDI QIDQ1623262

Y. Aharonov

Publication date: 23 November 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5881/

zbMATH Keywords

complexityRaceTrackstate-graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Recommendations

• A fast algorithm for data collection along a fixed track 👍 👎
• On the front-tracking algorithm 👍 👎
• Improvement of algorithm on the track recognition 👍 👎
• Coding for Racetrack Memories 👍 👎
• A Fast Algorithm for Data Collection along a Fixed Track 👍 👎
• Algorithms for Matching and Predicting Trajectories 👍 👎
• Algorithms and Insights for RaceTrack 👍 👎

This page was built for publication: Algorithms and insights for RaceTrack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623262)