|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
446023 |
| 005 |
19951113000000.0 |
| 008 |
950412s1993 nz b 000 0 eng u |
| 035 |
|
|
|a (upgd41)zbn95044201
|
| 035 |
|
|
|a (nzNZBN)9098140
|
| 035 |
|
|
|a (OCoLC)154153487
|
| 040 |
|
|
|a CUPS
|c CUPS
|
| 090 |
|
|
|a q QA 75.5 .A898 no. 71
|
| 097 |
|
|
|3 Bib#:
|a 446023
|
| 100 |
1 |
|
|a Jones, Geraint A.
|
| 245 |
1 |
0 |
|a Linear-time breadth-first tree algorithms :
|b an exercise in the arithmetic of folds and zips /
|c Geraint Jones and Jeremy Gibbons.
|
| 260 |
|
|
|a Auckland, N.Z. :
|b University of Auckland, Dept. of Computer Science,
|c 1993.
|
| 300 |
|
|
|a 15 p. ;
|c 30 cm.
|
| 490 |
1 |
|
|a Auckland University computer science report ;
|v no. 71
|
| 490 |
1 |
|
|a Computer science report / Auckland University ;
|v no. 71
|
| 500 |
|
|
|a "May 1993"
|
| 504 |
|
|
|a Includes bibliographical references (p. 15)
|
| 650 |
|
0 |
|a Data structures (Computer science)
|
| 650 |
|
0 |
|a Functional programming (Computer science)
|
| 650 |
|
0 |
|a Parallel programming (Computer science)
|
| 650 |
|
0 |
|a Computer algorithms.
|
| 650 |
|
0 |
|a Trees (Graph theory)
|
| 700 |
1 |
|
|a Gibbons, Jeremy.
|
| 710 |
2 |
|
|a University of Auckland.
|b Department of Computer Science.
|
| 830 |
|
0 |
|a Auckland computer science reports ;
|v no. 71.
|
| 991 |
|
|
|a 1995-09-17
|
| 992 |
|
|
|a Created by , 17/09/1995. Updated by , 13/11/1995.
|
| 999 |
f |
f |
|i e4cbe152-c0a9-5fbc-9500-d26ba7b5b88c
|s d68432a9-6af2-58b5-979a-6eab277287d4
|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. 71
|h Library of Congress classification
|i Book
|m AU04137264B
|
