REU Main Page

Students by Family Name

—A—

Ingrid Abendroth (1999)
ila%acpub.duke.edu
Duke University
Abendroth, I. (1999) Uniqueness of sources in certian 3-Dimensional Networks. (abstract, scanned pdf)

Tarn Adams (1998)
tarn%math.stanford.edu
University of Washsington
Stanford University (math)
Adams, T. (1998) Various Counting operations on Circular Planar Graphs. (ps, pdf, tex)

Nicolas Addington (2003)
ntype%u.washington.edu
University of Washington
University of Wisconsin
Addington, N. (2003) Stars, Eigenvalues, and Negative Conductivities. (ps, pdf, tex)
Addington, N. (2003) A Method for Recovering Arbitrary Graphs. (ps, pdf, tex)
Addington, N. (2003) ...with figures combined. (ps)
Addington, N. (2003) The method, implemented in the c language. (tar.gz, zip)
University of Wisconsin

Rosemary Apple (2004)
rapple%indiana.edu
Indiana University
University of Edinburgh

Sasha Aravkin (2002)
aleksand%u.washington.edu
University of Washington
Aravkin, S. (2002) Transfinite Networks. (ps, pdf, tex)

Eric Auld (1990)
Massachussetts Institute of Technology
Auld, E. (1990) Looking for a Diode in a 2-Dimensional Network. (ps, pdf, tex)

—B—

Jennifer Balakrishnan (2006)
jennifer.balakrishnan%gmail.com
MIT

Timothy Banham (2006)
tsbanham%u.washington.edu
Banham, T. (2006) The Heat Equation and Periodic Boundary Conditions. (pdf)
Banham, T. (2006) The Laplacian and the Hot Spot Conjecture. (pdf)
UCSD

Orion Bawdon (2005)
orion%cs.washington.edu
University of Washington
University of Wisconsin

Rachel Bayless (2006)
rachelbayless%gmail.com
Bayless, R.; Geballe, Z. (2006) Circular Duals of Circularly Embedded Graphs. (pdf)
Bayless, R. (2006) Parametrizing Response Matrices. (pdf)

Sara Beavers (1988)
University of Washington

Owen Biesel (2005; TA, 2006, 2007, 2008, 2009)
obiesel%princeton.edu
University of Washington
Biesel, O.; Rohde, A. (2005) Discrete Cauchy Integrals. (dvi, pdf)
Biesel, O.; Eaton, J. (2005) Notes on Multiple Embeddings. (pdf, ps, zip)
Biesel, O.; Eaton, J. (2005) Circular Planar Self-dual Graphs. (pdf, ps, zip)
Cambridge University
Princeton University

Sara Billey (Faculty, 2008, 2009, 2011, 2012)
billey%math.washington.edu

James Bisgard (1997)
bisgard%math.wisc.edu
University of Washington
University of Wisconsin at Madison (math)
Bisgard, J.; Daileda, R.; Yamachika, R. (1997) Finding Broken Resistors in a Network. (scanned pdf)

Benjamin Blander (1997)
bblander%math.uchicago.edu
University of Chicago
Blander, B.; Lo, D. (1997) Tilings. (ps, pdf, tex)

Mark Blunk (2001; TA, 2006, 2008; Faculty, 2009)
zeponinn%u.washington.edu
University of Washington
University of California at Los Angeles
Blunk, M.; Coskey, S. (2001) Vertex Conductivity Networks. (ps, pdf, tex)
Blunk, M.; Coskey, S. (2001) Connections and Determinants. (ps, pdf, tex)

Tom Boothby (2007; TA, 2008, 2009)
boothby%u.washington.edu
Boothby, T.; Fanoe, A.; Zhang, T. (2007) Structure of Multiplexers on Stars. (pdf)
Boothby, T. (2007) Rotation Systems: Theory and Application. (senior thesis) (pdf, tar.gz, zip)

Nate Bottman (2007)
drbott%u.washington.edu
Bottman, N. (2007) On the Discretized Cauchy Problem. (pdf)
Bottman, N.; McNutt, J. (2007) Neumann to Dirichlet Map. (pdf)

Kia Braha (2011)
brahae@seattleu.edu
Seattle University
Braha, K. (2011) Knot Games Results. (pdf)
Braha, K. (2011) Knot Games and Winning Strategies. (pdf)

Nathan Bramall (1994)
bramall%physics.berkeley.edu
University of Washington
University of California at Berkeley (physics)
Bramall, N. (1994) Determining Resistors in a Network with Boundary Conditions in One Step. (scanned pdf)

Michael Buksas (1991)
Harvey Mudd College

Mark Bun (2010)
markmbun@cs.washington.edu
University of Washington
Bun, M. (2010) Convex Sets. (pdf)
Bun, M. (2010) Unsolved Problems In Intuitive Geometry. (pdf)

Mark Bun (2009)
markmbun%u.washington.edu
University of Washington
Bun, M. (2009) Applications of the Levenberg-Marquardt Algorithm to the Inverse Problem. (pdf)

Jeffrey Burkert (2009)
jeffrey.burkert%gmail.com
Harvey Mudd
Burkert, J. (2009) The Characteristic Polynomial of an Electrical Network. (pdf)
Burkert, J. (2009) Enumerating Spanning Trees with Determinants. (pdf)
Burkert, J.; Eichwald, M. (2009) On the Cyclically Fully Commutative Elements of Coxeter Groups. (pdf)

Michael Burr (2003)
mburr01%tufts.edu
Tufts University
Burr, M. (2003) Analysis and Efficiencyof Jeffrey Giansiricusa's Algorithm for Partial Recovery. (ps, pdf, tex)
Burr, M. (2003) Unique Solutions for the Drirchlet Inverse Problem on Schrodinger Networks. (ps, pdf, tex)

Neil Burrell (1998)
burrelln%colorado.edu
Harvey Mudd College
University of Colorado (amath)
Burrell, N. (1998) An Inverse Problem for General Electrical Networks. (ps, pdf, tex)

—C—

Amanda Cadieu (2004)
ab-cadieu%wiu.edu
Western Illinois University
Subgraph Recoverability
Cadieu, A. (2004) Subgraph Recoverability. (ps, pdf, tex)

Ryan Card (2000; TA, 2002, 2006, 2008)
card%math.washington.edu
University of Washington (math)
Card, R.; Muranaka, B. (2000) Using Network Amalagamation and Separation to Solve the Inverse Problem. (ps, pdf, tex)

Michael Carini (1989)
University of Washington
Carini, M.; Oslake, J. (1989) Inverse Prblem Results for Trangular and Hexagonal Networks. (scanned pdf)

Thomas Carlson (1999)
eltsyth%hotmail.com
University of Washington
Trinity Evangelical Divinity School (Deerfield, IL)
Carlson, T. (1999) A Natural Representation for a Class of Circular Planar Graphs. (ps, pdf, tex)

