nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A tight bound on approximating arbitrary metrics by tree metrics
|
Fakcharoenphol, Jittat |
|
2004 |
69 |
3 |
p. 485-497 13 p. |
artikel |
2 |
C2 - Ed. Board
|
|
|
2004 |
69 |
3 |
p. IFC- 1 p. |
artikel |
3 |
Cell-probe lower bounds for the partial match problem
|
Jayram, T.S. |
|
2004 |
69 |
3 |
p. 435-447 13 p. |
artikel |
4 |
Classical complexity and quantum entanglement
|
Gurvits, Leonid |
|
2004 |
69 |
3 |
p. 448-484 37 p. |
artikel |
5 |
C4 - TOC
|
|
|
2004 |
69 |
3 |
p. OBC- 1 p. |
artikel |
6 |
Exponential lower bound for 2-query locally decodable codes via a quantum argument
|
Kerenidis, Iordanis |
|
2004 |
69 |
3 |
p. 395-420 26 p. |
artikel |
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. |
artikel |
8 |
Learning functions of k relevant variables
|
Mossel, Elchanan |
|
2004 |
69 |
3 |
p. 421-434 14 p. |
artikel |
9 |
Optimal oblivious routing in polynomial time
|
Azar, Yossi |
|
2004 |
69 |
3 |
p. 383-394 12 p. |
artikel |
10 |
Papers to Appear
|
|
|
2004 |
69 |
3 |
p. 498- 1 p. |
artikel |
11 |
Random knapsack in expected polynomial time
|
Beier, Rene |
|
2004 |
69 |
3 |
p. 306-329 24 p. |
artikel |
12 |
Special issue: 35th Annual ACM Symposium on Theory of Computing
|
Khanna, Sanjeev |
|
2004 |
69 |
3 |
p. 305- 1 p. |
artikel |
13 |
Testing subgraphs in directed graphs
|
Alon, Noga |
|
2004 |
69 |
3 |
p. 354-382 29 p. |
artikel |