|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
500505 |
| 005 |
19950922000000.0 |
| 008 |
950412s1994 nz a b 00010 eng u |
| 035 |
|
|
|a (upgd41)zbn95057110
|
| 035 |
|
|
|a (nzNZBN)8910292
|
| 035 |
|
|
|a (OCoLC)154137689
|
| 040 |
|
|
|a CUPS
|c CUPS
|
| 090 |
|
|
|a q QA 75.5 .A898 no. 88
|
| 097 |
|
|
|3 Bib#:
|a 500505
|
| 100 |
1 |
|
|a Fenwick, P. M.
|q (Peter M.)
|
| 245 |
1 |
2 |
|a A new data structure for cumulative frequency tables /
|c Peter Fenwick.
|
| 260 |
|
|
|a Auckland N.Z :
|b Dept. of Computer Science, School of Mathematical & Information Science, University of Auckland,
|c 1994.
|
| 300 |
|
|
|a 12 p. :
|b ill ;
|c 30 cm.
|
| 490 |
1 |
|
|a Report / Department of Computer Science, School of Mathematical & Information Science, University of Auckland ;
|v no. 88
|
| 500 |
|
|
|a "A new method (the "binary indexed tree") is presented for maintaining the cumulative frequencies which are needed to support dynamic arithmetic data compression." --Summary.
|
| 500 |
|
|
|a "February 1994"
|
| 504 |
|
|
|a Includes bibliographical references (p. 12)
|
| 650 |
|
0 |
|a Data compression (Computer science)
|
| 650 |
|
0 |
|a Trees (Graph theory)
|x Data processing.
|
| 650 |
|
0 |
|a Data structures (Computer science)
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Computational complexity.
|
| 650 |
|
0 |
|a Computer algorithms.
|
| 710 |
2 |
|
|a University of Auckland.
|b Department of Computer Science.
|
| 830 |
|
0 |
|a Report (University of Auckland. Department of Computer Science) ;
|v no. 88
|
| 991 |
|
|
|a 1995-09-21
|
| 992 |
|
|
|a Created by , 21/09/1995. Updated by , 22/09/1995.
|
| 999 |
f |
f |
|i 0f2b81b0-ceff-5b1d-961f-e00aee2d2a95
|s 7a5d40af-4247-570b-a979-32a81b4a0c50
|t 0
|
| 952 |
f |
f |
|p For loan
|a University Of Canterbury
|b UC Libraries
|c EPS Library
|d EPS Library, Level 1
|t 0
|e QA 75.5 .A898 no. 88
|h Library of Congress classification
|i Book
|m AU04137965B
|
