Andy Tockman

According to our database, Andy Tockman authored at least 4 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Foundational Verification of Running-Time Bounds for Interactive Programs.

Andy Tockman, Pratap Singh, Andres Erbsen, Samuel Gruetter, Adam Chlipala

Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2026

2024

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants.

MIT Hardness Group, Della H. Hendrickson, Andy Tockman

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles.

MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns.

Hugo A. Akitaya, Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo, Andy Tockman

CoRR, 2023