| Record ID | marc_loc_2016/BooksAll.2016.part12.utf8:130274542:1033 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part12.utf8:130274542:1033?format=raw |
LEADER: 01033cam a2200265 i 4500
001 79624416
003 DLC
005 20130418085723.0
008 791116s1979 ilua b s000 0 eng
010 $a 79624416
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 970$aQA166.2
082 00 $a001.6/4/08 s$a511/.5
100 1 $aDershowitz, Nachum.
245 10 $aEnumerations of ordered trees /$cNachum Dershowitz and Shmuel Zaks.
260 $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 1 $aZaks, Shmuel,$d1949-$ejoint author.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDepartment of Computer Science.$tReport ;$v970.