Angeles Carmona (Faculty, 2010)
angeles.carmona%upc.edu
Universitat Politecnica de Catalunya

Jim Carr (1991)
University of South Alabama
Carr, J. (1991) Some Computations of Conductors in a Network. (ps, pdf, tex)

Adam Chacon (2005)
adamante%gmail.com
University of Texas, Austin
Chacon, A. (2005) Graph Construction. (pdf)
Cornell University

Margaret Chaffee (1996)
University of Washington
University of Washington (biostat)
Chaffee, M.; Whitley, A. (1996) Recovering Sources in Rectangular Networks with Known Resistors. (pdf)

Nate Chandler (2008)
nathaniel.chandler%ncf.edu
New College (Florida)
Chandler, N. (2008) Rigid Homology of Graphs. (pdf)
Chandler, N. (2008) Singular Homology of Graphs. (pdf)

Tim Chang (2012)
timothy.chang@duke.edu
Duke University
Chang, T. (2012) Winning Strategies in To Knot or Not To Knot. (pdf)

Tim Chang (2011)
timothy.chang@duke.edu
Duke University
Chang, T. (2011) Winning Strategies in To Knot or Not To Knot. (pdf)

Cary Cherng (2003)
ccerng%cs.washington.edu
University of Washington
Cherng, C. (2003) The Inverse Conductivity Problem for Annular Networks. (ps, pdf, tex)
Google

Edward Chien (2008)
Edward.D.Chien%dartmouth.edu
Dartmouth
Chien, E. (2008) Boundary Value Problems on a Network and Its Dual. (pdf)
Chien, E. (2008) Figures for the paper. (pdf)

Kari Christianson (2007)
karibeth%u.washington.edu or karibeth%cs.washington.edu
Christianson, K.; Erickson, L. (2007) The Dirichlet to Neumann Map for Directed Networks. (tex, pdf)

Christopher Cook (1993)
Westfield State College
Cook, C.; Iglesias, A.; Judd, L. (1993) Locating a Diode in a Rectangular Network Using Internal Current Sources. (abstract, scanned pdf)

Christina Cook (2012)
clc009@uark.edu
University of Arkansas
Cook, C. (2012) Eigenvectors and Eigenvalues of Layered Electrical Networks. (pdf)

Jacqueline Corbitt (2008)
high.on.lif3%gmail.com
Brigham Young
Corbitt, J.; Maltiel, R. (2008) Recovering Information Starting Points. (pdf)
Corbitt, J.; Maltiel, R. (2008) New Directions for Rumor Mongers. (doc)
Corbitt, J.; Maltiel, R. (2008) Compare Rumor Methods. (sws)

Joseph Corneli (2000)
jcorneli%math.utexas.edu
University of South Florida
University of Texas (math)
Corneli, J. (2000) An extension of the class of recoverable resistor networks. (ps, pdf, tex)

Sam Coskey (2001; TA, 2003, 2004, 2005)
scoskey%u.washington.edu
University of Washington
Rutgers University
Blunk, M.; Coskey, S. (2001) Vertex Conductivity Networks. (ps, pdf, tex)
Blunk, M.; Coskey, S. (2001) Connections and Determinants. (ps, pdf, tex)

Jack Coughlin (2011)
johnbc@u.washington.edu
University of Washington
Coughlin, J. (2011) Poisson Trees. (pdf)

Robert Coury (1989)
University of Washington
Coury, R. (1989) Finding an Altered Resistor in a Cubic Network. (scanned pdf)

Michelle Covell (2001)
mcovell%vt.edu
Virginia Tech
Covell, M.; Fidkowski, C. (2001) The Discrete Inverse Scattering Problem. (ps, pdf, tex)

Matthew Curland (1988)
University of Washington

Ed Curtis (Faculty, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999)
curtis%math.washington.edu

—D—

Ryan Daileda (1997)
rdaileda%math.ucla.edu
University of Redlands
University of California, Los Angeles
University of California at Los Angeles
Bisgard, J.; Daileda, R.; Yamachika, R. (1997) Finding Broken Resistors in a Network. (scanned pdf)

Jake Danton (2005)
jjw72%dana.ucc.nau.edu
Northern Arizona University
Danton, J. (2005) Characterizing Semi-Recoverable Graphs. (pdf, ps, zip)

Meredith Daw (2010)
daw.meredith@gmail.com
University of Northern Arizona
Daw, M. (2010) MONOTONICITY OF EFFECTIVE ADMITTANCE OF A NETWORK. (pdf)

Sean DeMerchant (1994)
University of Washington
DeMerchant, S. (1994) A Study of Resistor Networks Formed of Symmetric Layered Trees. (ps, pdf, tex)

Tim DeVries (2003)
tdd2%cornell.edu
Cornell University
DeVries, T. (2003) Extending the Medial Graph to Non-Circular Planar Resistor Networks. (ps, pdf, tex)
DeVries, T. (2003) Recoverability of Random Walk Networks. (ps, pdf, tex)

Richard Dechance (1989)
Whitworth University
Dechance, R. (1989) The Idea of a Dual Network. (scanned pdf)

Dominic DiPalantino (2002)
dipalant%sas.upenn.edu
University of Pennsylvania
DiPalantino, D. (2002) Properties of Vertex Conductivity and Directed Edge Conductivity Networks. (ps, pdf, tex)
DiPalantino, D. (2002) Discrete Inverse Problems for Triangular Schrodinger and Resistor Networks. (ps, pdf, tex)

Darin Diachin (1994)
diachin%ece.nwu.edu
Colorado School of Mines
Northwestern University
Diachin, D.; Herzog, J. (1994) A continuous Inverse Conductivity Problem: The Recovery of Conductivities form Boundory Measurements. (ps, pdf, tex)

David Diamondstone (2004)
diamondstone%brandeis.edu
Brandeis University
Diamondstone, D. (2004) Connections and Determinants: A Geometric Formulation. (ps, pdf, tex)
Diamondstone, D. (2004) Walk Network Recoverability and the Card Conjecture. (ps, pdf, tex)
University of Chicago

Tam Do (2009)
tamdo%u.washington.edu
University of Washington
Do, T.; Welly, A. (2009) Recovering Conductivities on a Lattice Network via the Mixed Map. (pdf)

David Dorrough (1992)
University of California at Los Angeles
Dorrough, D. (1992) Recovering Conductors in Circular Networks with Interior Source Currents. (ps, pdf (missing figures), tex, scanned pdf)
Dorrough, D. (1992) Miscellaneous codes. (scanned pdf)

Alison Duren-Sutherland (2001)
aduren%email.smith.edu
Reed College
Duren-Sutherland, A. (2001) An Introductory Look at the Discrete Scattering Problem. (ps, pdf, tex)

