default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey Bosboom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i12]Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt:
The Legend of Zelda: The Complexity of Mechanics. CoRR abs/2203.17167 (2022)- 2021
- [c11]Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari Is NP-Complete. FUN 2021: 1:1-1:24 - [c10]Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. FUN 2021: 3:1-3:23 - 2020
- [j4]Jeffrey Bosboom
, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky:
Path Puzzles: Discrete Tomography with a Path Constraint is Hard. Graphs Comb. 36(2): 251-267 (2020) - [j3]Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang:
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. J. Inf. Process. 28: 987-1007 (2020) - [j2]Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. 839: 41-102 (2020) - [c9]Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang:
Arithmetic Expression Construction. ISAAC 2020: 12:1-12:15 - [i11]Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang:
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. CoRR abs/2002.03887 (2020) - [i10]Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari is NP-complete. CoRR abs/2003.08331 (2020) - [i9]Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets. CoRR abs/2006.01256 (2020) - [i8]Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang:
Arithmetic Expression Construction. CoRR abs/2011.11767 (2020)
2010 – 2019
- 2018
- [c8]Sumanaruban Rajadurai, Jeffrey Bosboom, Weng-Fai Wong, Saman P. Amarasinghe:
Gloss: Seamless Live Reconfiguration and Reoptimization of Stream Programs. ASPLOS 2018: 98-112 - [c7]Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. FUN 2018: 3:1-3:21 - [c6]Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy:
Computational Complexity of Generalized Push Fight. FUN 2018: 11:1-11:21 - [i7]Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky:
Path Puzzles: Discrete Tomography with a Path Constraint is Hard. CoRR abs/1803.01176 (2018) - [i6]Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy:
Computational Complexity of Generalized Push Fight. CoRR abs/1803.03708 (2018) - [i5]Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. CoRR abs/1804.10193 (2018) - [i4]Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine, Jayson Lynch:
Losing at Checkers is Hard. CoRR abs/1806.05657 (2018) - 2017
- [j1]Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee:
Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard. J. Inf. Process. 25: 682-694 (2017) - [i3]Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee:
Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard. CoRR abs/1701.00146 (2017) - [i2]Jeffrey Bosboom, Michael Hoffmann:
Netrunner Mate-in-1 or -2 is Weakly NP-Hard. CoRR abs/1710.05121 (2017) - 2015
- [c5]Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee:
Dissection with the Fewest Pieces is Hard, Even to Approximate. JCDCGG 2015: 37-48 - [c4]Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten:
Mario Kart Is Hard. JCDCGG 2015: 49-59 - [c3]Charith Mendis, Jeffrey Bosboom, Kevin Wu, Shoaib Kamil, Jonathan Ragan-Kelley, Sylvain Paris, Qin Zhao, Saman P. Amarasinghe:
Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code. PLDI 2015: 391-402 - [i1]Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee:
Dissection with the Fewest Pieces is Hard, Even to Approximate. CoRR abs/1512.06706 (2015) - 2014
- [c2]Jason Ansel, Shoaib Kamil, Kalyan Veeramachaneni, Jonathan Ragan-Kelley, Jeffrey Bosboom, Una-May O'Reilly, Saman P. Amarasinghe:
OpenTuner: an extensible framework for program autotuning. PACT 2014: 303-316 - [c1]Jeffrey Bosboom, Sumanaruban Rajadurai, Weng-Fai Wong, Saman P. Amarasinghe:
StreamJIT: a commensal compiler for high-performance stream programming. OOPSLA 2014: 177-195
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
