nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A lower bound on the quantum query complexity of read-once functions
|
Barnum, Howard |
|
2004 |
69 |
2 |
p. 244-258 15 p. |
artikel |
2 |
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
|
Demaine, Erik D |
|
2004 |
69 |
2 |
p. 166-195 30 p. |
artikel |
3 |
C2 - Ed. Board
|
|
|
2004 |
69 |
2 |
p. IFC- 1 p. |
artikel |
4 |
Contents
|
|
|
2004 |
69 |
2 |
p. OBC- 1 p. |
artikel |
5 |
Minimal DFA for testing divisibility
|
Alexeev, Boris |
|
2004 |
69 |
2 |
p. 235-243 9 p. |
artikel |
6 |
Network QoS games: stability vs optimality tradeoff
|
Lomonosov, Andrew |
|
2004 |
69 |
2 |
p. 281-302 22 p. |
artikel |
7 |
On approximating weighted sums with exponentially many terms
|
Chawla, Deepak |
|
2004 |
69 |
2 |
p. 196-234 39 p. |
artikel |
8 |
On relations between counting communication complexity classes
|
Damm, Carsten |
|
2004 |
69 |
2 |
p. 259-280 22 p. |
artikel |
9 |
Papers to Appear
|
|
|
2004 |
69 |
2 |
p. 303- 1 p. |
artikel |
10 |
Robust learning—rich and poor
|
Case, John |
|
2004 |
69 |
2 |
p. 123-165 43 p. |
artikel |
11 |
Scaled dimension and nonuniform complexity
|
Hitchcock, John M |
|
2004 |
69 |
2 |
p. 97-122 26 p. |
artikel |