|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
13 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A tight bound on approximating arbitrary metrics by tree metrics |
Fakcharoenphol, Jittat |
2004 |
69 | 3 |
p. 485-497 13 p. |
article |
|
| 2 | C2 - Ed. Board |
2004 |
69 | 3 |
p. IFC- 1 p. |
article |
||
| 3 | Cell-probe lower bounds for the partial match problem |
Jayram, T.S. |
2004 |
69 | 3 |
p. 435-447 13 p. |
article |
|
| 4 | Classical complexity and quantum entanglement |
Gurvits, Leonid |
2004 |
69 | 3 |
p. 448-484 37 p. |
article |
|
| 5 | C4 - TOC |
2004 |
69 | 3 |
p. OBC- 1 p. |
article |
||
| 6 | Exponential lower bound for 2-query locally decodable codes via a quantum argument |
Kerenidis, Iordanis |
2004 |
69 | 3 |
p. 395-420 26 p. |
article |
|
| 7 | Integer priority queues with decrease key in constant time and the single source shortest paths problem |
Thorup, Mikkel |
2004 |
69 | 3 |
p. 330-353 24 p. |
article |
|
| 8 | Learning functions of k relevant variables |
Mossel, Elchanan |
2004 |
69 | 3 |
p. 421-434 14 p. |
article |
|
| 9 | Optimal oblivious routing in polynomial time |
Azar, Yossi |
2004 |
69 | 3 |
p. 383-394 12 p. |
article |
|
| 10 | Papers to Appear |
2004 |
69 | 3 |
p. 498- 1 p. |
article |
||
| 11 | Random knapsack in expected polynomial time |
Beier, Rene |
2004 |
69 | 3 |
p. 306-329 24 p. |
article |
|
| 12 | Special issue: 35th Annual ACM Symposium on Theory of Computing |
Khanna, Sanjeev |
2004 |
69 | 3 |
p. 305- 1 p. |
article |
|
| 13 | Testing subgraphs in directed graphs |
Alon, Noga |
2004 |
69 | 3 |
p. 354-382 29 p. |
article |
13 results found