#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2003

2019

- This year (10)
- Last 5 years (26)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jayson Lynch, Muhammad Zafarullah Khan, Jörn Altmann, Moses N. Njahira, Nicola M Rubenstein
- General and comparative endocrinology
- 2003

One source of both bias and "noise" in fecal steroid analysis is temporal change in steroid concentrations resulting from duration or conditions of fecal sample storage. However, no consensus… (More)

We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of… (More)

We prove the NP-completeness of finding a Hamiltonian path in an N ×N ×N cube graph with turns exactly at specified lengths along the path. This result establishes NP-completeness of Snake Cube… (More)

- Zachary Abel, Brad Ballinger, +7 authors Ryuhei Uehara
- JIP
- 2017

In this paper, we introduce the notion of “rep-cube”: a net of a cube that can be divided into multiple polygons, each of which can be folded into a cube. This notion is inspired by the notion of… (More)

- Erik D. Demaine, Joshua Lockhart, Jayson Lynch
- FUN
- 2018

We classify the computational complexity of the popular video games Portal and Portal 2. We isolate individual mechanics of the game and prove NP-hardness, PSPACE-completeness, or… (More)

- Jeffrey Bosboom, Erik D. Demaine, +4 authors Anak Yodpinyanee
- JCDCGG
- 2015

We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of 1 + 1/1080 − ε.

- Erik D. Demaine, Isaac Grosof, Jayson Lynch
- ArXiv
- 2017

This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question [ZR11]. Pushpull… (More)

- Michael A. Bender, Erik D. Demaine, +5 authors Samuel McCauley
- SPAA
- 2016

Memory efficiency and locality have substantial impact on the performance of programs, particularly when operating on large data sets. Thus, memory- or I/O-efficient algorithms have received… (More)

- Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
- FUN
- 2018

We initiate a general theory for analyzing the complexity of motion planning of a single robot through a graph of “gadgets”, each with their own state, set of locations, and allowed traversals… (More)

- Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten
- JCDCGG
- 2015

Nintendo’s Mario Kart is perhaps the most popular racing video game franchise. Players race alone or against opponents to finish in the fastest time possible. Players can also use items to attack and… (More)