Kirsten (Kris) Hildrum's Plain & Practical Page

Contact Info

Office 593 Soda
Office Phone: 642-2128

Status

I've graduated from Berkeley (yeah!), and I will start work at IBM Watson in mid-August. This web page is out of date.

Theory Links

The Theory Seminar web page is here
The Theory Area page.
A FAQ on supplies and computers for theory students at Berkeley.

Research

My research is between theory and systems, so I am working with professors: Satish Rao and John Kubiatowicz . Much of my work is with the OceanStore group, in particular, on Tapestry.

I'm also helping with a project to make life easier by simplifying forms--see this web site for more information.

Publications

Object Location in Realistic Networks
Kirsten Hildrum, Robert Krauthgamer and John Kubiatowicz, SPAA 2004
A Note on Finding the Nearest Neighbor in Growth-Restricted Metrics
Kirsten Hildrum, John Kubiatowicz, Sean Ma, and Satish Rao, SODA 2004.(paper)
Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks,
Kirsten Hildrum and John Kubiatowicz, DISC 2003. (pdf, ps, gz)
A Polynomial-time Tree Decomposition to Minimize Congestion,
Chris Harrelson, Kirsten Hildrum, and Satish Rao, SPAA 2003. (ps, pdf, bibtex)
Distributed Object Location in a Dynamic Network,
Kirsten Hildrum, John D. Kubiatowicz, Satish Rao and Ben Y. Zhao, SPAA 2002. (gz, pdf, bibtex, journal version).
Incentive-Compatible Online Auctions for Digital Goods
Ziv Bar-Yossef, Kirsten Hildrum, and Felix Wu, SODA 2002. (ps,bibtex)
Security of Encrypted Rlogin Connections with Kerberos IV
Kris Hildrum (Network and Distributed System Security Symposium). ( PDF, bibtex)
For a quick overview, plus a little on this problem in Kerberos V, go here .
On List Update and Work Function Algorithms
Eric Anderson, Kris Hildrum, Anna R. Karlin, April Rasala and Michael Saks (appeared in EAS '99) (pdf, bibtex).

Technical Reports

Another Way to Find the Nearest Neighbor in Growth-Restricted Metrics
with John Kubiatowicz and Satish Rao.(paper,bibtex)
Optimizations for Locality-Aware Structured Peer-to-Peer Overlays
Jeremy Stribling and Kirsten Hildrum and John D. Kubiatowicz. (paper,bibtex entry)
Jagged Bite Problem NP-Complete Construction
Kris Hildrum and Megan Thomas (gz, bibtex entry)

On Being a Graduate Student

If you are a new graduate student (or a not-so-new but unsuccessful one), the links below might be useful.

Marie desJardins's much cited (or at least, much linked to) How to Be a Good Graduate Student.
Some informal comments from Berkeley EECS students.
The following might also be useful: How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Graduate Students by Ian Parberry.

Old Class Projects

Project for CS252 Generation of Branch Predictors via Genetic Programing .
Collaborative Filtering (SWAMI) and some additional graphs.

Old TA Stuff

When I was a TA for CS61A, I made a list of Hints and Tips. They may still be useful.

Personal Info

My first name is Kirsten, but just about everyone calls me Kris. You can call me either Kris or Kirsten (that's "curse-ten", not "cures-ten"). Please avoid mixing the two and calling me "Kristen". (If you want, ask me about the most memorable time someone made this mistake.)

A picture of me.
Click here to learn a little more about me.

hildrum @ cs . berkeley . edu, updated 06-07-02