Sandpile prediction on a tree in near linear time

DOI10.1137/1.9781611974782.72zbMath1410.68246OpenAlexW4254139215MaRDI QIDQ4575814

Aaron Schild, Akshay Ramachandran

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.72

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80)

Related Items (1)

Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three

This page was built for publication: Sandpile prediction on a tree in near linear time