Jeffrey Bosboom

Orcid: 0000-0002-8526-4085

According to our database1, Jeffrey Bosboom authored at least 19 papers between 2014 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Legend of Zelda: The Complexity of Mechanics.
CoRR, 2022

2021
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Tatamibari Is NP-Complete.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci., 2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
J. Inf. Process., 2020

Path Puzzles: Discrete Tomography with a Path Constraint is Hard.
Graphs Comb., 2020

Arithmetic Expression Construction.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2018
Losing at Checkers is Hard.
CoRR, 2018

Computational Complexity of Generalized Push Fight.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Gloss: Seamless Live Reconfiguration and Reoptimization of Stream Programs.
Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, 2018

2017
Even 1 × <i>n</i> Edge-Matching and Jigsaw Puzzles are Really Hard.
J. Inf. Process., 2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard.
CoRR, 2017

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard.
CoRR, 2017

2015
Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Mario Kart Is Hard.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Dissection with the Fewest Pieces is Hard, Even to Approximate.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
StreamJIT: a commensal compiler for high-performance stream programming.
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, 2014

OpenTuner: an extensible framework for program autotuning.
Proceedings of the International Conference on Parallel Architectures and Compilation, 2014


  Loading...