Sandra Durkin (2006)
sjdurkin%email.arizona.edu
Durkin, S. (2006) Connections, Determinants, and the Differential of the Response Matrix. (pdf)
Durkin, S. (2006) Using Special Functions to Determine Injectivity on Cubic Networks. (pdf)
UW Law?

—E—

Jeff Eaton (2005)
eatonj%u.washington
University of Washington
Biesel, O.; Eaton, J. (2005) Notes on Multiple Embeddings. (pdf, ps, zip)
Biesel, O.; Eaton, J. (2005) Circular Planar Self-dual Graphs. (pdf, ps, zip)

Thaddeus Edens (1988)
University of Washington
University of Arizona (Math)
Edens, T. (1988) Calculating the Resistors in a Network. (scanned pdf)

Amy Ehrlich (1996)
aehrlich%highline.edu
Indiana University
University of Washington (math)
Ehrlich, A. (1996) Partial and Series Addition of Networks. (ps, pdf, tex)

Morgan Eichwald (2009)
morgan.eichwald%gmail.com
Montana
Burkert, J.; Eichwald, M. (2009) On the Cyclically Fully Commutative Elements of Coxeter Groups. (pdf)
Eichwald, M.; Fox, C. (2009) REU Project on Branch Polymers. (pdf)

Jeffrey Eldridge (1988)
University of Washington

Andres Encinas (Faculty, 2010)
andres.marcos.encinas%upc.edu
Universitat Politecnica de Catalunya

Peter Engrav (1989)
University of Washington
University of California at Berkeley (cs phd)
Engrav, P. (1989) Determining the Shape of a Resistor Network. ( scanned pdf)

Lindsay Erickson (2007)
lerickson%nyu.edu
Christianson, K.; Erickson, L. (2007) The Dirichlet to Neumann Map for Directed Networks. (tex, pdf)
Erickson, L. (2007) Complexers from stars. (pdf)

Ernie Esser (2000; TA, 2002, 2003, 2005, 2006, 2008)
jesser%u.washington.edu
University of Washington
University of California at Los Angeles (math)
Esser, E. (2000) On Solving the Inverse Conductivity Problem for Annular Networks. (ps, pdf, tex)

—F—

Maurice Fabien (2010)
msfabien@u.wasington.edu
University of Washington
Fabien, M. (2010) THE DIRICHLET BOUNDARY VALUE PROBLEM ON A FINITE CIRCULAR NETWORK USING EQUILIBRIUM MEASURE. (pdf)
Fabien, M. (2010) THE DIRICHLET BOUNDARY VALUE PROBLEM ON A FINITE CIRCULAR NETWORK. (pdf)

Andrew Fanoe (2007)
afanoe%nd.edu
Boothby, T.; Fanoe, A.; Zhang, T. (2007) Structure of Multiplexers on Stars. (pdf)
Fanoe, A.; Zhang, T. (2007) Structure of Multiplexers on Stars. (pdf)

Chris Fidkowski (2001)
kfid%mit.edu
Massachussetts Institute of Technology
Covell, M.; Fidkowski, C. (2001) The Discrete Inverse Scattering Problem. (ps, pdf, tex)

Eva Fornaeus (2010)
fornaeus@stanford.edu
Stanford University
Fornaeus, E.; Pardo, J. (2010) . (unavailable)

Chris Fox (2009)
chris.david.fox%gmail.com
University of Washington
Eichwald, M.; Fox, C. (2009) REU Project on Branch Polymers. (pdf)

Jennifer French (2004; TA, 2005, 2006)
jefrench%u.washington.edu
University of Washington
French, J.; Pan, J. (2004) 2^n to 1 Networks. (ps, pdf, tex)
MIT

Kristine Fromm (1992)
University of Dayton
Fromm, K.; Olsen, J. (1992) Determining Conductances in a 'Sprinkler' Network. (ps, pdf, tex)

Evan Fuller (2002)
evanf%mail.utexas.edu
University of Texas
Fuller, E. (2002) Infinite Networks in Two Dimensions. (ps, pdf, tex)

Gary Furnish (2008)
gfurnish%gfurnish.net
Utah
Furnish, G. (2008) Sage-Symbolics. (pdf)

—G—

Zack Geballe (2006)
zgeballe%umich.edu
Bayless, R.; Geballe, Z. (2006) Circular Duals of Circularly Embedded Graphs. (pdf)
Geballe, Z. (2006) How Extra Connections Ruin the Cut-Point Lemma. (pdf, tex)
Geballe, Z. (2006) How to Create Valid Medial Graphs on Genus n Riemann Surfaces. (pdf, tex)

Noah Giansiracusa (2004)
noahgian%u.washington.edu
University of Washington
Giansiracusa, N. (2004) Harmonic Graph Homomorphisms. (ps, pdf, tex)
Brown University

Jeffrey Giansiricusa (2002; TA, 2003)
jeffgian%u.washington.edu
University of Washington
Oxford University
Giansiricusa, J. (2002) The Map L and Partial Recovery in Circular Planar Non-Critical Networks. (ps, pdf, tex)
Giansiricusa, J. (2002) The Discrete Transport Equation. (ps, pdf, tex)

Peter Gilbert (1991)
University of Washington
Gilbert, P. (1991) The Percolation Behavior of Current Through Square and Cubic Resistor Networks. (scanned pdf)

Michael Goff (2003)
pepper20007%yahoo.com
Gonzaga University
Goff, M. (2003) Early version of paper below. (ps, pdf, tex)
Goff, M. (2003) Recovering Networks with Signed Conductivities. (ps, pdf, tex)
University of Washington

Igor Gorodezky (2004)
igor2006%uchicago.edu
University of Chicago
Gorodezky, I. (2004) On Embeddings of Circular Planar Graphs. (ps, pdf, tex)

Joey Greer (2007)
jgreer1%uoregon.edu

Ilya Grigoriev (2006)
ilyag%uchicago.edu
Grigoriev, I. (2006) Midterm Report. (pdf)
Grigoriev, I. (2006) Three-to-one Graphs. (pdf)
Grigoriev, I. (2006) Outline of a new paper. (pdf, tex)
Grigoriev, I. (2006) Mathematica Program. (new recover.cpp, Mathematica workbench, readme)

Max Gross (2012)
maxgross17@gmail.com
University of Maryland
Gross, M.; Marsaglia, N. (2012) Vexillary Permutations. (pdf)

Jaron Gubernick (2009)
jarong%email.arizona.edu
Arizona
Gubernick, J. (2009) Discretization of the Schrodinger Equation. (pdf)

John Guthrie (1990)
University of Washington
Guthrie, J. (1990) The Geometry of the Manifold of the Dirichlet-Neumann Map for a Square Network of Resistors. (ps, pdf, tex)

—H—

