Jeffrey Bosboom
Jeffrey Bosboom
PhD Student, MIT CSAIL
在 csail.mit.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
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
4732014
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
332015
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
182014
Mario Kart Is Hard
J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten
Discrete and Computational Geometry and Graphs, 49-59, 2015
102015
Even 1× n Edge-Matching and Jigsaw Puzzles are Really Hard
J Bosboom, ED Demaine, ML Demaine, A Hesterberg, P Manurangsi, ...
CoRR, 2017
62017
Even Edge-Matching and Jigsaw Puzzles are Really Hard
J Bosboom, ED Demaine, ML Demaine, A Hesterberg, P Manurangsi, ...
arXiv preprint arXiv:1701.00146, 2016
6*2016
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, 37-48, 2015
22015
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
22015
Netrunner Mate-in-1 or-2 is Weakly NP-Hard
J Bosboom, M Hoffmann
arXiv preprint arXiv:1710.05121, 2017
12017
系统目前无法执行此操作,请稍后再试。
文章 1–9