#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1994

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Samuel Kutin, David Petrie Moulton, Lawren Smithline
- Chicago J. Theor. Comput. Sci.
- 2007

We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal… (More)

- Robin J. Chapman, Timothy Y. Chow, Amit Khetan, David Petrie Moulton, Robert J. Waters
- J. Comb. Theory, Ser. A
- 2009

There is a strikingly simple classical formula for the number of lattice paths avoiding the line x = ky when k is a positive integer. We show that the natural generalization of this simple formula… (More)

- David Petrie Moulton, Melisenda J. McDonald
- Biochemical and biophysical research…
- 1994

Heme chain exchange was employed to investigate the dimer dissociation reaction of human apohemoglobin in 0.1 M potassium phosphate buffer, pH 7.0, at 20 degrees C. Incubation of apohemoglobin (alpha… (More)

- Geir T. Helleloid, Madeeha Khalid, David Petrie Moulton, Philip Matchett Wood
- Discrete Mathematics
- 2009

- Mike Develin, Stephen G. Hartke, David Petrie Moulton
- Discrete & Computational Geometry
- 2003

We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected… (More)

- David Petrie Moulton, Anshu A. Joshi, andHaroldP. Morris, Melisenda J. McDonald
- Biochemical and biophysical research…
- 1994

A broad beta chain band region containing multiple components was observed with both native beta and Des(His-146, Tyr-145) beta chains following isoelectric focusing on agarose gels (pH 6.0-8.0). In… (More)

- Adam Chalcraft, Samuel Kutin, David Petrie Moulton
- ArXiv
- 2013

The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise… (More)

- Daniel Isaksen, David Petrie Moulton
- Discrete Mathematics
- 1997

A graph G is randomly planar if every planar embedding of every connected subgraph of G can be extended to a planar embedding of G. We classify these graphs.

In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like “pegging moves” allowed. Motivated by well-studied questions in graph pebbling, we… (More)

- David Petrie Moulton, andHaroldP. Morris, Gayathri Vasudevan, F Chiu, Melisenda J. McDonald
- Biochemical and biophysical research…
- 1996

The subunit assembly properties of isolated beta and Des(His-146,Tyr-145) beta chains of sickle hemoglobin were investigated by isoelectric focusing over a protein concentration range from 500-125… (More)