John Hardin (2010)
photonjohn314@gmail.com
University of North Carolina
Hardin, J. (2010) A Class of Non-planar Recoverable Electrical Networks. (pdf)

Kris Harper (2008)
orangejuice128%gmail.com
Chicago
Harper, K. (2008) On the Recoverability of Amalgamated and Separated Graphs Using Medial Graphs. (pdf)

James Hart (2011)
jeh6@rice.edu
Rice University
Hart, J.; Robinson, M. (2011) Various Calculations for the Continuous Electrical Conductivity Problem. (pdf)

Hila Hashemi (2005)
hila%berkeley.edu
University of California, Berkeley
Hashemi, H. (2005) Electrical Networks with Periodic Voltages and Complex Conductivities. (pdf, ps, zip)
MIT

Ben Hayes (2008; TA, 2009)
hayes_benjamin%jhotmail.com
University of Washington
Hayes, B. (2008) Sufficient Conditions for an Electrical Network to be N-to-One. (tex, dvi, pdf)
Hayes, B. (2008) Ergodicity Of Nilpotent Group Actions, Gauss's Lemma And Mixing In The Heisenberg Group. (senior thesis) (pdf)

Eliana Hechter (2005)
eliana%u.washington.edu
University of Washington
Hechter, E. (2005) Circular-Planar Graph Embedding. (tex, pdf)
Oxford University

Kyotaro Hemmi (2004)
kyotarohemmi%aol.com
University of Washington
Hemmi, K. (2004) Recovering Stars with Eigenvalues and Eigenvectors (old). (pdf)

Allison Henrich (Faculty, 2010, 2011, 2012)
allisonhenrich%gmail.com
Seattle University

James Herzog (1994)
Bowling Green State University
Diachin, D.; Herzog, J. (1994) A continuous Inverse Conductivity Problem: The Recovery of Conductivities form Boundory Measurements. (ps, pdf, tex)

Chris Higginson (1993)
University of Washington
Higginson, C. (1993) Recoverable sources in a (3x3) rectangular resistor network. (toc, scanned pdf)

Rebecca Hoberg (2012)
rahoberg@gmail.com
University of Washington
Hoberg, R.; Johnson, T.; Minten, E. (2012) The Theory of Pseudoknots. (pdf)

Mark Hoefer (1996)
mark.hoefer%colorado.edu
University of California at Los Angeles
University of Colorado
Hoefer, M. (1996) A Graphical User Interface for the Creation, Manipulatio, and Calculation of Electrical Networks. (ps, pdf, tex)
Hoefer, M. (1996) The Applet Itself. (Applet)

Todd Hollenbeck (1994)
University of Washington
Hollenbeck, T. (1994) Isolating Resistors In Cubic Networks. (abstract)
Hollenbeck, T. (1994) The Dirichlet to Neumann Map for a Cubic Resistor Network. (abstract)

Troy Holly (1988)
University of Utah

Sean Howe (2007)
spkh%email.arizona.edu

Matthew Hudelson (1989)
hudelson%math.wsu.edu
University of Washington
University of Washington (math phd)
Hudelson, M. (1989) Locating Faulty Resistors in a Network. (scanned pdf)

Rod Huston (1999)
rhuston%hw.com
Pomona College
Huston, R. (1999) The Axl Theorem. (ps, pdf, tex)

—I—

Andrew Iglesias (1993)
Westfield State College
Cook, C.; Iglesias, A.; Judd, L. (1993) Locating a Diode in a Rectangular Network Using Internal Current Sources. (abstract, scanned pdf)

David Ingerman (1992; Faculty, 2008)
ingerman%math.mit.edu
University of Washington
University of Washington (math phd)
Massachussetts Institute of Technology
Ingerman, D. (1992) Theory of Equivalent Networks and Some of its Applications. (ps, pdf, tex)

Gracie Ingermanson (2012)
gracei@u.washington.edu
University of Washington

Gracie Ingermanson (2011)
gracei@u.washington.edu
University of Washington

—J—

Derek Jerina (1996)
daj2%acpub.duke.edu
Duke University
Jerina, D. (1996) Determining the Shape of Critical Circular Planar Resistor Networks from Boundary Measurements. (ps, pdf, tex)

Chad Johnson (2004)
johncha2%iit.edu
Illinois Institute of Technology

Keith Johnson (1994)
Carleton College
University of Washington (amath)
Johnson, K. (1994) Determining the Shape of a Tree Network From Boundary Measurements. (ps, pdf, tex)

Tyler Johnson (2012)
treedj@uga.edu
University of Georgia
Hoberg, R.; Johnson, T.; Minten, E. (2012) The Theory of Pseudoknots. (pdf)
Johnson, T. (2012) Discrete Approximations to the Dirichlet Problem. (pdf)

Will Johnson (2010; TA, 2011, 2012)
willij6@u.washington.edu
University of Washington
Johnson, W. (2010) The Jacobian Determinant of the Conductivities-to-Response-Matrix Map for Well-Connected Critical Circular Planar Graphs. (pdf)
Johnson, W. (2010) Convexity and Dirchlet Problem for Directed Graphs -- the Dual Case. (pdf)
Johnson, W. (2010) Non-linear Electric Networks. (pdf)
Johnson, W. (2010) A Framework for the Addition of Knot-Type Combinatorial Games. (pdf)
Johnson, W. (2010) Recovery of Non-Linear Conductivities for Circular Planar Graphs. (pdf)
Johnson, W. (2010) Who Wins in "To Knot or Not to Knot" Played on Sums of Rational Shadows. (pdf)

Andrew Johnston (2003)
ajohnston3%hotmail.com
University of Alaska
Johnston, A. (2003) Modification of the Boundary Set for Solving the Inverse Problem. (ps, pdf, tex)

Jeremiah Jones (2007)
Jeremiah.R.Jones%asu.edu
Jones, J.; Ramos, J. (2007) The Simplest Mixed Problem. (pdf)

Laura Judd (1993)
Purdue University
Cook, C.; Iglesias, A.; Judd, L. (1993) Locating a Diode in a Rectangular Network Using Internal Current Sources. (abstract, scanned pdf)

—K—

Laura Kang (1998)
lsmkang%mit.edu
Harvard University
Massachussetts Institute of Technology (OR)
Kang, L.; Negrin, L. (1998) Layered Networks. (abstract, scanned pdf)

Courtney Kempton (2011; TA, 2012)
cykempton@gmail.com
University of Washington
Kempton, C. (2011) n-1 graphs. (pdf)

Emily Kirkman (2007)

Chad Klumb (2008; TA, 2009)
cklumb%gmail.com
University of Washington

Kjell Konis (1998)
kkonis%insightful.com
University of Washington
Konis, K. (1998) Edge Removal in Critical Steps. (toc)
Konis, K.; Mermin, J. (1998) Broken Resistors and z-sequence descent. (toc)

Benjamin Kosnik (1991)
Northwestern University

