| 2009 |
|---|
| 11 | EE | Grey Ballard,
James Demmel,
Olga Holtz,
Oded Schwartz:
Communication-optimal Parallel and Sequential Cholesky Decomposition
CoRR abs/0902.2537: (2009) |
| 2008 |
|---|
| 10 | EE | Avraham Ben-Aroya,
Oded Schwartz,
Amnon Ta-Shma:
Quantum Expanders: Motivation and Constructions.
IEEE Conference on Computational Complexity 2008: 292-303 |
| 9 | EE | Noga Alon,
Oded Schwartz,
Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders.
Combinatorics, Probability & Computing 17(3): 319-327 (2008) |
| 2007 |
|---|
| 8 | EE | Noga Alon,
Oded Schwartz,
Asaf Shapira:
An elementary construction of constant-degree expanders.
SODA 2007: 454-458 |
| 2006 |
|---|
| 7 | EE | Amitai Armon,
Adi Avidor,
Oded Schwartz:
Cooperative TSP.
ESA 2006: 40-51 |
| 6 | EE | Shmuel Safra,
Oded Schwartz:
On the complexity of approximating tsp with neighborhoods and related problems.
Computational Complexity 14(4): 281-307 (2006) |
| 5 | EE | Elad Hazan,
Shmuel Safra,
Oded Schwartz:
On the complexity of approximating k-set packing.
Computational Complexity 15(1): 20-39 (2006) |
| 4 | EE | Noga Alon,
Oded Schwartz,
Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders.
Electronic Colloquium on Computational Complexity (ECCC) 13(119): (2006) |
| 2003 |
|---|
| 3 | EE | Shmuel Safra,
Oded Schwartz:
On the Complexity of Approximating TSP with Neighborhoods and Related Problems.
ESA 2003: 446-458 |
| 2 | EE | Elad Hazan,
Shmuel Safra,
Oded Schwartz:
On the Complexity of Approximating k-Dimensional Matching.
RANDOM-APPROX 2003: 83-97 |
| 1 | EE | Elad Hazan,
Shmuel Safra,
Oded Schwartz:
On the Hardness of Approximating k-Dimensional Matching
Electronic Colloquium on Computational Complexity (ECCC) 10(020): (2003) |
