Efficient Binary Transfer of Pointer Structures (1994)
Cached
Download Links
- [www.cs.ubc.ca]
- [ftp.cs.york.ac.uk]
- [ftp.cs.york.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Ian Toyn
,
Alan J. Dix
,
Call Cadiz
| Venue: | Software Practice and Experience |
| Citations: | 5 - 0 self |
BibTeX
@ARTICLE{Toyn94efficientbinary,
author = {Ian Toyn and Alan J. Dix and Call Cadiz},
title = {Efficient Binary Transfer of Pointer Structures},
journal = {Software Practice and Experience},
year = {1994},
volume = {24},
pages = {1001--1023}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents a pair of algorithms for output and input of pointer structures in binary format. Both algorithms operate in linear space and time. They have been inspired by copying garbage collection algorithms, and make similar assumptions about the representations of pointer structures