Kurt Krenz (1992)
University of Minnesota
Krenz, K. (1992) Finding Internal Transitional Probabilities from Measurements of Exiting Probabilities. (ps, pdf, tex)

Keli Kringle (1992)
Bryn Mawr College
Kringle, K. (1992) title. (scanned pdf)

Rohun Kshirsagar (2006)
rohunak%yahoo.com

—L—

Christina Lamont (1988)
University of Washington
Lamont, C. (1988) Determining the Resistance within a 3-Dimensional Network. (senior thesis) (scanned pdf, tex, pdf-no figures)

Joshua Landrum (1990)
University of Washington
Landrum, J. (1990) A Comparison of Three Algorithms for the Inverse Conductivity Problem. (text)

Alexander Leaf (2010)
aleaf@princeton.edu
Princeton University
Leaf, A. (2010) Clique Number and Chromatic Number for Permutation Graphs. (pdf)

Victor Lee (1991)
University of Washington
Massachussetts Institute of Technology (phd eecs)
Lee, V.; Mills, M. (1991) Recovering the conductance of a resistor network. (ps, pdf, tex)

Brian Lehmann (2002)
brian.lehman%yale.edu
Yale University
Lehmann, B. (2002) Recoverability of Spliced Networks. (ps, pdf, tex)

Matthew Lewandowski (2008)
mattl%sas.upenn.edu
Penn
Lewandowski, M. (2008) Determinant of a Principle Proper Submatrix of the Kirchhoff Matrix. (pdf)
Lewandowski, M. (2008) Who's Stealing My Current? (pdf)
Lewandowski, M. (2008) Logarithmic Recovery of the Tetrahedron. (mw)

Andrew Lewis (2004)
tartuffe%u.washington.edu
University of Washington
Lewis, A. (2004) Random Walk Networks. (ps, pdf, tex)
Google

Dmitriy Leykekhman (1996)
dmitriy%math.cornell.edu
New York University
Cornell University
Leykekhman, D. (1996) The Inverse boundary problem for General planar electrical networks. (ps, pdf, tex)

Jerry Li (2011)
jerryzli@u.washington.edu
University of Washington
Li, J. (2011) Eigenstuff. (pdf)
Li, J. (2011) Uniqueness of Connections between Effectively Adjacent Circular Pairs. (pdf)

Jerry Li (2010)
jerryzli@u.washington.edu
University of Washington
Li, J. (2010) Uniqueness of Connections between Eectively Adjacent Circular Pairs. (pdf)

Ming Li (2006)
mx274%u.washington.edu
Li, M. (2006) Harmonic Extension on Networks. (pdf)

Zachery Lindsey (2011)
zlindsey@utk.edu
University of Tennessee
Lindsey, Z. (2011) n-1 Graphs and Star-K. (pdf)

Eddie Lister (2011)
elister@umd.edu
University of Maryland
Lister, E. (2011) Input-Output Random Walk Networks. (pdf)

Darren Lo (1997)
lo%math.wisc.edu
University of Michigan
University of Wisconsin at Madison (math)
Blander, B.; Lo, D. (1997) Tilings. (ps, pdf, tex)

Tracy Lovejoy (2003; TA, 2004)
oedipus%u.washington.edu
University of Washington
Lovejoy, T. (2003) Two to One Networks. (ps, pdf, tex)
Lovejoy, T. (2003) Applications of the star-K Tool. (ps, pdf, tex)
Lovejoy, T. (2003) Applications of the Star-K Tool. (senior thesis) (pdf, tex)

Curt Luoto (2005)
University of Washington (graduate student)
Luoto, C. (2005) Links to Total Positivity. (pdf)

Jaime Lust (2001)
jzlust%u.washington.edu
University of Washington
Lust, J. (2001) Directed Graphs. (ps, pdf, tex)

Phillip Lynch (1996)
phil%math.uchicago.edu
University of Washington
University of Chicago (math)
Lynch, P. (1996) Infinite Networks. ( scanned pdf )

—M—

Matt Macauley (Faculty, 2009)
macaule%clemson.edu

Jeannie Mah (1989)
Tufts University
Mah, J. (1989) Comparison of Methods for Finding Resistors in a Network. (scanned pdf)

Rachael Maltiel (2008)
rmaltiel09%students.claremontmckenna.edu
Claremont-McKenna
Corbitt, J.; Maltiel, R. (2008) Recovering Information Starting Points. (pdf)
Corbitt, J.; Maltiel, R. (2008) New Directions for Rumor Mongers. (doc)
Corbitt, J.; Maltiel, R. (2008) Compare Rumor Methods. (sws)

Peter Mannisto (2005; TA, 2006, 2007, 2009, 2012)
mannisto%math.berkeley.edu
University of Washington
Mannisto, P. (2005) Another Look at Connections and Determinants. (pdf, ps, tex)
Mannisto, P.; Nishimura, J. (2005) The Cutset-Rank Corollary. (pdf, ps, tex)
UC Berkeley

Hannah Manuel (2010)
hmanue3@tigers.lsu.edu
Louisiana State Unversity
Manuel, H. (2010) . (unavailable)

Adrian Mariano (1990)
University of Washington
Mariano, A.; Myjak, M. (1990) Reconstruction of the Dirichlet to Neumann Map for a Resistor Network. (ps, pdf, tex)

Nicole Marsaglia (2012)
marsagle@uoregon.edu
University of Oregon
Gross, M.; Marsaglia, N. (2012) Vexillary Permutations. (pdf)

Justin Mauger (1992)
University of Washington
Mauger, J. (1992) title. (scanned pdf)
Phd, Northwestern, 2001
NSA

Leah McBride (2001)
leahmcbride%hotmail.com
Emporia State University
McBride, L. (2001) Numbering Boundary Nodes. (ps, pdf, tex)
McBride, L. (2001) Some extra figures. (pdf)

Trevor McCarten (2009)
trevor%mccarten.org
University of Washington
McCarten, T. (2009) Near-Equilibrium Classes of Distributions for Random Walk Networks. (pdf)

Megan McCormick (2005)
mccormick.130%osu.edu
Ohio State University
McCormick, M. (2005) Metric Recoverability. (pdf, zip)
McCormick, M. (2005) Parameterizing Response Matrices. (pdf, zip)
University of Washington

James McKeown (2011)
mckeo361@umn.edu
University of Minnesota
McKeown, J. (2011) Tricolorability Game. (pdf)

Michael McLendon (1994)
Mississippi State University
McLendon, M.; Schubert, E. (1994) Combining Critical Graphs. (ps, pdf, tex)

Nancy McNally (1991)
University of Washington
McNally, N. (1991) Applications of Iterative Schemes: The Dirichlet Problem and the Search for Current Sources in Electrical Networks. (ps, pdf, tex)

