TALK SCHEDULE
Nate Chandler, Rigid Homology
of Graphs
Singular Homology of Graphs
New College (Florida)
nathaniel.chandler%ncf.edu
Edward Chien
Dartmouth
Edward.D.Chien%dartmouth.edu
Jacqueline Corbitt,Compare Rumor
Methods;
New Directions for
Rumor Mongers; Recovering Information Starting Points
Brigham Young
high.on.lif3%gmail.com
Gary Furnish, Sage-Symbolics
Utah
gfurnish%gfurnish.net
Kris Harper, On the Recoverability of Amalgamated and Separated Graphs Using Medial Graphs
Chicago
orangejuice128%gmail.com
Ben Hayes, Sufficient Conditions for an Electrical Network to be N-to-One
University of Washington
hayes_benjamin%jhotmail.com
Chad Klumb
University of Washington
cklumb%gmail.com
Matthew Lewandowski, Who's Stealing My
Current?,
Logarithmic
Recovery of the Tetrahedron,
Determinant of a Principle Proper Submatrix of the Kirchhoff Matrix
Penn
mattl%sas.upenn.edu
Rachael Maltiel, Compare Rumor
Methods;
New Directions for
Rumor Mongers; Recovering Information
Starting Points
Claremont-McKenna
rmaltiel09%students.claremontmckenna.edu
Eric Nitardy, Random Walks on Graphs
University of Washington
nithardt%mac.com
Bill Shore, Logarithmic
Recovery of the Tetrahedron
Brown
William_Shore%brown.edu
Stan Snelson, Transport
Equation; Discrete Inverse
Transport
Columbia
ses2140%columbia.edu
Brady Trainor
University of Washington
algebrat%u.washington.edu
Jon Weed
Princeton, Kazhdan-Lusztig Polynomials
jweed%princeton.edu
Owen Biesel
Princeton
obiesel%myuw.net
Mark Blunk, Algebraic Geometry Notes, paper; web page
UCLA
mblunk%math.ucla.edu
Tom Boothby
University of Washington
boothby%u.washington.edu
Ryan Card
University of Washington
mrcard%u.washington.edu
Ernie Esser, Notes on old REU stuff and
new
problem ideas/applications;
Notes on discrete Sobolev
spaces; web page
UCLA
ernmon%math.ucla.edu
Konrad Schroder
University of Washington
perseant%hhhh.org
Jim Morrow, web page
morrow%math.washington.edu
William Stein
wstein%gmail.com
David Ingerman
daviddavifree%gmail.com
Sara Billey
billey%math.washington.edu