| Opentuner: An extensible framework for program autotuning J Ansel, S Kamil, K Veeramachaneni, J Ragan-Kelley, J Bosboom, ... Proceedings of the 23rd international conference on Parallel architectures …, 2014 | 724 | 2014 |
| Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code C Mendis, J Bosboom, K Wu, S Kamil, J Ragan-Kelley, S Paris, Q Zhao, ... Proceedings of the 36th ACM SIGPLAN Conference on Programming Language …, 2015 | 50 | 2015 |
| Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets J Ani, J Bosboom, ED Demaine, Y Diomidov, D Hendrickson, J Lynch arXiv preprint arXiv:2006.01256, 2020 | 29 | 2020 |
| Tatamibari is NP-complete A Adler, J Bosboom, ED Demaine, ML Demaine, QC Liu, J Lynch arXiv preprint arXiv:2003.08331, 2020 | 27 | 2020 |
| StreamJIT: a commensal compiler for high-performance stream programming J Bosboom, S Rajadurai, WF Wong, S Amarasinghe Proceedings of the 2014 ACM International Conference on Object Oriented …, 2014 | 22 | 2014 |
| Gloss: Seamless live reconfiguration and reoptimization of stream programs S Rajadurai, J Bosboom, WF Wong, S Amarasinghe Proceedings of the Twenty-Third International Conference on Architectural …, 2018 | 20 | 2018 |
| Mario kart is hard J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten Discrete and Computational Geometry and Graphs: 18th Japan Conference …, 2016 | 15 | 2016 |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Z Abel, J Bosboom, M Coulombe, ED Demaine, L Hamilton, A Hesterberg, ... Theoretical Computer Science 839, 41-102, 2020 | 12 | 2020 |
| Path puzzles: Discrete tomography with a path constraint is hard J Bosboom, ED Demaine, ML Demaine, A Hesterberg, R Kimball, ... Graphs and Combinatorics 36 (2), 251-267, 2020 | 10 | 2020 |
| Even 1× n edge-matching and jigsaw puzzles are really hard J Bosboom, ED Demaine, ML Demaine, A Hesterberg, P Manurangsi, ... Journal of Information Processing 25, 682-694, 2017 | 10 | 2017 |
| Edge matching with inequalities, triangles, unknown shape, and two players J Bosboom, C Chen, L Chung, S Compton, M Coulombe, ED Demaine, ... Journal of Information Processing 28, 987-1007, 2020 | 8 | 2020 |
| Exhaustive search and hardness proofs for games J Bosboom Massachusetts Institute of Technology, 2020 | 3 | 2020 |
| k-Piece Dissection is NP-hard J Bosboom, ED Demaine, ML Demaine, J Lynch, P Manurangsi, M Rudoy, ... 18th Japan Conf. on Discrete and Computational Geometry and Graphs 2, 2015 | 3 | 2015 |
| The Legend of Zelda: The Complexity of Mechanics J Bosboom, J Brunner, M Coulombe, ED Demaine, DH Hendrickson, ... arXiv preprint arXiv:2203.17167, 2022 | 2 | 2022 |
| Netrunner Mate-in-1 or-2 is Weakly NP-Hard J Bosboom, M Hoffmann arXiv preprint arXiv:1710.05121, 2017 | 2 | 2017 |
| Arithmetic expression construction L Alcock, S Asif, J Bosboom, J Brunner, C Chen, ED Demaine, R Epstein, ... arXiv preprint arXiv:2011.11767, 2020 | 1 | 2020 |
| Losing at Checkers is hard J Bosboom, S Congero, ED Demaine, ML Demaine, J Lynch The Mathematics of Various Entertaining Subjects (MOVES 2017) 3, 103-118, 2019 | 1 | 2019 |
| Dissection with the fewest pieces is hard, even to approximate J Bosboom, ED Demaine, ML Demaine, J Lynch, P Manurangsi, M Rudoy, ... Discrete and Computational Geometry and Graphs: 18th Japan Conference …, 2016 | 1 | 2016 |
Saman AmarasingheMITVerified email at mit.edu