James McNutt (2007)
jmcnutt%utk.edu
Bottman, N.; McNutt, J. (2007) Neumann to Dirichlet Map. (pdf)

Nishali Mehta (2002)
nightly112%yahoo.com
University of California at Berkeley
University of California at Los Angeles
Mehta, N. (2002) The Discrete Scattering Problem. (ps, pdf, tex)

Jeffrey Mermin (1998)
jam4%acpub.duke.edu
Duke University
Konis, K.; Mermin, J. (1998) Broken Resistors and z-sequence descent. (toc)

Michael Mills (1991)
University of Washington
Lee, V.; Mills, M. (1991) Recovering the conductance of a resistor network. (ps, pdf, tex)

Elizabeth Minten (2012)
minten@email.sc.edu
University of South Carolina
Hoberg, R.; Johnson, T.; Minten, E. (2012) The Theory of Pseudoknots. (pdf)

Joe Mitchell (2007)
Joedm426%aol.com
Mitchell, J. (2007) Disallowed Connections on a Genus-g Surface. (pdf, dvi, Torus.eps)

Jami Moksness (1991)
University of Portland
Moksness, J. (1991) Using Iterative Methods to Solve the Dirichlet and Inverse Problems. (ps, pdf, tex)

Edith Mooers (1990)
edie%tracfoundation.org
University of Washington
Massachussetts Institute of Technology (math phd)
Mooers, E. (1990) Maximal Resistor Networks. (abstract, scanned pdf)

Jim Morrow (Faculty, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012)
morrow%math.washington.edu

Amanda Mueller (1998)
Amanda.R.Mueller.24%nd.edu
University of Notre Dame
Harvard University (math)
Mueller, A. (1998) Planarity of Networks with Four or Five Boundary Nodes. (ps, pdf, tex)
Mueller, A. (1998) Appendix. (ps, pdf, tex)

Matthew Munro (1993)
University of Washington
Munro, M. (1993) A Generalization into Three Dimensions of the Resistor Isolating Algorithm. (ps, pdf, tex)

Brandon Muranaka (2000)
muranaka%math.hawaii.edu
University of California at Davis
University of Hawaii
Card, R.; Muranaka, B. (2000) Using Network Amalagamation and Separation to Solve the Inverse Problem. (ps, pdf, tex)

David Muresan (1993)
University of Washington
Muresan, D. (1993) Recoverable and Unrecoverable Resistor Networks. (ps - figures missing, pdf - figures missing, tex, scanned pdf)

Aleksandr Murkes (1993)
Pomona College
Murkes, A. (1993) Recovery of networks from $\Lambda$ and $\Phi$ maps. (ps, pdf, tex)

Miriam Myjak (1990)
Seattle University
Mariano, A.; Myjak, M. (1990) Reconstruction of the Dirichlet to Neumann Map for a Resistor Network. (ps, pdf, tex)

—N—

Laura Negrin (1998)
lnegrin%hotmail.com
Columbia University
Kang, L.; Negrin, L. (1998) Layered Networks. (abstract, scanned pdf)

Derek Newland (1998)
dbnewland%ucdavis.edu
University of California at Davis

Joel Nishimura (2005)
joelnish%u.washington.edu
University of Washington
Mannisto, P.; Nishimura, J. (2005) The Cutset-Rank Corollary. (pdf, ps, tex)
Nishimura, J. (2005) The Cutset-Rank Corollary. (pdf, ps, tex)
Nishimura, J. (2005) The Inverse Problem for Directed Current Electrical Networks. (ps, pdf)
Cornell University

Eric Nitardy (2008)
nithardt%mac.com
University of Washington
Nitardy, E. (2008) The Random Walk Inner Products: A Forward and Inverse Problem. (pdf)
Nitardy, E. (2008) Random Walks on Graphs. (pdf)

—O—

Richard Oberlin (2000)
oberlin%math.wisc.edu
Florida State University
University of Wisconsin at Madison (math)
Oberlin, R. (2000) Notes on Schrodinger and conductivity networks with Tower of Hanoi graphs. (ps, pdf, tex)
Oberlin, R. (2000) Discrete inverse problems for Schrodinger and resistor networks. (ps, pdf, tex)

Julie Olsen (1992)
Humboldt State University
Fromm, K.; Olsen, J. (1992) Determining Conductances in a 'Sprinkler' Network. (ps, pdf, tex)

John Oslake (1989)
University of California at Berkeley
Carini, M.; Oslake, J. (1989) Inverse Prblem Results for Trangular and Hexagonal Networks. (scanned pdf)

Julio Oyervides (2012)
sbc_center_17@hotmail.com
University of Texas - Pan American
Oyervides, J. (2012) Annular Network with Three Rays and Two Circles and Five Rays and Three Circles. (pdf)

—P—

Simon Pai (2003)
sfpai%u.washington.edu
University of Washington
Pai, S. (2003) The Equivalence of Planarity and Circular Planarity. (ps, pdf, tex)
Pai, S. (2003) Make Them Full Rank. (ps, pdf, tex)
Pai, S. (2003) Response Matrix Decomposition on Single Connection Edges. (ps, pdf, tex)
Pai, S. (2003) Figures. (scanned pdf)

Jerry Pan (2004)
panshen%u.washington.edu
University of Washington
French, J.; Pan, J. (2004) 2^n to 1 Networks. (ps, pdf, tex)
Amazon

Elliot Paquette (TA, 2012)
elliot.paquette@gmail.com
University of Washington

John Pardo (2010)
jpardo@nd.edu
Notre Dame University
Fornaeus, E.; Pardo, J. (2010) . (unavailable)

Jeffrey Parks (2000)
jparks%pomona.edu
Pomona College
Parks, J. (2000) Large Eigenvalues and Eigenvectors for the Layered Square Lattice Networks. (ps, pdf, tex)

Michael Parks (1989)
University of Washington
University of California at Berkeley (math phd)
Parks, M. (1989) Improving the condition of the inverse problem. (ps, pdf, tex, scanned pdf of figures)
figures

David Pathakjee (2009)
pathakjee%wisc.edu
Wisconsin

Carla Pellicano (1999)
carpel%runbox.com
Massachussetts Institute of Technology
University of California, San Diego
Pellicano, C. (1999) Recovery of Transitional Probabilities from Absorption Probabilities. (ps, pdf, tex)

Karen Perry (2003)
kperry%cc.usu.edu
Utah State University
Perry, K. (2003) Discrete Complex Analysis. (ps, pdf, tex)
University of Notre Dame

Nathan Pflueger (2006)
npflueger%gmail.com
Pflueger, N. (2006) Topological Games on Self-dual and More General Graphs. (doc)
Pflueger, N. (2006) Angle Systems and Self-Duality. (pdf)

