|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
DEMILLO, R.A, EtSENSTA'r, S C., ANn LIPTON, R.J On small umversal data structures and related combtnatorial problems Proc Johns Hopkins Conf on Inform Sol and Syst, Baltimore, Md, 1978, pp 408-411
|
| |
3
|
|
| |
4
|
GAREY, M.R, GRAHAM, R L, JOHNSON, D S, AND K~UTn, D E Complexity results for bandwidth minimizatlon SlAM J AppI Math 34 (1978), 477-495
|
| |
5
|
GOTLIEB, C C, AND TOMPA, F W Choosing a storage schema. Acta lnformaoca 3 (1974), 297-319.
|
| |
6
|
HARDY, G H, LITTLEWOOD, J.E, AND P6LYA, G Inequah'ties. Cambridge U. Press, London, 1967
|
| |
7
|
HARPER, L H. Optimal assignments of numbers to vertices J. Soc Ind. AppL Math 12 (1964), 131-135
|
| |
8
|
HARPER, L H Optimal numberlngs and lsopenmetnc problems. J. Comb. Theory 1, (1966) 385-393.
|
| |
9
|
IORDANSK'II, M A Mlnlmalnye numeratsn vershm derevyev (m Russian) Problemy Ktbernetik~ 31 (197.6), 109-132.
|
| |
10
|
|
| |
11
|
LEE, J A N Computer Semantics Van Nostrand Reinhold, New York, 1972
|
| |
12
|
|
| |
13
|
LIPTON, R J, AND TARJAN, R E A separator theorem for planar graphs Proc U Waterloo Conf on Theoretical Comptr Scl, 1977, Waterloo, Ontario, pp 1-10
|
| |
14
|
LIPTON, R J, AND TARJAN, R E Apphcatnons of a planar separator theorem Proc. 18th Ann Symp on Foundations of Comptr Sci, Providence, R I, 1977, pp 162-170
|
| |
15
|
|
| |
16
|
|
| |
17
|
ROSENBERG, A L Preserving proximity in arrays SlAM J Comping 4 (1975), 443--460
|
| |
18
|
ROSENBERG, A L Data encodmgs and their costs Acta Informat:ca 9 (1978), 273-292.
|
| |
19
|
ROSENBERG, A L Storage mappings for extendible arrays In Current Trends tn Programming Methodology IV Data Structuring, R T Yeh, Ed, Prenuce-Hall, Englewood Cliffs, N J, 1978, Chap. 10
|
| |
20
|
ROSENBERG, A L, AND SNYDER, L Bounds on the costs of data encodlngs Math Syst. Theory 12 (1978), 9- 39
|
| |
21
|
ROSENBERG, A L, WOOD, D, AND GALIL, Z Storage representations for tree-hke data structures To appear Math Syst Theory
|
| |
22
|
SCHEUERMANN, P, AND HELLER, J A view of logical data organization and its mapping to physical storage Proc 3rd Texas Conf on Comptng Systems, Austin, Texas, 1974
|
| |
23
|
SEKAr~INA, M On an ordering of the set of vertices of a connected graph Publ Fac Sct Unlv Brno, No 412 (1960), 137-142
|
| |
24
|
SHEIDVASSER, M A O dime t shlrlne razmeshchenu grafov v reshetkakh (in Russian). Problemy K:bernettkt 29 (1974), 63-102
|
| |
25
|
SHNEIDERMAN, B, AND SHAPIRO, S C Toward a theory of encoded data structures and data translation int J Comping Inform Sc: 5 (1976), 33-43
|
| |
26
|
STANDISH, T A Data structures--an axiomatic approach in Current Trends m Programm:ng Methodology IV. Data Structunng, R T Yeh, Ed, Prentice-Hall, Englewood Cliffs, N J, 1978, Chap. 3.
|
CITED BY 7
|
|
Mark H. Nodine , Michael T. Goodrich , Jeffrey Scott Vitter, Blocking for external graph searching, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.222-232, May 25-28, 1993, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
Sandeep Bhatt , Fan Chung , Tom Leighton , Arnold Rosenberg, Scheduling trees using FIFO queues: a control-memory tradeoff, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.85-93, June 27-29, 1994, Cape May, New Jersey, United States
|
|
|
Arnold L. Rosenberg , Derick Wood , Zvi Galil, Storage representations for tree-like data structures, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.99-107, April 30-May 02, 1979, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2