- The kTraveling Repairman Problem Jittat Fakcharoenphol # Chris Harrelson + Satish Rao #
- CS 273 Foundations of Parallel and Distributed Systems Spring 2003 Lecture 29: May 5
- Distributed Object Location in a Dynamic Network Kirsten Hildrum, John D. Kubiatowicz,
- U.C. Berkeley ---CS278: Parallel and Distributed Algorithms Lecture 6 Professor Satish Rao February 3, 2005
- CS273 Foundations of Parallel and Network Computing Spring 2003 Lecture 8: Feb 19, 2003
- Routing with Polynomial CommunicationSpace Baruch Awerbuch \Lambda David Peleg y
- U.C. Berkeley ---CS273: Parallel Algorithms Lecture 21 Professor Satish Rao April 5, 2005
- Distributed Shortest Paths Algorithms (Extended Abstract)
- CS273 Foundations of Parallel and Network Computing Spring 2003 Lecture 12: March 5, 2003
- CS273 Foundations of Parallel and Distributed Systems Spring 2003 Lecture 18: Apr 2, 2003
- John Henry was a steel-drivin man... John Henry worked on the railroad, he drove steel. This consisted of driv-
- The Lecture of January 25 We start by some examples. Of the following matrices, the left one is positive semidefinite.
- CS294 Classical and Quantum Optimization Spring 2010 Lecture 8: February 17, 2010
- CS 273: Prof. Satish Rao Notes Scribe David Garmire
- CS273 Foundations of Parallel and Network Computing Spring 2003 Lecture 14: March 12, 2003
- CS273 Foundations of Parallel and Network computing. Course Information: Spring 2003.
- CS 273: January 27th, 2003 Prof. Satish Rao
- CS294 Scribe Notes Chris Wilkens, Scribe
- CS2941 Algorithmic Aspects of Game Theory Spring 2001 Lecture 4: February 6, 2001
- Planar graphs, negative weight edges, shortest paths, and near linear time
- CS273 Foundations of Parallel and Network Computing Spring 2003 Lecture 27: Apr 30, 2003
- CS273 Foundations of Parallel & Network Computing Spring 2001 Lecture 6: 1 st February, 2001
- CS273 Foundations of Parallel and Distributed Systems Spring 2003 Lecture 12: March 5
- CS294 --Algorithm Toolkit Lecture Notes 8th February 2010
- Portable and Efficient Parallel Computing Using the BSP Model \Lambda
- A Polynomialtime Tree Decomposition to Minimize Chris Harrelson Kirsten Hildrum y Satish Rao z
- ``Ratio regions'': a technique for image segmentation. Ingemar J. Cox
- A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics
- An improved approximation algorithm for the 0extension problem Jittat Fakcharoenphol # Chris Harrelson + Satish Rao # Kunal Talwar
- CS273 Foundations of Parallel and & Network Computing Spring 2003 Lecture 9 : 2.24.03
- CS 273: Kris Hildrum Notes Scribe David Garmire
- Lecture Feb 3, 2010 -scribe notes Today: completely non-systematic approach, toy version of problem to get
- ..ish Iterative Methods for Linear Systems CS294 Algorithms Toolkit Fall 2008
- U.C. Berkeley ---CS273: Parallel Algorithms Lecture 3 Professor Satish Rao February 1, 2005
