Searching for authors named "Chris Harrelson" – sorted by Relevance.
-
Some Theory and Applications of Linear Logic
- Some Theory and Applications of Linear Logic CS263 Project Report Fall 2000 Chris Harrelson 3rd
- Add To MetaCart
-
A polynomial-time tree decomposition to minimize congestion
- A Polynomial-time Tree Decomposition to MinimizeCongestion Chris Harrelson \Lambda Kirsten
- Cited by 37 (0 self) – Add To MetaCart
-
Quantum Clock Synchronization With One Qubit
- Quantum clock synchronization with one qubit Chris Harrelson UC Berkeley chrishtr
- Add To MetaCart
-
Sampling From Two-Way Contingency Tables
- Sampling from two-way contingency tables Chris Harrelson April 3, 2001 Abstract This report
- Add To MetaCart
-
Computing the shortest path: A* search meets graph theory
- Computing the Shortest Path: A ∗ Search Meets Graph Theory Andrew V. Goldberg 1 Chris Harrelson 2
- Cited by 34 (3 self) – Add To MetaCart
-
The k-Traveling Repairman Problem
- The k-Traveling Repairman Problem Jittat Fakcharoenphol # Chris Harrelson + Satish Rao # Abstract
- Cited by 18 (1 self) – Add To MetaCart
-
An improved approximation algorithm for the 0-extension problem
- An improved approximation algorithm for the 0-extension problem Jittat Fakcharoenphol * Chris
- Cited by 14 (2 self) – Add To MetaCart
-
An analysis of distributed, Unix-based routers
- An analysis of distributed, Unix-based routers (Project report for CS 252, spring 2001) Chris
- Add To MetaCart
-
Lower Bounds for Maximum Parsimony with Gene Order Data
- Lower Bounds for Maximum Parsimony with Gene Order Data Abraham Bachrach, Kevin Chen, Chris
- Cited by 2 (0 self) – Add To MetaCart
-
Approximate Classification via Earthmover Metrics
- Approximate classification via earthmover metrics Aaron Archer ∗ Jittat Fakcharoenphol † Chris
- Cited by 10 (1 self) – Add To MetaCart

