LDR | |
01152nam a2200361Ka 4500 |
001 |
|
000718248 |
003 |
|
MiAaHDL |
005 |
|
20090407000000.0 |
006 |
|
m d |
007 |
|
cr bn ---auaua |
008 |
|
010220s1980 nyua b 000 0 eng |
010 |
⊔ |
⊔ |
‡a 80015754
|
020 |
⊔ |
⊔ |
‡a0444004211
|
035 |
⊔ |
⊔ |
‡asdr-nrlfGLAD51009767-B
|
035 |
⊔ |
⊔ |
‡asdr-miu.990007182480106381
|
035 |
⊔ |
⊔ |
‡aABA-5071
|
040 |
⊔ |
⊔ |
‡aDLC
‡cDLC
‡dm.c.
‡dCU-SC
|
090 |
⊔ |
⊔ |
‡a T57.9
‡b.B78
|
035 |
⊔ |
⊔ |
‡a(OCoLC)6356434
|
100 |
1 |
⊔ |
‡aBruell, Steven C.
|
245 |
1 |
0 |
‡aComputational algorithms for closed queueing networks /
‡cSteven C. Bruell, Gianfranco Balbo.
|
260 |
⊔ |
⊔ |
‡aNew York :
‡bNorth Holland,
‡cc1980.
|
300 |
⊔ |
⊔ |
‡a190 p. :
‡bill. ;
‡c25 cm.
|
490 |
0 |
⊔ |
‡aThe Computer science library
|
490 |
0 |
⊔ |
‡aOperating and programming systems series ;
‡vv. 7
|
504 |
⊔ |
⊔ |
‡aBibliography: p. 161-166.
|
538 |
⊔ |
⊔ |
‡aMode of access: Internet.
|
650 |
⊔ |
0 |
‡aAlgorithms.
|
650 |
⊔ |
0 |
‡aQueuing theory.
|
700 |
1 |
0 |
‡aBalbo, Gianfranco.
|
CID |
⊔ |
⊔ |
‡a000718248
|
DAT |
0 |
⊔ |
‡a20080530110225.0
‡b20090407000000.0
|
DAT |
1 |
⊔ |
‡a20120815184702.0
‡b2024-05-02T18:02:15Z
|
CAT |
⊔ |
⊔ |
‡aSDR-NRLF
‡dLOCAL - GLADIS
‡lloader.pl-001-001
|
FMT |
⊔ |
⊔ |
‡aBK
|
HOL |
⊔ |
⊔ |
‡0sdr-nrlfGLAD51009767-B
‡auc1
‡bSDR
‡cNRLF
‡puc1.b4388225
‡sUC
‡1GLAD51009767-B
|
974 |
⊔ |
⊔ |
‡bUC
‡cNRLF
‡d20240502
‡sgoogle
‡uuc1.b4388225
‡y1980
‡ric
‡qbib
‡tUS bib date1 >= 1930
|
974 |
⊔ |
⊔ |
‡bMIU
‡cMIU
‡d20250104
‡sgoogle
‡umdp.39015026535081
‡y1980
‡ric
‡qbib
‡tUS bib date1 >= 1930
|