| Record ID | ia:enumerationsofor970ders |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/enumerationsofor970ders/enumerationsofor970ders_marc.xml |
| Download MARC binary | https://www.archive.org/download/enumerationsofor970ders/enumerationsofor970ders_meta.mrc |
LEADER: 01011cam 2200265 i 4500
001 841657
005 20060929030242.0
008 791116s1979 ilua b s00010 engm
035 $a(OCoLC)ocm05808128
035 $9ADL-6102
040 $aDLC$cDLC$dm.c.$dUIU
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.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 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-
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 970