Princeton University
Department of Computer Science
35 Olden Street, Room 003
Princeton, NJ 08544-2087

Email: sssix AT cs ...

I am a 2nd year PhD student in the Department of Computer Science at Princeton University. I work with Robert Tarjan in the Theory group and Michael Freedman in the Scalable Network Systems (SNS) group. Prior to this, I worked for three years in the Network Load Balancing group of Windows Server at Microsoft. I received my S. B. and M. Eng. in Computer Science from MIT.

I am supported by the 2009 Google Ph.D. Fellowship in Fault Tolerant Computing.

My research interests lie at the boundary of systems and theory, with the goal of allowing ideas and techniques to flow freely in either direction. On the theory side, I am interested in the design and analysis of data structures and algorithms for combinatorial problems that are efficient in practice. On the systems side, I am interested in building scalable and reliable distributed systems. Put together, I am interested in the algorithms, designs, and tools needed to build provably scalable and reliable distributed systems. In all my work, simplicity and elegance is the ultimate goal.

Publications

• Prophecy: Using History for High-Throughput Fault Tolerance.
  with Wyatt Lloyd and Michael J. Freedman.
  In submission, 2009.
  
  
• Deletion Without Rebalancing in Balanced Binary Trees.
  with Robert E. Tarjan.
  To appear: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2010.
  [pdf]
  
  
• Deletion Without Rebalancing in Multiway Search Trees.
  with Robert E. Tarjan.
  To appear: Proc. 20th International Symposium on Algorithms and Computation (ISAAC), December 2009.
  [pdf]
  
  
• Virtual Ring Routing Trends.
  with Dahlia Malkhi, Kunal Talwar, Renato F. Werneck, and Udi Wieder.
  In Proc. 23rd International Symposium on Distributed Computing (DISC), September 2009.
  [pdf]
  
  
• Rank-Pairing Heaps.
  with Bernhard Haeupler and Robert E. Tarjan.
  To appear: Proc. 17th European Symposium on Algorithms (ESA), September 2009.
  [pdf]
  
  
• Rank-Balanced Trees.
  with Bernhard Haeupler and Robert E. Tarjan.
  In Proc. 11th International Workshop on Algorithms and Data Structures (WADS), August 2009.
  [pdf]
  
  
• Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.
  with Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, and Robert E. Tarjan.
  In submission, 2008.
  [pdf]
  
  
• Faster Algorithms for Incremental Topological Ordering.
  with Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, and Robert E. Tarjan.
  Proc. 35th International Colloquium on Automata, Languages, and Programming (ICALP), July 2008.
  [pdf]