| Record ID | ia:caap8813thcolloq0299coll |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/caap8813thcolloq0299coll/caap8813thcolloq0299coll_marc.xml |
| Download MARC binary | https://www.archive.org/download/caap8813thcolloq0299coll/caap8813thcolloq0299coll_meta.mrc |
LEADER: 04133cam 2200769 a 4500
001 ocm17620765
003 OCoLC
005 20200630184049.0
008 880225s1988 gw a b 101 0 eng
010 $a 88004649
040 $aDLC$beng$cDLC$dFPU$dBTCTA$dLVB$dBAKER$dYDXCP$dZWZ$dTFW$dBDX$dGBVCP$dOCLCO$dOCLCF$dOCLCQ$dOCLCO$dOCLCQ$dOCL$dOCLCO$dOCLCQ$dUKBTH
019 $a190829522$a811367427$a976678274$a978966795$a986549505$a988628128$a994484129$a1011834207$a1013232594$a1025467426$a1044006869$a1049743235$a1051311880$a1052938122$a1056267659$a1060801253$a1066831538$a1080704942
020 $a038719021X$q(U.S.)
020 $a9780387190211$q(U.S.)
020 $a354019021X
020 $a9783540190219
035 $a(OCoLC)17620765$z(OCoLC)190829522$z(OCoLC)811367427$z(OCoLC)976678274$z(OCoLC)978966795$z(OCoLC)986549505$z(OCoLC)988628128$z(OCoLC)994484129$z(OCoLC)1011834207$z(OCoLC)1013232594$z(OCoLC)1025467426$z(OCoLC)1044006869$z(OCoLC)1049743235$z(OCoLC)1051311880$z(OCoLC)1052938122$z(OCoLC)1056267659$z(OCoLC)1060801253$z(OCoLC)1066831538$z(OCoLC)1080704942
050 00 $aQA166.2$b.C65 1988
080 0 $a518.24
082 00 $a511/.5$219
084 $a*00B25$2msc
084 $a68-06$2msc
084 $a28$a27$2sdnb
111 2 $aColloquium on Trees in Algebra and Programming$n(13th :$d1988 :$cNancy, France)
245 10 $aCAAP '88 :$b13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988 : proceedings /$cM. Dauchet, M. Nivat.
260 $aBerlin ;$aNew York :$bSpringer-Verlag,$c©1988.
300 $aviii, 303 pages :$billustrations ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aLecture notes in computer science ;$v299
500 $aHeld in conjunction with ESOP '88.
504 $aIncludes bibliographical references and index.
530 $aSome issues available on the Internet. Access restricted to members of the Tufts University community.
538 $aMode of access: World Wide Web.
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$vCongrès.
650 6 $aComplexité de calcul (Informatique)$vCongrès.
650 6 $aStructures de données (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 7 $aArbres (Théorie des graphes)$xInformatique$xCongrès.$2ram
650 7 $aStructure de données (Informatique)$xCongrès.$2ram
650 7 $aComplexité de calcul (Informatique)$xCongrès.$2ram
655 4 $aElectronic resources (Books)
655 7 $aConference papers and proceedings.$2fast$0(OCoLC)fst01423772
700 1 $aDauchet, M.$q(Max),$d1946-
700 1 $aNivat, M.
711 2 $aEuropean Symposium on Programming$n(2nd :$d1988 :$cNancy, France)
776 08 $iOnline version:$aColloquium on Trees in Algebra and Programming (13th : 1988 : Nancy, France).$tCAAP '88.$dBerlin ; New York : Springer-Verlag, ©1988$w(OCoLC)568021478
830 0 $aLecture notes in computer science ;$v299.
856 41 $3(n.149, 1983 - current) available via SpringerLink$uhttp://www.library.tufts.edu/ezproxy/ezproxy.asp?LOCATION=SpLinkLeNoCoSc
856 41 $3Table of contents$uhttp://www.gbv.de/dms/bowker/toc/9783540190219.pdf
856 42 $3Inhaltstext$uhttp://www.zentralblatt-math.org/zmath/en/search/?an=0635.00017
938 $aBaker & Taylor$bBKTY$c59.95$d59.95$i038719021X$n0001415705$sactive
938 $aBrodart$bBROD$n39458628$c$27.30
938 $aBaker and Taylor$bBTCP$n88004649
938 $aYBP Library Services$bYANK$n320365
029 1 $aAU@$b000005763425
029 1 $aGBVCP$b021718628
029 1 $aNLGGC$b045714266
029 1 $aNZ1$b3332706
994 $aZ0$bP4A
948 $hHELD BY P4A - 230 OTHER HOLDINGS