My interests are:
<br>
<A HREF=
http://darkwing.uoregon.edu/~ncp/OpAlgResources/OpAlgPages/opalg.html>
Operator algebras
</A> 
<br>
Groupoids, inverse semigroups
<br>
<A HREF=
http://en.wikipedia.org/wiki/Combinatorial_game_theory>
Combinatorial game theory
</A> 
<br>
<A HREF=
http://mingus.la.asu.edu/~hurlbert/pebbling/pebb.html>
Graph pebbling
</A> 
<br>
Scientific computing
<br>

<!--
<P><B><FONT SIZE=+1><A HREF="curvit.pdf">Vita:</A></FONT></B>
-->


<ol>
<LI>
C*-crossed products by partial actions and actions of inverse semigroups
(<A HREF=http://front.math.ucdavis.edu/9602.5056>preprint server)</A></LI>

<LI>
C*-crossed products by twisted inverse semigroup actions 
(<A HREF=
"http://front.math.ucdavis.edu/9712.5061"
>preprint server</A>)</LI>

<LI>
Morita equivalence of C*-crossed products by inverse semigroup actions
and partial actions (<A HREF="morita.ps">ps</A>
file)</LI>

<LI>
C*-actions of r-discrete groupoids and inverse semigroups, with John Quigg&nbsp;
(<A HREF="http://xxx.lanl.gov/abs/math.OA/9801002">preprint server</A>)</LI>

<LI>
C*-equivalences of graphs, with Doug Drinen&nbsp; 
(<A HREF="http://front.math.ucdavis.edu/9810.5100">preprint
server</A>)</LI>

<LI>
A note on primitive equivalence (<A
HREF="http://xxx.lanl.gov/abs/math.FA/9904024">preprint server</A>)</LI>

<LI> Fell bundles over r-discrete groupoids and inverse semigroups (unfinished project)
 (<A HREF=bundle.ps.gz>ps.gz</A>)</LI>


<LI>
Cayley color graphs of inverse semigroups and groupoids  (<A
HREF="cayley.pdf">pdf</A>)

<LI>
Cayley line graphs of transitive groupoids  (<A
HREF="cayley2.pdf">pdf</A>)

<LI>
Avoidable sets in the bicyclic inverse semigroup  (<A
HREF="avoid.pdf">pdf</A>)

<LI>
Wild polyomino weak (1,2)-achievement games  (<A
HREF="achieve12.pdf">pdf</A>)
(<A HREF="uniform_1.pdf">rectangular graph paper</A>)

<LI>
Polyomino weak achievement games on 3-dimensional rectangular boards 
(<A HREF="animal.pdf">pdf</A>)
(<A HREF="animal.ps">ps</A>)
(<A HREF=http://jan.ucc.nau.edu/~ns46/3D/>3D graphics</A>)


<LI>
Hexagonal polyomino weak (1,2)-achievement games 
(<A HREF="hexachieve12.pdf">pdf</A>)
(<A HREF="hexachieve12.ps">ps</A>)
(<A HREF="hexagon-graph-paper-0.5cm.pdf">hexagonal graph paper</A>)

<LI>
Snaky is a 41-dimensional winner 
(<A HREF="dimension.pdf">pdf</A>)

<LI>
Computing Eigenfunctions on the Koch Snowflake: A New Grid and Symmetry,
with J. Neuberger and J. Swift
(<A HREF="nsf03/lin.pdf">pdf</A>)

<LI>
Polyominoes with minimum exterior
perimeter and full set achievement games
(<A HREF="ws.ps">ps</A>)

<LI>
Perfect Pairs of Ideals and Duals in Numerical Semigroups, with
Kurt Herzinger, Stephen Wilson and Jeff Rushall 
(<A HREF=
http://front.math.ucdavis.edu/math.AC/0508631                                  
>preprint server</A>)</LI>

<LI>
Rectangular Polyomino Set Weak (1,2)-achievement Games, with Edgar Fisher
(<A HREF="set.ps">ps</A>)

<LI>
Symmetry and Automated Branch Following for
a Semilinear Elliptic PDE on a Fractal Region,
with J. Neuberger and J. Swift
(<A HREF="nonlin.pdf">pdf</A>)

<LI>
Rubbling and Optimal Rubbling of Graphs,
with Christopher Belford 
(<A HREF="rubbling.pdf">pdf</A>)

<LI>
Polyiamonds                                                                              
and Polyhexes with Minimum Site-perimeter and Achievement Games,
with Gabor Fulep
(<A HREF="siteperimeter.pdf">pdf</A>)

<LI>
Proof trees for weak achievement games
(<A HREF="snaky.pdf">pdf</A>)

<LI>
Automated Bifurcation Analysis for Nonlinear Elliptic Partial Difference Equations on Graphs,
with J. Neuberger and J. Swift
(<A HREF="nss3.pdf">pdf</A>)

<LI>
A graph pebbling algorithm on weighted graphs
(<A HREF="pebble_algo.pdf">pdf</A>)

<LI>
An MPI Implementation of a Self-Submitting Parallel Job Queue,
with J. Neuberger and J. Swift
(<A HREF="MPQueue.pdf">pdf</A>)

<LI>
Critical branching random walk in an IID environment, with Janos Englander
(<A HREF="BRWsimulation.pdf">pdf</A>)

<LI>
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs, with Gyula Y. Katona
(<A HREF="rubbling2.pdf">pdf</A>)

<LI>
Biased Weak Polyform Achievement Games, with Ian Norris
(<A HREF="http://front.math.ucdavis.edu/1107.1878">preprint server</A>)



</ol>