APPROXIMATION ALGORITHMS FOR MINIMUM DATA STORAGE SPACE AND ACCESS TIME.

被引：0

作者：

Matsushita, Hiraoki

Maruoka, Akira

Kimura, Masayuki

机构：

来源：

Systems, computers, controls | 1980年 / 11卷 / 04期

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

DATA STORAGE, DIGITAL

引用

页码：50 / 58

共 50 条

[1] Beyond access time. Evaluating storage performance
Marken, A
INTERNATIONAL JOURNAL OF MICROGRAPHICS & OPTICAL TECHNOLOGY, 1996, 14 (06): : 9 - 10
[2] Beyond access time. Evaluating storage performance
Marken Comunications, Santa Clara, United States
Int J Micrograph Opt Technol, 6 (9-10):
[3] APPROXIMATION ALGORITHMS FOR MINIMUM-TIME BROADCAST
KORTSARZ, G
PELEG, D
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 601 : 67 - 78
[4] APPROXIMATION ALGORITHMS FOR MINIMUM-TIME BROADCAST
KORTSARZ, G
PELEG, D
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (03) : 401 - 427
[5] Improved approximation algorithms for minimum-space advertisement scheduling
Dean, BC
Goemans, MX
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 1138 - 1152
[6] Space and time.
不详
NATURE, 1914, 93 : 532 - 533
[7] Space and time.
Pieron, Henri
ANNEE PSYCHOLOGIQUE, 1922, 23 : 238 - 239
[8] Representations of space and time.
Rushton, G
ANNALS OF THE ASSOCIATION OF AMERICAN GEOGRAPHERS, 2004, 94 (03) : 687 - 688
[9] Master of space and time.
Rogers, M
LIBRARY JOURNAL, 2005, 130 (07) : 139 - 139
[10] SWITCHING IN SPACE AND TIME.
Leakey, D.M.
Proceedings of the Institution of Electrical Engineers, 1977, 124 (01): : 17 - 24