| Record ID | ia:treesinalgebrapr0159caap |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/treesinalgebrapr0159caap/treesinalgebrapr0159caap_marc.xml |
| Download MARC binary | https://www.archive.org/download/treesinalgebrapr0159caap/treesinalgebrapr0159caap_meta.mrc |
LEADER: 03753cam 2200733 a 4500
001 ocm09943746
003 OCoLC
005 20200625000335.0
008 830826s1983 gw a b 100 0 eng
010 $a 83016909
040 $aDLC$beng$cDLC$dUBA$dMUQ$dNLGGC$dBTCTA$dC$Q$dYDXCP$dZWZ$dGW5XE$dTFW$dBDX$dGW5XE$dOCLCQ$dOCLCF$dOCL$dOCLCO$dOCLCQ$dCSJ$dOCLCQ$dCEF$dUWO$dOCLCQ
019 $a10716729$a190827235$a222046525$a811361760$a986652136$a994579009$a1004801355$a1011983107$a1013399591$a1016289056$a1043954640$a1049731480$a1056265015$a1059820885$a1060725283$a1066800413
020 $a0387127275$q(U.S. ;$qpbk.)
020 $a9780387127279$q(U.S. ;$qpbk.)
020 $a3540127275
020 $a9783540127277
020 $z9783540387145$q(electronic bk.)
020 $z3540387145$q(electronic bk.)
035 $a(OCoLC)9943746$z(OCoLC)10716729$z(OCoLC)190827235$z(OCoLC)222046525$z(OCoLC)811361760$z(OCoLC)986652136$z(OCoLC)994579009$z(OCoLC)1004801355$z(OCoLC)1011983107$z(OCoLC)1013399591$z(OCoLC)1016289056$z(OCoLC)1043954640$z(OCoLC)1049731480$z(OCoLC)1056265015$z(OCoLC)1059820885$z(OCoLC)1060725283$z(OCoLC)1066800413
041 0 $aeng$afre
050 00 $aQA166.2$b.C3 1983
082 00 $a511/.5$219
084 $a31.12$2bcl
084 $a54.62$2bcl
084 $a54.10$2bcl
111 2 $aCAAP '83$n(8th :$d1983 :$cL'Aquila, Italy)
245 10 $aTrees in algebra and programming :$b8th colloquium, L'Aquila, March 9-11, 1983 : proceedings /$cCAAP '83 ; edited by G. Ausiello and M. Protasi.
260 $aBerlin ;$aNew York :$bSpringer-Verlag,$c1983.
300 $avi, 416 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aLecture notes in computer science ;$v159
504 $aIncludes bibliographical references.
546 $aEnglish and French.
650 0 $aTrees (Graph theory)$xData processing$vCongresses.
650 0 $aData structures (Computer science)$vCongresses.
650 0 $aComputational complexity$vCongresses.
650 6 $aArbres (Théorie des graphes)$xInformatique$xCongrès.
650 6 $aStructures de données (Informatique)$vCongrès.
650 6 $aComplexité de calcul (Informatique)$vCongrès.
650 7 $aComputational complexity.$2fast$0(OCoLC)fst00871991
650 7 $aData structures (Computer science)$2fast$0(OCoLC)fst00887978
650 7 $aTrees (Graph theory)$xData processing.$2fast$0(OCoLC)fst01156139
650 17 $aGrafentheorie.$2gtt
650 17 $aDatastructuren.$2gtt
650 7 $aAnalise combinatoria.$2larpcal
655 7 $aConference papers and proceedings.$2fast$0(OCoLC)fst01423772
700 1 $aAusiello, G.$q(Giorgio),$d1941-
700 1 $aProtasi, M.$q(Marco),$d1950-
776 08 $iOnline version:$aCAAP '83 (8th : 1983 : L'Aquila, Italy).$tTrees in algebra and programming.$dBerlin ; New York : Springer-Verlag, 1983$z9783540387145$w(OCoLC)326982402
830 0 $aLecture notes in computer science ;$v159.
856 41 $3(n.149, 1983 - current) available via SpringerLink$uhttp://www.library.tufts.edu/ezproxy/ezproxy.asp?LOCATION=SpLinkLeNoCoSc
856 41 $uhttp://link.springer.com/10.1007/3-540-12727-5$zSpringer Lecture Notes in Computer Science
856 4 $zConnect to Internet resource$xLNCS$uhttp://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=159
938 $aBrodart$bBROD$n34682058$c$18.00
938 $aBaker and Taylor$bBTCP$n83016909
938 $aYBP Library Services$bYANK$n317558
029 1 $aAU@$b000002883177
029 1 $aAU@$b000012402705
029 1 $aNLGGC$b833322702
029 1 $aNZ1$b4077917
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 298 OTHER HOLDINGS