Competitive paging algorithms:
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Pittsburgh, Pa.
1988
|
Schriftenreihe: | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS
88,196 |
Schlagworte: | |
Beschreibung: | 13 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009245627 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1988 |||| 00||| eng d | ||
035 | |a (OCoLC)19081636 | ||
035 | |a (DE-599)BVBBV009245627 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
082 | 0 | |a 510.7808 |b C28r 88-196 | |
245 | 1 | 0 | |a Competitive paging algorithms |c Amos Fiat ... |
264 | 1 | |a Pittsburgh, Pa. |c 1988 | |
300 | |a 13 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |v 88,196 | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Mathematical optimization | |
700 | 1 | |a Fiat, Amos |e Sonstige |4 oth | |
810 | 2 | |a Computer Science Department: CMU-CS |t Carnegie-Mellon University <Pittsburgh, Pa.> |v 88,196 |w (DE-604)BV006187264 |9 88,196 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006151973 |
Datensatz im Suchindex
_version_ | 1804123692815351808 |
---|---|
any_adam_object | |
building | Verbundindex |
bvnumber | BV009245627 |
ctrlnum | (OCoLC)19081636 (DE-599)BVBBV009245627 |
dewey-full | 510.7808 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510.7808 |
dewey-search | 510.7808 |
dewey-sort | 3510.7808 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00971nam a2200301 cb4500</leader><controlfield tag="001">BV009245627</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1988 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19081636</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245627</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 88-196</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Competitive paging algorithms</subfield><subfield code="c">Amos Fiat ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS</subfield><subfield code="v">88,196</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fiat, Amos</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CMU-CS</subfield><subfield code="t">Carnegie-Mellon University <Pittsburgh, Pa.></subfield><subfield code="v">88,196</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">88,196</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006151973</subfield></datafield></record></collection> |
id | DE-604.BV009245627 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:33:49Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006151973 |
oclc_num | 19081636 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 13 S. |
publishDate | 1988 |
publishDateSearch | 1988 |
publishDateSort | 1988 |
record_format | marc |
series2 | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |
spelling | Competitive paging algorithms Amos Fiat ... Pittsburgh, Pa. 1988 13 S. txt rdacontent n rdamedia nc rdacarrier Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS 88,196 Algorithms Mathematical optimization Fiat, Amos Sonstige oth Computer Science Department: CMU-CS Carnegie-Mellon University <Pittsburgh, Pa.> 88,196 (DE-604)BV006187264 88,196 |
spellingShingle | Competitive paging algorithms Algorithms Mathematical optimization |
title | Competitive paging algorithms |
title_auth | Competitive paging algorithms |
title_exact_search | Competitive paging algorithms |
title_full | Competitive paging algorithms Amos Fiat ... |
title_fullStr | Competitive paging algorithms Amos Fiat ... |
title_full_unstemmed | Competitive paging algorithms Amos Fiat ... |
title_short | Competitive paging algorithms |
title_sort | competitive paging algorithms |
topic | Algorithms Mathematical optimization |
topic_facet | Algorithms Mathematical optimization |
volume_link | (DE-604)BV006187264 |
work_keys_str_mv | AT fiatamos competitivepagingalgorithms |