The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1989 vol.38)
pp: 718-724
ABSTRACT
A helix (k) list is a robust multiply linked list having k pointers in each node. In general, the ith pointer in each node addresses the ith previous node. However, the first pointer in each node addresses the next node, rather than the previous. An algorithm for performing local correction in a helix (k≤3) list is presented. Given the assumption that at most k errors are encountered during
INDEX TERMS
helix(k) lists; robust multiply linked list; pointers; node; algorithm; local correction; errors; failure; damaged; disconnected; data structures; list processing.
CITATION
I.J. Davis, "Local Correction of Helix(k) Lists", IEEE Transactions on Computers, vol.38, no. 5, pp. 718-724, May 1989, doi:10.1109/12.24273
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool