|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
8 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Author index for volume 48 |
1994 |
48 | 3 |
p. 552- 1 p. |
article |
||
| 2 | Competitive k-server algorithms |
Fiat, Amos |
1994 |
48 | 3 |
p. 410-428 19 p. |
article |
|
| 3 | Editor's foreword |
Yannakakis, Mihalis |
1994 |
48 | 3 |
p. 383- 1 p. |
article |
|
| 4 | Efficient distribution-free learning of probabilistic concepts |
Kearns, Michael J. |
1994 |
48 | 3 |
p. 464-497 34 p. |
article |
|
| 5 | On the complexity of the parity argument and other inefficient proofs of existence |
Papadimitriou, Christos H. |
1994 |
48 | 3 |
p. 498-532 35 p. |
article |
|
| 6 | Provably good mesh generation |
Bern, Marshall |
1994 |
48 | 3 |
p. 384-409 26 p. |
article |
|
| 7 | Specified precision polynomial root isolation is in NC |
Neff, C. Andrew |
1994 |
48 | 3 |
p. 429-463 35 p. |
article |
|
| 8 | Trans-dichotomous algorithms for minimum spanning trees and shortest paths |
Fredman, Michael L. |
1994 |
48 | 3 |
p. 533-551 19 p. |
article |
8 results found