Marc Pickett (1996)
pickett%cs.umass.edu
University of Colorado
University of Massachussetts
Pickett, M. (1996) Distributed and Lumped Networks with Piecewise Constant Conductivities. (ps, pdf, tex)

Asya Pritsker (2009)
asyapritsker%hotmail.com
Rutgers
Pritsker, A. (2009) Agreement Protocols and Network Identification. (pdf)

—R—

Jaime Ramos (2007)
jjramos%utep.edu
Jones, J.; Ramos, J. (2007) The Simplest Mixed Problem. (pdf)

Nicholas Reichert (2004; TA, 2007, 2008)
nwr%u.washington.edu
University of Washington
Reichert, N. (2004) The Smallest Recoverable Flower. (ps, pdf, tex)
Reichert, N. (2004) Mobius Strips, Pinwheels, and Other Two-to-One Generalizations of N-Gon-in-N-Gon Graphs. (ps, pdf, tex)
Reichert, N. (2004) Generalized Circular Medial Graphs. (ps, pdf, tex)
Princeton University

Daniel Rim (2003)
drim%uclink.berkeley.edu
University of California at Berkeley
Rim, D. (2003) Relation Between Vertex and Edge Conductivities. (ps, pdf, tex)

Justin Robertson (2005)
justin_robertson%baylor.edu
Baylor University
Robertson, J. (2005) Extending Harmonic Germs. (pdf, ps, zip)
University of Washingon

Matt Robinson (2011; TA, 2012)
mrrobins@uark.edu
University of Arkansas
Hart, J.; Robinson, M. (2011) Various Calculations for the Continuous Electrical Conductivity Problem. (pdf)

Amanda Rohde (2005)
rohdear%rose-hulman.edu
Rose-Hulman Institute of Technology
Biesel, O.; Rohde, A. (2005) Discrete Cauchy Integrals. (dvi, pdf)
Rohde, A. (2005) Discrete Cauchy Integrals. (dvi, pdf)
University of Maryland

Chris Romero (1999)
romeroc%usc.edu
Texas A& M University (amath)
University of Southern California
Romero, C.; Twigg, C. (1999) On a Characterization of the Layered Case. (ps, pdf, tex)

Stephen Rong (2012)
stephenrong@wustl.edu
Washington University

Kevin Rosema (1992)
University of Washington
Rutgers University (math)
Rosema, K. (1992) Operations on Networks of Discrete and Generalized Conductors. (ps, pdf, tex)

Julie Rowlett (1998)
julimari%math.stanford.edu
University of Washington
Stanford (math)
Rowlett, J. (1998) Recovery and Characterization of Non-Planar Resistor Networks. (ps, pdf, tex)

Jeff Russell (2003)
jefe%stanford.edu
Stanford University
Russell, J. (2003) Convergence of solutions to discrete inverse problems. (ps, pdf, tex)
Russell, J. (2003) Recoverability of Subgraphs. (ps, pdf, tex)
Russell, J. (2003) Star and K Solve the Inverse Problem. (ps, pdf, tex)

—S—

Nitin Saksena (2002)
Saksena%fas.harvard.edu
Harvard University
Saksena, N. (2002) The Dirichlet Problem for Infinite Networks. (ps, pdf, tex)

Konrad Schroder (1992, 1993; TA, 2008)
perseant%u.washington.edu
University of Washington
Schroder, K. (1992) Square Conductor Networks of the Solar Cross Type. (ps, pdf, tex)
Schroder, K. (1993) Interpretation of Electrical Networks as Probability Networks (and vice versa). (ps, pdf, tex)
Schroder, K. (1993) Mixed-sign Conductor Networks. (ps, pdf, tex)

Erika Schubert (1994)
Wittenberg University
McLendon, M.; Schubert, E. (1994) Combining Critical Graphs. (ps, pdf, tex)

Sreekar Shastry (1997)
sshastry%umich.edu
Rutgers University
University of Michigan (math)
Shastry, S. (1997) A Computer Algorithm for Finding the Dual of a Polar Network. (ps, pdf, tex)

Spencer Shepard (1997)
shs2%acpub.duke.edu
Duke University
University of North Carolina (cs)
Shepard, S. (1997) Recovering the Conductivity of a Resistor Network from the Dirichlet-to-Neumann Map when there is a limited set of possible Resistors. (ps, pdf, tex)

Aaron Shock (2002)
ashock%mines.edu
Colorado School of Mines
Shock, A. (2002) Finite Element Discretization of the Continuous Conductivity Equation for Squared Rectangular and Cubed Parallelepiped Networks. (ps, pdf, tex)

Bill Shore (2008)
William_Shore%brown.edu
Brown
Shore, B. (2008) Layered Networks, the Discrete Laplacian, and a Continued Fraction Identity. (pdf)
Shore, B. (2008) Logarithmic Recovery of the Tetrahedron. (mw)

Olga Simek (1988)
Eastern Washington University
University of Arizona (math phd)
Simek, O. (1988) The Direct Method for a Square Network. (scanned pdf )

Justin Sinz (2000)
an98h56%hotmail.com
Cornell University
University of Chicago
Sinz, J. (2000) Use of Grobner Bases to Prove Nonrecoverability of Networks in Special Cases. (abstract, scanned pdf)

Shannon Smalley (2005)
scsmalley%rmwc.edu
Randolph-Macon Woman's College
Smalley, S. (2005) Eigenvalues and Eigenvectors for Lattice Networks. (ps, pdf)

Laura Smithies (1988)
Eastern Washington University

Stan Snelson (2008)
ses2140%columbia.edu
Columbia
Snelson, S. (2008) Discrete Inverse Transport. (pdf)
Snelson, S. (2008) Transport Equation. (pdf)

Brett Sovreign (1990)
Rice University
University of Maryland (math)
Sovreign, B. (1990) The Inverse Conductivity Problem for a Hexagonal Network. (abstract, scanned pdf)

Kimberly Spayd (2000)
kspayd%email.unc.edu
Notre Dame University
University of North Carolina (stat)
Spayd, K. (2000) Permuted Boundary Nodes of Circular Planar Networks. (scanned pdf)

Peter Staab (1990)
University of Utah
Staab, P.; Treatman, S. (1990) Determining the Conductivities of a Continuous Network By Discrete Network Approximations. (ps, pdf, tex)

Chris Staskewicz (1997)
cjs%math.utah.edu
University of California at Santa Cruz
University of Utah (math)
Staskewicz, C. (1997) Recovering the Geometry of Circular Planar Resistor Networks from Boundary Measurements. (ps, pdf, tex, scanned pdf)

William Stein (Faculty, 2005, 2006, 2007, 2008, 2009, 2011)
wstein%gmail.com

Ryan Sturgell (1998)
rsturg%cs.washington.edu
University of Washington
Sturgell, R. (1998) Disjoint Boundary-Boundary Paths in Critical Circular Planar Networks. (ps, pdf, tex)

