If a paper has auxilliary files such as images which are needed to
compile the document, you can often find those in the same directory
as the tex source.
Many files, especially before 1995, are unavailable in electronic format. Hard copies may be obtained directly from Jim Morrow.
Sort by: First Name Last Name Year
Ingrid Abendroth (1999)
Duke University
ila%acpub.duke.edu
"Uniqueness of sources in certian 3-Dimensional Networks"
( abstract,
scanned pdf)
Tarn Adams (1998)
University of Washsington
Stanford University (math)
tarn%math.stanford.edu
"Various Counting operations on Circular Planar Graphs"
( ps,
pdf,
tex)
Nicolas Addington (2003)
University of Washington
University of Wisconsin
ntype%u.washington.edu
"Stars, Eigenvalues, and Negative Conductivities"
( ps,
pdf,
tex)
"A Method for Recovering Arbitrary Graphs"
( ps,
pdf,
tex)
...with figures combined
( ps)
The method, implemented in the c language
( tar.gz, zip)
University of Wisconsin
Rosemary Apple (2004)
Indiana University
rapple%indiana.edu
University of Edinburgh
Sasha Aravkin (2002)
University of Washington
aleksand%u.washington.edu
"Transfinite Networks"
( ps,
pdf,
tex)
Eric Auld (1990)
Massachussetts Institute of Technology
"Looking for a Diode in a 2-Dimensional Network"
( ps,
pdf,
tex)
Jennifer Balakrishnan (2006)
jennifer.balakrishnan%gmail.com
MIT
Timothy Banham (2006)
tsbanham%u.washington.edu
The Heat Equation and Periodic Boundary Conditions
( pdf)
The Laplacian and the Hot Spot Conjecture
( pdf)
UCSD
Orion Bawdon (2005)
University of Washington
orion%cs.washington.edu
University of Wisconsin
Rachel Bayless (2006)
rachelbayless%gmail.com
Circular Duals of Circularly Embedded Graphs
( pdf)
Parametrizing Response Matrices
( pdf)
Sara Beavers (1988)
University of Washington
Owen Biesel (2005)
University of Washington
obiesel%u.washington.edu
Discrete Cauchy Integrals
( dvi
pdf)
(Additional figures Fig_1.eps
Fig_2.eps
Fig_3.eps)
Notes on Multiple Embeddings
( pdf
ps
zip)
Circular Planar Self-dual Graphs
( pdf
ps
zip)
Cambridge University
James Bisgard (1997)
University of Washington
University of Wisconsin at Madison (math)
bisgard%math.wisc.edu
"Finding Broken Resistors in a Network"
( scanned pdf)
Benjamin Blander (1997)
University of Chicago
bblander%math.uchicago.edu
"Tilings"
( ps,
pdf,
tex)
Mark Blunk (2001)
University of Washington
University of California at Los Angeles
zeponinn%u.washington.edu
"Vertex Conductivity Networks"
( ps,
pdf,
tex)
"Connections and Determinants"
( ps,
pdf,
tex)
Tom Boothby (2007)
boothby%u.washington.edu
Structure of Multiplexers on Stars
( pdf)
Senior Thesis
( pdf, tar.gz, zip)
Nate Bottman (2007)
drbott%u.washington.edu
On the Discretized Cauchy Problem
( pdf)
Neumann to Dirichlet Map
( pdf)
Connections and Neumann to Dirichlet Map
Kia Braha (2011)
Seattle University
brahae@seattleu.edu
Knot Games and Winning Strategies
Knot Games Results
Nathan Bramall (1994)
University of Washington
University of California at Berkeley (physics)
bramall%physics.berkeley.edu
"Determining Resistors in a Network with Boundary Conditions in One Step"
( scanned pdf)
[editor's note: this paper is extremely informative and has many nice
illustrations.]
Michael Buksas (1991)
Harvey Mudd College
Mark Bun (2010)
University of Washington
markmbun@cs.washington.edu
Convex Sets
Unsolved
Problems In Intuitive Geometry
Mark Bun (2009)
University of Washington
markmbun%u.washington.edu
Applications of the Levenberg-Marquardt Algorithm to the Inverse Problem
Jeffrey Burkert (2009)
Harvey Mudd
jeffrey.burkert%gmail.com
The Characteristic Polynomial of an Electrical Network
Enumerating Spanning Trees with Determinants
On the Cyclically Fully Commutative Elements of Coxeter Groups
Michael Burr (2003)
Tufts University
mburr01%tufts.edu
"Analysis and Efficiencyof Jeffrey Giansiricusa's Algorithm for Partial
Recovery"
( ps,
pdf,
tex)
"Unique Solutions for the Drirchlet Inverse Problem on Schrodinger
Networks"
( ps,
pdf,
tex)
Neil Burrell (1998)
Harvey Mudd College
University of Colorado (amath)
burrelln%colorado.edu
"An Inverse Problem for General Electrical Networks"
( ps,
pdf,
tex)
Amanda Cadieu (2004)
Western Illinois University
ab-cadieu%wiu.edu
Subgraph Recoverability
Subgraph Recoverability
( ps,
pdf
tex)
Ryan Card (2000)
University of Washington (math)
card%math.washington.edu
"Using Network Amalagamation and Separation to Solve the Inverse Problem"
( ps,
pdf,
tex)
[editor's note: this paper is worth looking at! Not only is it
extremely interesting, but there is lots of good matlab code and the
graphics are done in LaTeX]
Michael Carini (1989)
University of Washington
"Inverse Prblem Results for Trangular and Hexagonal Networks"
( scanned pdf)
Thomas Carlson (1999)
University of Washington
Trinity Evangelical Divinity School (Deerfield, IL)
eltsyth%hotmail.com
"A Natural Representation for a Class of Circular Planar Graphs"
( ps,
pdf,
tex)
Jim Carr (1991)
University of South Alabama
"Some Computations of Conductors in a Network"
( ps,
pdf,
tex) (results missing)
Adam Chacon (2005)
University of Texas, Austin
adamante%gmail.com
Graph Construction
( pdf)
Cornell University
Margaret Chaffee (1996)
University of Washington
University of Washington (biostat)
"Recovering Sources in Rectangular Networks with Known Resistors"
( pdf) (scan)
Nate Chandler (2008)
New College (Florida)
nathaniel.chandler%ncf.edu
Rigid Homology of Graphs ( pdf)
Singular Homology of Graphs ( pdf)
Tim Chang (2012)
Duke University
timothy.chang@duke.edu
Winning Strategies in To Knot or Not To Knot
Tim Chang (2011)
Duke University
timothy.chang@duke.edu
Winning Strategies in To Knot or Not To Knot
Cary Cherng (2003)
University of Washington
ccerng%cs.washington.edu
"The Inverse Conductivity Problem for Annular Networks"
( ps,
pdf,
tex)
Google
Edward Chien (2008)
Dartmouth
Edward.D.Chien%dartmouth.edu
Boundary Value Problems on a Network and Its Dual ( pdf)
Figures for the paper ( pdf)
Kari Christianson (2007)
karibeth%u.washington.edu or karibeth%cs.washington.edu
The Dirichlet to Neumann Map for Directed Networks
( tex, pdf)
Christina Cook (2012)
University of Arkansas
clc009@uark.edu
Eigenvectors and Eigenvalues of Layered
Electrical Networks
Christopher Cook (1993)
Westfield State College
"Locating a Diode in a Rectangular Network Using Internal Current Sources"
( abstract,
scanned pdf)
Jacqueline Corbitt (2008)
Brigham Young
high.on.lif3%gmail.com
Recovering Information Starting Points ( pdf)
New Directions for Rumor Mongers ( doc)
Compare Rumor Methods ( sws)
Joseph Corneli (2000)
University of South Florida
University of Texas (math)
jcorneli%math.utexas.edu
"An extension of the class of recoverable resistor networks"
( ps,
pdf,
tex)
Sam Coskey (2001)
University of Washington
scoskey%u.washington.edu
Rutgers University
See Blunk for papers
Jack Coughlin (2011)
University of Washington
johnbc@u.washington.edu
Poisson Trees
Robert Coury (1989)
University of Washington
"Finding an Altered Resistor in a Cubic Network"
( scanned pdf)
Michelle Covell (2001)
Virginia Tech
mcovell%vt.edu
"The Discrete Inverse Scattering Problem"
( ps,
pdf,
tex)
Matthew Curland (1988)
University of Washington
Ryan Daileda (1997)
University of Redlands
University of California, Los Angeles
rdaileda%math.ucla.edu
University of California at Los Angeles
See Bisgard for papers
Jake Danton (2005)
Northern Arizona University
jjw72%dana.ucc.nau.edu
Characterizing Semi-Recoverable Graphs
( pdf
ps
zip)
Richard Dechance (1989)
Whitworth University
"The Idea of a Dual Network"
( scanned pdf)
Sean DeMerchant (1994)
University of Washington
"A Study of Resistor Networks Formed of Symmetric Layered Trees"
( ps,
pdf,
tex)
Tim DeVries (2003)
Cornell University
tdd2%cornell.edu
"Extending the Medial Graph to Non-Circular Planar Resistor Networks"
( ps,
pdf,
tex)
"Recoverability of Random Walk Networks"
( ps,
pdf,
tex)
Darin Diachin (1994)
Colorado School of Mines
Northwestern University
diachin%ece.nwu.edu
"A continuous Inverse Conductivity Problem: The Recovery of
Conductivities form Boundory Measurements"
( ps,
pdf,
tex)
David Diamondstone (2004)
Brandeis University
diamondstone%brandeis.edu
Connections and Determinants: A Geometric Formulation
( ps,
pdf,
tex)
Walk Network Recoverability and the Card Conjecture
( ps,
pdf,
tex)
University of Chicago
Dominic DiPalantino (2002)
University of Pennsylvania
dipalant%sas.upenn.edu
"Properties of Vertex Conductivity and Directed Edge Conductivity Networks"
( ps,
pdf,
tex)
"Discrete Inverse Problems for Triangular Schrodinger and Resistor
Networks"
( ps,
pdf,
tex)
Tam Do (2009)
University of Washington
tamdo%u.washington.edu
Recovering Conductivities on a Lattice Network via the Mixed Map
David Dorrough (1992)
University of California at Los Angeles
"Recovering Conductors in Circular Networks with Interior Source Currents"
( ps,
pdf (missing figures),
tex
scanned pdf)
Miscellaneous codes
( scanned pdf)
Alison Duren-Sutherland (2001)
Reed College
aduren%email.smith.edu
"An Introductory Look at the Discrete Scattering Problem"
( ps,
pdf,
tex)
Sandra Durkin (2006)
sjdurkin%email.arizona.edu
Connections, Determinants, and the Differential of the Response Matrix
( pdf)
Using Special Functions to Determine Injectivity on Cubic Networks
( pdf)
UW Law?
Jeff Eaton (2005)
University of Washington
eatonj%u.washington
Notes on Multiple Embeddings
( pdf
ps
zip)
Circular Planar Self-dual Graphs
( pdf
ps
zip)
Thaddeus Edens (1988)
University of Washington
University of Arizona (Math)
"Calculating the Resistors in a Network"
( scanned pdf)
Amy Ehrlich (1996)
Indiana University
University of Washington (math)
aehrlich%highline.edu
"Partial and Series Addition of Networks"
( ps,
pdf,
tex)
Morgan Eichwald (2009)
Montana
morgan.eichwald%gmail.com
On the Cyclically Fully Commutative Elements of Coxeter Groups
REU Project on Branch Polymers
Jeffrey Eldridge (1988)
University of Washington
Peter Engrav (1989)
University of Washington
University of California at Berkeley (cs phd)
"Determining the Shape of a Resistor Network"
( scanned pdf)
Lindsay Erickson (2007)
lerickson%nyu.edu
The Dirichlet to Neumann Map for Directed Networks
( tex, pdf)
Complexers from stars
( pdf)
Ernie Esser (2000)
University of Washington
jesser%u.washington.edu
University of California at Los Angeles (math)
"On Solving the Inverse Conductivity Problem for Annular Networks"
( ps,
pdf,
tex)
Maurice Fabien (2010)
University of Washington
msfabien@u.wasington.edu
THE DIRICHLET BOUNDARY VALUE PROBLEM ON A FINITE
CIRCULAR NETWORK USING EQUILIBRIUM MEASURE
THE DIRICHLET BOUNDARY VALUE PROBLEM ON A FINITE
CIRCULAR NETWORK
Andrew Fanoe (2007)
afanoe%nd.edu
Structure of Multiplexers on Stars
( pdf), final paper ( pdf)
Chris Fidkowski (2001)
Massachussetts Institute of Technology
kfid%mit.edu
See Covell for papers
Eva Fornaeus (2010)
Stanford University
fornaeus@stanford.edu
Knot Defeat is a Victory
Chris Fox (2009)
University of Washington
chris.david.fox%gmail.com
REU Project on Branch Polymers
Jennifer French (2004)
University of Washington
jefrench%u.washington.edu
2^n to 1 Networks
( ps,
pdf,
tex)
MIT
Kristine Fromm (1992)
University of Dayton
"Determining Conductances in a 'Sprinkler' Network"
( ps,
pdf,
tex)
Evan Fuller (2002)
University of Texas
evanf%mail.utexas.edu
"Infinite Networks in Two Dimensions"
( ps,
pdf,
tex) (figures missing)
Gary Furnish (2008)
Utah
gfurnish%gfurnish.net
Sage-Symbolics ( pdf)
Zack Geballe (2006)
zgeballe%umich.edu
Circular Duals of Circularly Embedded Graphs
( pdf)
How Extra Connections Ruin the Cut-Point Lemma
( pdf, tex)
How to Create Valid Medial Graphs on Genus n Riemann Surfaces
( pdf, tex)
Noah Giansiracusa (2004)
University of Washington
noahgian%u.washington.edu
Harmonic Graph Homomorphisms
( ps,
pdf,
tex)
Brown University
Jeffrey Giansiricusa (2002)
University of Washington
Oxford University
jeffgian%u.washington.edu
"The Map L and Partial Recovery in Circular Planar Non-Critical
Networks"
( ps,
pdf,
tex)
"The Discrete Transport Equation"
( ps,
pdf,
tex)
Peter Gilbert (1991)
University of Washington
"The Percolation Behavior of Current Through Square and Cubic Resistor
Networks"
( scanned pdf)
Michael Goff (2003)
Gonzaga University
pepper20007%yahoo.com
Early version of paper below
( ps,
pdf,
tex)
"Recovering Networks with Signed Conductivities"
( ps,
pdf,
tex)
University of Washington
Igor Gorodezky (2004)
University of Chicago
igor2006%uchicago.edu
On Embeddings of Circular Planar Graphs
( ps,
pdf,
tex)
Joey Greer (2007)
jgreer1%uoregon.edu
Ilya Grigoriev (2006)
ilyag%uchicago.edu
Midterm Report
( pdf)
Three-to-one Graphs
( pdf)
Outline of a new paper
( pdf, tex)
Mathematica Program
( new recover.cpp, Mathematica workbench, readme)
Max Gross (2012)
University of Maryland
maxgross17@gmail.com
Vexillary Permutations
Jaron Gubernick (2009)
Arizona
jarong%email.arizona.edu
Discretization of the Schrodinger Equation
John Guthrie (1990)
University of Washington
"The Geometry of the Manifold of the Dirichlet-Neumann Map for a
Square Network of Resistors"
( ps,
pdf,
tex)
John Hardin (2010)
University of North Carolina
photonjohn314@gmail.com
A Class of Non-planar Recoverable Electrical Networks
Kris Harper (2008)
Chicago
orangejuice128%gmail.com
On the Recoverability of Amalgamated and Separated Graphs Using Medial Graphs ( pdf)
James Hart (2011)
Rice University
jeh6@rice.edu
Various Calculations for the Continuous Electrical Conductivity Problem
Hila Hashemi (2005)
University of California, Berkeley
hila%berkeley.edu
Electrical Networks with Periodic Voltages and Complex Conductivities
( pdf
ps
zip)
MIT
Ben Hayes (2008)
University of Washington
hayes_benjamin%jhotmail.com
Sufficient Conditions for an Electrical Network to be N-to-One ( tex, dvi, pdf)
ERGODICITY OF NILPOTENT GROUP ACTIONS, GAUSS'S LEMMA AND MIXING IN THE HEISENBERG GROUP
Eliana Hechter (2005)
University of Washington
eliana%u.washington.edu
Circular-Planar Graph Embedding
( tex
pdf)
Oxford University
Kyotaro Hemmi (2004)
University of Washington
kyotarohemmi%aol.com
Recovering Stars with Eigenvalues and Eigenvectors (old)
( pdf)
James Herzog (1994)
Bowling Green State University
See Diachin for papers
Chris Higginson (1993)
University of Washington
"Recoverable sources in a (3x3) rectangular resistor network"
( toc,
scanned pdf)
Rebecca Hoberg (2012)
University of Washington
rahoberg@gmail.com
The Theory of Pseudoknots
Mark Hoefer (1996)
University of California at Los Angeles
University of Colorado
mark.hoefer%colorado.edu
"A Graphical User Interface for the Creation, Manipulatio, and
Calculation of Electrical Networks"
( ps,
pdf,
tex)
And, the applet itself.
Todd Hollenbeck (1994)
University of Washington
"Isolating Resistors In Cubic Networks"
( abstract)
"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)
University of Washington
University of Washington (math phd)
hudelson%math.wsu.edu
"Locating Faulty Resistors in a Network"
( scanned pdf)
Rod Huston (1999)
Pomona College
rhuston%hw.com
"The Axl Theorem"
( ps,
pdf,
tex)
Andrew Iglesias (1993)
Westfield State College
See Cook for papers
David Ingerman (1992)
University of Washington
University of Washington (math phd)
Massachussetts Institute of Technology
ingerman%math.mit.edu
"Theory of Equivalent Networks and Some of its Applications"
( ps,
pdf,
tex)
Gracie Ingermanson (2012)
University of Washington
gracei@u.washington.edu
Gracie Ingermanson (2011)
University of Washington
gracei@u.washington.edu
Derek Jerina (1996)
Duke University
daj2%acpub.duke.edu
"Determining the Shape of Critical Circular Planar Resistor Networks from
Boundary Measurements"
( ps,
pdf,
tex)
Chad Johnson (2004)
Illinois Institute of Technology
johncha2%iit.edu
Keith Johnson (1994)
Carleton College
University of Washington (amath)
"Determining the Shape of a Tree Network From Boundary Measurements"
( ps,
pdf,
tex)
Lee Johnson (2012)
Seattle University
johns193@seattleu.edu
The Theory of Pseudoknots
Tyler Johnson (2012)
University of Georgia
treedj@uga.edu
Will Johnson (2010)
University of Washington
willij6@u.washington.edu
Convexity and the Dirichlet Problem for
Directed Networks
Non-linear Electric Networks
The Jacobian Determinant of the Conductivities-to-Response-Matrix Map for Well-Connected Critical Circular Planar Graphs
Convexity and Dirchlet Problem for Directed Graphs -- the Dual Case
A Framework for the Addition of Knot-Type Combinatorial Games
Recovery of Non-Linear Conductivities for Circular Planar Graphs
Who Wins in "To Knot or Not to Knot" Played on Sums of Rational Shadows
Andrew Johnston (2003)
University of Alaska
ajohnston3%hotmail.com
"Modification of the Boundary Set for Solving the Inverse Problem"
( ps,
pdf,
tex)
Jeremiah Jones (2007)
Jeremiah.R.Jones%asu.edu
The Simplest Mixed Problem
( pdf)
Laura Judd (1993)
Purdue University
See Cook for papers
Laura Kang (1998)
Harvard University
Massachussetts Institute of Technology (OR)
lsmkang%mit.edu
"Layered Networks"
( abstract,
scanned pdf)
Courtney Kempton (2011)
University of Washington
cykempton@gmail.com
n-1 graphs
Emily Kirkman (2007)
Chad Klumb (2008)
University of Washington
cklumb%gmail.com
Kjell Konis (1998)
University of Washington
kkonis%insightful.com
"Edge Removal in Critical Steps"
( toc)
"Broken Resistors and z-sequence descent"
( toc)
Benjamin Kosnik (1991)
Northwestern University
Kurt Krenz (1992)
University of Minnesota
"Finding Internal Transitional Probabilities from Measurements of
Exiting Probabilities"
( ps,
pdf,
tex)
Keli Kringle (1992)
Bryn Mawr College
"title"
( scanned pdf)
Rohun Kshirsagar (2006)
rohunak%yahoo.com
Christina Lamont (1988)
University of Washington
"Determining the Resistance within a 3-Dimensional Network"
(senior thesis)
( scanned pdf,
tex,
pdf-no figures)
Joshua Landrum (1990)
University of Washington
"A Comparison of Three Algorithms for the Inverse Conductivity Problem"
( text)
Alexander Leaf (2010)
Princeton University
aleaf@princeton.edu
Clique Number and Chromatic Number
for Permutation Graphs
Victor Lee (1991)
University of Washington
Massachussetts Institute of Technology (phd eecs)
"Recovering the conductance of a resistor network"
( ps,
pdf,
tex)
Brian Lehmann (2002)
Yale University
brian.lehman%yale.edu
"Recoverability of Spliced Networks"
( ps,
pdf,
tex)
Matthew Lewandowski (2008)
Penn
mattl%sas.upenn.edu
Determinant of a Principle Proper Submatrix of the Kirchhoff Matrix ( pdf)
Who's Stealing My Current? ( pdf)
Logarithmic Recovery of the Tetrahedron ( mw)
Andrew Lewis (2004)
University of Washington
tartuffe%u.washington.edu
Random Walk Networks
( ps,
pdf,
tex)
Google
Dmitriy Leykekhman (1996)
New York University
Cornell University
dmitriy%math.cornell.edu
"The Inverse boundary problem for General planar electrical networks"
( ps,
pdf,
tex)
Jerry Li (2010)
University of Washington
jerryzli@u.washington.edu
Uniqueness of Connections between Eectively
Adjacent Circular Pairs
Jerry Li (2011)
University of Washington
jerryzli@u.washington.edu
Uniqueness of Connections between Effectively
Adjacent Circular Pairs
Eigenstuff
Ming Li (2006)
mx274%u.washington.edu
Harmonic Extension on Networks
( pdf)
Zachery Lindsey (2011)
University of Tennessee
zlindsey@utk.edu
n-1 Graphs and Star-K
Eddie Lister (2011)
University of Maryland
elister@umd.edu
Input-Output Random Walk Networks
Darren Lo (1997)
University of Michigan
University of Wisconsin at Madison (math)
lo%math.wisc.edu
See Blander for papers
Tracy Lovejoy (2003)
University of Washington
oedipus%u.washington.edu
"Two to One Networks"
( ps,
pdf,
tex)
"Applications of the star-K Tool"
( ps,
pdf,
tex)
"Applications of the Star-K Tool (Senior Thesis/Update)
( pdf,
tex)
University of Washington
Curt Luoto (2005)
University of Washington (graduate student)
Links to Total Positivity
( pdf)
Jaime Lust (2001)
University of Washington
jzlust%u.washington.edu
"Directed Graphs"
( ps,
pdf,
tex)
Phillip Lynch (1996)
University of Washington
University of Chicago (math)
phil%math.uchicago.edu
"Infinite Networks"
( scanned pdf )
Jeannie Mah (1989)
Tufts University
"Comparison of Methods for Finding Resistors in a Network"
( scanned pdf)
Rachael Maltiel (2008)
Claremont-McKenna
rmaltiel09%students.claremontmckenna.edu
Recovering Information Starting Points ( pdf)
New Directions for Rumor Mongers ( doc)
Compare Rumor Methods ( sws)
Peter Mannisto (2005)
University of Washington
lpm316%u.washington.edun
Another Look at Connections and Determinants
( pdf
ps
tex)
The Cutset-Rank Corollary
( pdf
ps
tex)
Cal Berkeley
Hannah Manuel (2010)
Louisiana State Unversity
hmanue3@tigers.lsu.edu
Representing Permutaions as Links
Adrian Mariano (1990)
University of Washington
"Reconstruction of the Dirichlet to Neumann Map for a Resistor Network"
( ps,
pdf,
tex)
Nicole Marsaglia (2012)
University of Oregon
marsagle@uoregon.edu
Vexillary Permutations
Justin Mauger (1992)
University of Washington
"title"
( scanned pdf)
Phd, Northwestern, 2001
NSA
Leah McBride (2001)
Emporia State University
leahmcbride%hotmail.com
"Numbering Boundary Nodes"
( ps,
pdf,
tex)
Some extra figures
( pdf)
Trevor McCarten (2009)
University of Washington
trevor%mccarten.org
Near-Equilibrium Classes of Distributions for Random Walk Networks
Megan McCormick (2005)
Ohio State University
mccormick.130%osu.edu
Metric Recoverability
( pdf
zip)
Parameterizing Response Matrices
( pdf
zip)
University of Washington
James McKeown (2011)
University of Minnesota
mckeo361@umn.edu
Tricolorability Game
Michael McLendon (1994)
Mississippi State University
"Combining Critical Graphs"
( ps,
pdf,
tex)
Nancy McNally (1991)
University of Washington
"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
Neumann to Dirichlet Map
( pdf)
Nishali Mehta (2002)
University of California at Berkeley
University of California at Los Angeles
nightly112%yahoo.com
"The Discrete Scattering Problem"
( ps,
pdf,
tex)
Jeffrey Mermin (1998)
Duke University
jam4%acpub.duke.edu
See Konis for "Broken Resistors and z-sequence descent"
Michael Mills (1991)
University of Washington
Elizabeth Minten (2012)
University of South Carolina
minten@email.sc.edu
The Theory of Pseudoknots
Joe Mitchell (2007)
Joedm426%aol.com
Disallowed Connections on a Genus-g Surface
( pdf, dvi, Torus.eps)
Jami Moksness (1991)
University of Portland
"Using Iterative Methods to Solve the Dirichlet and Inverse Problems"
( ps,
pdf,
tex)
Edith Mooers (1990)
University of Washington
Massachussetts Institute of Technology (math phd)
edie%tracfoundation.org
"Maximal Resistor Networks"
( abstract
scanned pdf)
Amanda Mueller (1998)
University of Notre Dame
Amanda.R.Mueller.24%nd.edu
Harvard University (math)
"Planarity of Networks with Four or Five Boundary Nodes"
( ps,
pdf,
tex)
Appendix
( ps,
pdf,
tex)
Matthew Munro (1993)
University of Washington
"A Generalization into Three Dimensions of the Resistor Isolating
Algorithm"
( ps,
pdf,
tex)
Brandon Muranaka (2000)
University of California at Davis
University of Hawaii
muranaka%math.hawaii.edu
See Card for papers
David Muresan (1993)
University of Washington
"Recoverable and Unrecoverable Resistor Networks"
( ps - figures missing,
pdf - figures missing,
tex,
scanned pdf)
Aleksandr Murkes (1993)
Pomona College
"Recovery of networks from $\Lambda$ and $\Phi$ maps"
( ps,
pdf,
tex)
Miriam Myjak (1990)
Seattle University
See Mariano for papers
Laura Negrin (1998)
Columbia University
lnegrin%hotmail.com
See Kang for papers
Derek Newland (1998)
University of California at Davis
dbnewland%ucdavis.edu
See Konis for "Broken Resistors and z-sequence descent"
Joel Nishimura (2005)
University of Washington
joelnish%u.washington.edu
The Cutset-Rank Corollary
( pdf
ps
tex)
The Inverse Problem for Directed Current Electrical Networks
( ps
pdf)
Cornell University
Eric Nitardy (2008)
University of Washington
nithardt%mac.com
The Random Walk Inner Products: A Forward and Inverse Problem ( pdf)
Random Walks on Graphs ( pdf)
Richard Oberlin (2000)
Florida State University
University of Wisconsin at Madison (math)
oberlin%math.wisc.edu
"Notes on Schrodinger and conductivity networks with Tower of Hanoi graphs"
( ps,
pdf,
tex)
"Discrete inverse problems for Schrodinger and resistor networks"
( ps,
pdf,
tex)
Julie Olsen (1992)
Humboldt State University
See Fromm for papers
John Oslake (1989)
University of California at Berkeley
See Carini for papers
Julio Oyervides (2012)
University of Texas - Pan American
sbc_center_17@hotmail.com
Annular Network with Three Rays and Two Circles and Five Rays and Three Circles
Simon Pai (2003)
University of Washington
sfpai%u.washington.edu
"The Equivalence of Planarity and Circular Planarity"
( ps,
pdf,
tex)
"Make Them Full Rank"
( ps,
pdf,
tex)
"Response Matrix Decomposition on Single Connection Edges"
( ps,
pdf,
tex)
Figures
( scanned pdf)
Jerry Pan (2004)
University of Washington
panshen%u.washington.edu
See French for papers
Amazon
John Pardo (2010)
Notre Dame University
jpardo@nd.edu
Knot Defeat is a Victory
Jeffrey Parks (2000)
Pomona College
jparks%pomona.edu
"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)
"Improving the condition of the inverse problem"
( ps,
pdf,
tex,
scanned pdf of figures)
figures
David Pathakjee (2009)
Wisconsin
pathakjee%wisc.edu
Carla Pellicano (1999)
Massachussetts Institute of Technology
University of California, San Diego
carpel%runbox.com
"Recovery of Transitional Probabilities from Absorption Probabilities"
( ps,
pdf,
tex)
Karen Perry (2003)
Utah State University
kperry%cc.usu.edu
"Discrete Complex Analysis"
( ps,
pdf,
tex)
University of Notre Dame
Nathan Pflueger (2006)
npflueger%gmail.com
Topological Games on Self-dual and More General Graphs
( doc)
Angle Systems and Self-Duality
( pdf)
Marc Pickett (1996)
University of Colorado
University of Massachussetts
pickett%cs.umass.edu
"Distributed and Lumped Networks with Piecewise Constant Conductivities"
( ps,
pdf,
tex)
Asya Pritsker (2009)
Rutgers
asyapritsker%hotmail.com
Agreement Protocols and Network Identification
Jaime Ramos (2007)
jjramos%utep.edu
Mixed Problems
( pdf)
Nicholas Reichert (2004)
University of Washington
nwr%u.washington.edu
The Smallest Recoverable Flower
( ps,
pdf,
tex)
Mobius Strips, Pinwheels, and Other Two-to-One Generalizations of N-Gon-in-N-Gon Graphs
( ps,
pdf,
tex)
Generalized Circular Medial Graphs
( ps,
pdf,
tex)
Princeton University
Daniel Rim (2003)
University of California at Berkeley
drim%uclink.berkeley.edu
"Relation Between Vertex and Edge Conductivities"
( ps,
pdf,
tex)
Justin Robertson (2005)
Baylor University
justin_robertson%baylor.edu
Extending Harmonic Germs
( pdf
ps
zip)
University of Washingon
Matt Robinson (2011)
University of Arkansas
mrrobins@uark.edu
Various Calculations for the Continuous Electrical Conductivity Problem
Amanda Rohde (2005)
Rose-Hulman Institute of Technology
rohdear%rose-hulman.edu
Discrete Cauchy Integrals
( dvi
pdf)
University of Maryland
Chris Romero (1999)
Texas A\& M University (amath)
University of Southern California
romeroc%usc.edu
"On a Characterization of the Layered Case"
( ps,
pdf,
tex)
Stephen Rong (2012)
Washington University
stephenrong@wustl.edu
Kevin Rosema (1992)
University of Washington
Rutgers University (math)
"Operations on Networks of Discrete and Generalized Conductors"
( ps,
pdf,
tex)
Julie Rowlett (1998)
University of Washington
Stanford (math)
julimari%math.stanford.edu
"Recovery and Characterization of Non-Planar Resistor Networks"
( ps,
pdf,
tex)
Jeff Russell (2003)
Stanford University
jefe%stanford.edu
"Convergence of solutions to discrete inverse problems"
( ps,
pdf,
tex)
"Recoverability of Subgraphs"
( ps,
pdf,
tex)
"Star and K Solve the Inverse Problem"
( ps,
pdf,
tex)
Nitin Saksena (2002)
Harvard University
Saksena%fas.harvard.edu
"The Dirichlet Problem for Infinite Networks"
( ps,
pdf,
tex) (figures missing)
Konrad Schroder (1993)
perseant%hitl.washington.edu
University of Washington
"Interpretation of Electrical Networks as Probability Networks
(and vice versa)"
( ps,
pdf,
tex)
"Mixed-sign Conductor Networks"
( ps,
pdf,
tex)
Konrad Schroder (1992)
University of Washington
[email listed under 1993]
"Square Conductor Networks of the Solar Cross Type"
( ps,
pdf,
tex) (figures missing)
Erika Schubert (1994)
Wittenberg University
See McLendon for papers
Sreekar Shastry (1997)
Rutgers University
University of Michigan (math)
sshastry%umich.edu
"A Computer Algorithm for Finding the Dual of a Polar Network"
( ps,
pdf,
tex)
Spencer Shepard (1997)
Duke University
shs2%acpub.duke.edu
University of North Carolina (cs)
"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)
Colorado School of Mines
ashock%mines.edu
"Finite Element Discretization of the Continuous Conductivity Equation for Squared Rectangular and Cubed Parallelepiped Networks"
( ps,
pdf,
tex)
Bill Shore (2008)
Brown
William_Shore%brown.edu
Layered Networks, the Discrete Laplacian, and a Continued Fraction Identity ( pdf)
Logarithmic Recovery of the Tetrahedron ( mw)
Olga Simek (1988)
Eastern Washington University
University of Arizona (math phd)
"The Direct Method for a Square Network"
( scanned pdf )
Justin Sinz (2000)
Cornell University
an98h56%hotmail.com
University of Chicago
"Use of Grobner Bases to Prove Nonrecoverability of Networks in Special
Cases"
( abstract,
scanned pdf)
Shannon Smalley (2005)
Randolph-Macon Woman's College
scsmalley%rmwc.edu
Eigenvalues and Eigenvectors for Lattice Networks
( ps pdf)
Laura Smithies (1988)
Eastern Washington University
Stan Snelson (2008)
Columbia
ses2140%columbia.edu
Discrete Inverse Transport ( pdf)
Transport Equation ( pdf)
Brett Sovreign (1990)
Rice University
University of Maryland (math)
"The Inverse Conductivity Problem for a Hexagonal Network"
( abstract
scanned pdf)
Kimberly Spayd (2000)
Notre Dame University
University of North Carolina (stat)
kspayd%email.unc.edu
"Permuted Boundary Nodes of Circular Planar Networks"
( scanned pdf)
Peter Staab (1990)
University of Utah
"Determining the Conductivities of a Continuous Network By Discrete
Network Approximations"
( ps,
pdf,
tex)
Chris Staskewicz (1997)
University of California at Santa Cruz
University of Utah (math)
cjs%math.utah.edu
"Recovering the Geometry of Circular Planar Resistor Networks from
Boundary Measurements"
( ps,
pdf,
tex,
scanned pdf)
(the scanned image is correct; the other files were converted from a
mathematica notebook and are broken)
Ryan Sturgell (1998)
University of Washington
rsturg%cs.washington.edu
"Disjoint Boundary-Boundary Paths in Critical Circular Planar Networks"
( ps,
pdf,
tex)
John Thacker (1999)
Duke University
Cornell University
thacker%math.cornell.edu
Nyssa Thompson (2004)
California Institute of Technology
nyssa%caltech.edu
All Recoverable Graphs with Five Boundary Nodes or Fewer
( pdf)
Justin Tittelfitz (2006)
jtittelf%uoregon.edu
The Heat Equation on Discrete Domains
( pdf, ps, tex)
Spectral Results for the Graph Laplacian
( pdf, ps, tex)
University of Washington
Brady Trainor (2008)
University of Washington
algebrat%u.washington.edu
Tung Tran (1994)
Duke University
"Determining the Conductors in a Network with Interior Sources of Current"
( ps,
pdf,
tex)
Stefan Treatman (1990)
Massachussetts Institute of Technology
See Staab for papers
George Tucker (2006)
gtucker%hmc.edu
On Numerical Recovery Methods for the Inverse Problem
( pdf)
Christopher Twigg (1999)
University of Washington
Carnegie Mellon (cs)
cdtwigg%cs.cmu.edu
See Romero for papers
Mike Usher (1999)
University of California at Berkeley
Massachussetts Institute of Technology (math)
usher%math.mit.edu
"Determining Current Sources in a Network"
( ps,
pdf,
tex)
David Vanderweide (1994)
Duke University
See Tran for papers
Praveen Venkataraman (2007)
venkap%msvi.org
When is a Function Everywhere Invertible?
( pdf)
Ordinary Differential Equations on Networks
( pdf)
Alex Waldorp (2011)
Texas A&M University
alexw2009@tamu.edu
RotationSystemsImbeddings
Ting-You Wang (2006)
tingyou%u.washington.edu
On Numerical Recovery Methods for the Inverse Problem
( pdf)
James Warren (1992)
University of North Texas
Texas A&M (math)
"Locating Altered Resistors in Circular and Tetrahedronal Networks"
( scanned pdf)
Jon Weed (2008)
Princeton
jweed%princeton.edu
Kazhdan-Lusztig Polynomials ( pdf)
Adam Welly (2009)
Western Washington University
wellya%students.wwu.edu
Recovering Conductivities on a Lattice Network via the Mixed Map
Aubin Whitley (1996)
Reed College
University of California, San Diego (math)
awhitley%math.ucsd.edu
Sam Whittle (2006)
samwhittle%comcast.net
On Numerical Recovery Methods for the Inverse Problem
( pdf)
Colton Willig (2009)
Rice
coltonwillig%yahoo.co
Eigenvalues for Response Matrices
Ryan Wilson (2009)
UCLA
rynovia%ucla.edu
Eigenvalues for Response Matrices
Matthew Wiser (2001)
University of Rochester
mw004h%mail.rochester.edu
"Recovery of Circular Annular Networks"
( ps,
pdf,
tex)
Harrison Wong (2011)
University of California at San Diego
hwong557@gmail.com
Brent Woodhouse (2010)
Purdue University
bwoodhouse729@gmail.com
Enumeration of Affine Permutations Avoiding Standard Permutations
Cynthia Wu (2012)
Gonzaga University
cwu2@zagmail.gonzaga.edu
Recovering Negative Conductivities
The Construction of 2n to 1 Graphs
n to 1 Graphs
Hsi-Jung Wu (1988)
University of Washington
Massachussetts Institute of Technology (ee phd)
Miao Xu (2004)
Louisiana State University
mxu1%lsu.edu
On the Nature of Connectivity Types (Midterm)
( ps,
pdf,
tex)
And, the final version
( ps,
pdf,
tex)
Ryan Yamachika (1997)
University of Washington
University of California at Berkeley (physics)
ryamachi%socrates.brekeley.edu
See Bisgard for papers
Neil York (1993)
Eckerd College
"An Algorithm for Determining Resistors and Capacitors in a 2-Layer
Network"
( ps - figures missing,
pdf- figures missing,
tex,
scanned pdf)
Jiashen You (2002)
University of Hawaii
jiashen%hawaii.edu
Solving Inverse Problems for Resistor Networks by Zipping Graphs
( ps,
pdf,
tex) (figures missing)
Ian Zemke (2010)
University of Washington
ianzemke@u.washington.edu
Schroedinger Networks
John Zhang (2012)
University of Washington
jmzhang@u.washington.edu
Parametrizing Response Matrices
Tracy Zhang (2007)
satrfx%u.washington.edu
Structure of Multiplexers on Stars
( pdf)
Leonid Zheleznyak (1993)
New York University
"\Psi Inverse Conductivity Problem"
( ps,
pdf,
tex)
Milda Zizyte (2010)
University of Washington
mzizyte@uw.edu
Enumeration of Affine Permutations Avoiding Standard Permutations