| Record ID | marc_records_scriblio_net/part12.dat:37358184:1008 |
| Source | Scriblio |
| Download Link | /show-records/marc_records_scriblio_net/part12.dat:37358184:1008?format=raw |
LEADER: 01008cam 2200253 i 4500
001 79624416 //r86
003 DLC
005 19860203000000.0
008 791116s1979 ilua b s00010 eng
010 $a 79624416 //r86
050 0 $aQA76$b.I4 no. 970$aQA166.2
082 $a001.6/4/08 s$a511/.5
100 10 $aDershowitz, Nachum.
245 10 $aEnumerations of ordered trees /$cNachum Dershowitz and Shmuel Zaks.
260 0 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1979.
300 $a33 p. :$bill. ;$c28 cm.
490 1 $a[Report] - Department of Computer Science, University of Illinois at Urbana-Champaign ; UIUCSCS-R-79-970
500 $a"UILU-ENG 79 1717."
500 $aErrata slip inserted.
504 $aBibliography: p. 33.
650 0 $aTrees (Graph theory)
650 0 $aCombinatorial enumeration problems.
700 10 $aZaks, Shmuel,$d1949-$ejoint author.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDept. of Computer Science.$tReport ;$v970.