Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference13 articles.
1. Peter A. Alsberg,Space and time saving through large data base compression and dynamic restructuring, Proc. of the IEEE, Vol. 63, No. 8, August 1975.
2. Jon Louis Bentley and Jerome H. Friedman,Fast algorithms for constructing minimal spanning trees in coordinate spaces, IEEE Transactions on Computers, Vol. C-27, No. 2, February 1978.
3. H. Blasbalg and R. Van Blerkom,Message Compression, in Data Compression, ed. by Lee D. Davisson and Robert M. Gray (Dowden), Hutchington & Ross, 1976.
4. Francis Chin and Davin Houck,Algorithms for updating minimal spanning trees, Journal of Computer and Systems Sciences, Vol. 16, No. 3, June 1978.
5. Doron Gottlieb, Steven A. Hagerth, Philippe G. H. Lehot and Henry S. Rabinowitz,A classification of compression methods and their usefulness for a large data processing center, National Computer Conference USA 1975.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献