MAKING DATA-STRUCTURES PERSISTENT

被引：312

作者：

DRISCOLL, JR

SARNAK, N

SLEATOR, DD

TARJAN, RE

机构：

[1] CARNEGIE MELLON UNIV,DEPT COMP SCI,PITTSBURGH,PA 15218

[2] AT&T BELL LABS,MURRAY HILL,NJ 07974

[3] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

[4] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

关键词：

D O I：

10.1016/0022-0000(89)90034-2

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：86 / 124

页数：39

共 50 条

[1] FULLY PERSISTENT DATA-STRUCTURES FOR DISJOINT SET UNION PROBLEMS
ITALIANO, GF
SARNAK, N
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 449 - 460
[2] DATA-STRUCTURES
GILES, D
[J]. COMPUTER JOURNAL, 1991, 34 (05): : 385 - 385
[3] USING PERSISTENT DATA-STRUCTURES FOR ADDING RANGE RESTRICTIONS TO SEARCHING PROBLEMS
LENHOF, HP
SMID, M
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1994, 28 (01): : 25 - 49
[4] EDITING DATA-STRUCTURES
FRASER, CW
LOPEZ, AA
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1981, 3 (02): : 115 - 125
[5] DATA-STRUCTURES AND ALGORITHMS
WIRTH, N
[J]. SCIENTIFIC AMERICAN, 1984, 251 (03) : 60 - &
[6] DATA-STRUCTURES MAXIMA
LOUCHARD, G
KENYON, C
SCHOTT, R
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 339 - 349
[7] Making data structures confluently persistent
Fiat, Amos
Kaplan, Haim
[J]. J Algorithms, 1600, 1 (16-58):
[8] A FRAMEWORK FOR DATA-STRUCTURES
SIX, HW
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1982, 10 (3-4) : 213 - 236
[9] Making data structures confluently persistent
Fiat, A
Kaplan, H
[J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 537 - 546
[10] Making data structures confluently persistent
Fiat, A
Kaplan, H
[J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 48 (01): : 16 - 58