—T—

John Thacker (1999)
thacker%math.cornell.edu
Duke University
Cornell University

Nyssa Thompson (2004)
nyssa%caltech.edu
California Institute of Technology
Thompson, N. (2004) All Recoverable Graphs with Five Boundary Nodes or Fewer. (pdf)

Justin Tittelfitz (2006; TA, 2011, 2012)
jtittelf%uoregon.edu
Tittelfitz, J. (2006) The Heat Equation on Discrete Domains. (pdf, ps, tex)
Tittelfitz, J. (2006) Spectral Results for the Graph Laplacian. (pdf, ps, tex)
University of Washington

Brady Trainor (2008)
algebrat%u.washington.edu
University of Washington

Tung Tran (1994)
Duke University
Tran, T.; Vanderweide, D. (1994) Determining the Conductors in a Network with Interior Sources of Current. (ps, pdf, tex)

Stefan Treatman (1990)
Massachussetts Institute of Technology
Staab, P.; Treatman, S. (1990) Determining the Conductivities of a Continuous Network By Discrete Network Approximations. (ps, pdf, tex)

George Tucker (2006)
gtucker%hmc.edu
Tucker, G.; Wang, T.; Whittle, S. (2006) On Numerical Recovery Methods for the Inverse Problem. (pdf)

Christopher Twigg (1999)
cdtwigg%cs.cmu.edu
University of Washington
Carnegie Mellon (cs)
Romero, C.; Twigg, C. (1999) On a Characterization of the Layered Case. (ps, pdf, tex)

—U—

Mike Usher (1999)
usher%math.mit.edu
University of California at Berkeley
Massachussetts Institute of Technology (math)
Usher, M. (1999) Determining Current Sources in a Network. (ps, pdf, tex)

—V—

David Vanderweide (1994)
Duke University
Tran, T.; Vanderweide, D. (1994) Determining the Conductors in a Network with Interior Sources of Current. (ps, pdf, tex)

Praveen Venkataraman (2007)
venkap%msvi.org
Venkataraman, P. (2007) When is a Function Everywhere Invertible? (pdf)
Venkataraman, P. (2007) Ordinary Differential Equations on Networks. (pdf)

—W—

Alex Waldorp (2011)
alexw2009@tamu.edu
Texas A&M University
Waldorp, A. (2011) RotationSystemsImbeddings. (pdf)

Ting-You Wang (2006)
tingyou%u.washington.edu
Tucker, G.; Wang, T.; Whittle, S. (2006) On Numerical Recovery Methods for the Inverse Problem. (pdf)

James Warren (1992)
University of North Texas
Texas A&M (math)
Warren, J. (1992) Locating Altered Resistors in Circular and Tetrahedronal Networks. (scanned pdf)

Jon Weed (2008)
jweed%princeton.edu
Princeton
Weed, J. (2008) Kazhdan-Lusztig Polynomials. (pdf)

Adam Welly (2009)
wellya%students.wwu.edu
Western Washington University
Do, T.; Welly, A. (2009) Recovering Conductivities on a Lattice Network via the Mixed Map. (pdf)

Aubin Whitley (1996)
awhitley%math.ucsd.edu
Reed College
University of California, San Diego (math)
Chaffee, M.; Whitley, A. (1996) Recovering Sources in Rectangular Networks with Known Resistors. (pdf)

Sam Whittle (2006)
samwhittle%comcast.net
Tucker, G.; Wang, T.; Whittle, S. (2006) On Numerical Recovery Methods for the Inverse Problem. (pdf)

Colton Willig (2009)
coltonwillig%yahoo.com
Rice
Willig, C.; Wilson, R. (2009) Eigenvalues for Response Matrices. (pdf)

Ryan Wilson (2009)
rynovia%ucla.edu
UCLA
Willig, C.; Wilson, R. (2009) Eigenvalues for Response Matrices. (pdf)

Matthew Wiser (2001)
mw004h%mail.rochester.edu
University of Rochester
Wiser, M. (2001) Recovery of Circular Annular Networks. (ps, pdf, tex)

Harrison Wong (2011)
hwong557@gmail.com
University of California at San Diego

Brent Woodhouse (2010)
bwoodhouse729@gmail.com
Purdue University
Woodhouse, B.; Zizyte, M. (2010) Enumeration of Affine Permutations Avoiding Standard Permutations. (pdf)

Cynthia Wu (2012)
cwu2@zagmail.gonzaga.edu
Gonzaga University
Wu, C. (2012) Recovering Negative Conductivities. (pdf)
Wu, C. (2012) to 1 Graphs. (pdf)
Wu, C. (2012) n to 1 Graphs. (pdf)

Hsi-Jung Wu (1988)
University of Washington
Massachussetts Institute of Technology (ee phd)

—X—

Miao Xu (2004)
mxu1%lsu.edu
Louisiana State University
Xu, M. (2004) On the Nature of Connectivity Types (Midterm). (ps, pdf, tex)
Xu, M. (2004) And, the final version. (ps, pdf, tex)

—Y—

Ryan Yamachika (1997)
ryamachi%socrates.brekeley.edu
University of Washington
University of California at Berkeley (physics)
Bisgard, J.; Daileda, R.; Yamachika, R. (1997) Finding Broken Resistors in a Network. (scanned pdf)

Neil York (1993)
Eckerd College
York, N. (1993) An Algorithm for Determining Resistors and Capacitors in a 2-Layer Network. (ps - figures missing, pdf- figures missing, tex, scanned pdf)

Jiashen You (2002)
jiashen%hawaii.edu
University of Hawaii
You, J. (2002) Solving Inverse Problems for Resistor Networks by Zipping Graphs. (ps, pdf, tex)

—Z—

Ian Zemke (2010; TA, 2011, 2012)
ianzemke@u.washington.edu
University of Washington
Zemke, I. (2010) Schroedinger Networks. (pdf)

John Zhang (2012)
jmzhang@u.washington.edu
University of Washington
Zhang, J. (2012) Parametrizing Response Matrices. (pdf)

Tracy Zhang (2007)
satrfx%u.washington.edu
Boothby, T.; Fanoe, A.; Zhang, T. (2007) Structure of Multiplexers on Stars. (pdf)
Fanoe, A.; Zhang, T. (2007) Structure of Multiplexers on Stars. (pdf)
Zhang, T. (2007) Structure of Multiplexers on Stars. (pdf)

Leonid Zheleznyak (1993)
New York University
Zheleznyak, L. (1993) \Psi Inverse Conductivity Problem. (ps, pdf, tex)

Ting Zhou (TA, 2009)
tzhou%math.washington.edu
Princeton

Milda Zizyte (2010)
mzizyte@uw.edu
University of Washington
Woodhouse, B.; Zizyte, M. (2010) Enumeration of Affine Permutations Avoiding Standard Permutations. (pdf)