LEADER 00866nam  2200337   450 
001 990000784620203316
010   $a1-880083-07-8
035   $a0078462
035   $aUSA010078462
035   $a(ALEPH)000078462USA01
035   $a0078462
100   $a20011203d1993----km-y0itay0103----ba
101   $aeng
102   $aUS
105   $a||||||||001yy
200 1 $aMathematica$eselected tutorial notes
210   $aChampaign$cWolfram researche$d1993
215   $a405 p$d28 cm
410   $12001
606 0 $aMatematica
676   $a510.
801  0$aIT$bsalbc$gISBD
912   $a990000784620203316
951   $a510 MAT$b11221 ING$c510
959   $aBK
969   $aTEC
979   $aPATTY$b90$c20011203$lUSA01$h1150
979   $c20020403$lUSA01$h1725
979   $aPATRY$b90$c20040406$lUSA01$h1654
996   $aMathematica$9791712
997   $aUNISA

LEADER 01298nam a22003494i 4500
001 991003275189707536
008 160912s2005    enka          000 0 eng  
020   $a0521619467 (pbk.)
035   $ab14307273-39ule_inst
040   $aBibl. Dip.le Aggr. Matematica e Fisica - Sez. Matematica$beng
082 0 $a005.1
084   $aAMS 68Q25
084   $aAMS 68-01
084   $aAMS 68-02
084   $aAMS 68Q10
084   $aAMS 90B18
084   $aLC QA76.9.A43B67
100 1 $aBorodin, Allan$0534960
245 10$aOnline computation and competitive analysis /$cAllan Borodin, Ran El-Yaniv
250   $a1st pbk. ed.
260   $aCambridge [Eng.] ;$aNew York :$bCambridge University Press,$c2005
300   $axviii, 414 p. :$bill ;$c25 cm
650  0$aComputer algorithms
650  0$aComputational complexity
650  0$aMathematical optimization
700 1 $aEl-Yaniv, Ran$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0563957
907   $a.b14307273$b02-11-16$c12-09-16
912   $a991003275189707536
945   $aLE013 68Q BOR12 (2005)$g1$i2013000293325$lle013$op$pE75.00$q-$rl$s-  $t0$u4$v2$w4$x0$y.i15785671$z02-11-16
996   $aOnline computation and competitive analysis$9950713
997   $aUNISALENTO
998   $ale013$b12-09-16$cm$da  $e-$feng$genk$h0$i0