The analysis of a practical and nearly optimal priority queue:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Garland
1980
|
| Schriftenreihe: | Outstanding dissertations in the computer sciences.
|
| Schlagwörter: | |
| Beschreibung: | Zugl.: Stanford (Calif.), Stanford Univ., Diss., 1977 |
| Umfang: | 99 S. graph. Darst. |
| ISBN: | 0824044088 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002284323 | ||
| 003 | DE-604 | ||
| 005 | 20180709 | ||
| 007 | t| | ||
| 008 | 890928s1980 xx d||| m||| 00||| eng d | ||
| 020 | |a 0824044088 |9 0-8240-4408-8 | ||
| 035 | |a (OCoLC)4883358 | ||
| 035 | |a (DE-599)BVBBV002284323 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-83 | ||
| 050 | 0 | |a QA76.9.D35 | |
| 082 | 0 | |a 001.6/42 | |
| 084 | |a ST 270 |0 (DE-625)143638: |2 rvk | ||
| 100 | 1 | |a Brown, Mark Robbin |d 1952- |e Verfasser |0 (DE-588)115610359 |4 aut | |
| 245 | 1 | 0 | |a The analysis of a practical and nearly optimal priority queue |
| 264 | 1 | |a New York |b Garland |c 1980 | |
| 300 | |a 99 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Outstanding dissertations in the computer sciences. | |
| 500 | |a Zugl.: Stanford (Calif.), Stanford Univ., Diss., 1977 | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Queuing theory |x Data processing | |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlange |0 (DE-588)4189150-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Warteschlange |0 (DE-588)4189150-8 |D s |
| 689 | 1 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001501259 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 DAT 455f 2001 A 8829 |
|---|---|
| DE-BY-TUM_katkey | 380627 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010632025 |
| _version_ | 1821938001851187200 |
| any_adam_object | |
| author | Brown, Mark Robbin 1952- |
| author_GND | (DE-588)115610359 |
| author_facet | Brown, Mark Robbin 1952- |
| author_role | aut |
| author_sort | Brown, Mark Robbin 1952- |
| author_variant | m r b mr mrb |
| building | Verbundindex |
| bvnumber | BV002284323 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D35 |
| callnumber-search | QA76.9.D35 |
| callnumber-sort | QA 276.9 D35 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 270 |
| ctrlnum | (OCoLC)4883358 (DE-599)BVBBV002284323 |
| dewey-full | 001.6/42 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 001 - Knowledge |
| dewey-raw | 001.6/42 |
| dewey-search | 001.6/42 |
| dewey-sort | 11.6 242 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeines Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01579nam a2200457 c 4500</leader><controlfield tag="001">BV002284323</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180709 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890928s1980 xx d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0824044088</subfield><subfield code="9">0-8240-4408-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4883358</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002284323</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-91G</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D35</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.6/42</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 270</subfield><subfield code="0">(DE-625)143638:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brown, Mark Robbin</subfield><subfield code="d">1952-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115610359</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The analysis of a practical and nearly optimal priority queue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Garland</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">99 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Outstanding dissertations in the computer sciences.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Stanford (Calif.), Stanford Univ., Diss., 1977</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001501259</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV002284323 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T07:48:52Z |
| institution | BVB |
| isbn | 0824044088 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001501259 |
| oclc_num | 4883358 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-83 |
| physical | 99 S. graph. Darst. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Garland |
| record_format | marc |
| series2 | Outstanding dissertations in the computer sciences. |
| spellingShingle | Brown, Mark Robbin 1952- The analysis of a practical and nearly optimal priority queue Datenverarbeitung Data structures (Computer science) Queuing theory Data processing Datenverarbeitung (DE-588)4011152-0 gnd Datenstruktur (DE-588)4011146-5 gnd Warteschlange (DE-588)4189150-8 gnd |
| subject_GND | (DE-588)4011152-0 (DE-588)4011146-5 (DE-588)4189150-8 (DE-588)4113937-9 |
| title | The analysis of a practical and nearly optimal priority queue |
| title_auth | The analysis of a practical and nearly optimal priority queue |
| title_exact_search | The analysis of a practical and nearly optimal priority queue |
| title_full | The analysis of a practical and nearly optimal priority queue |
| title_fullStr | The analysis of a practical and nearly optimal priority queue |
| title_full_unstemmed | The analysis of a practical and nearly optimal priority queue |
| title_short | The analysis of a practical and nearly optimal priority queue |
| title_sort | the analysis of a practical and nearly optimal priority queue |
| topic | Datenverarbeitung Data structures (Computer science) Queuing theory Data processing Datenverarbeitung (DE-588)4011152-0 gnd Datenstruktur (DE-588)4011146-5 gnd Warteschlange (DE-588)4189150-8 gnd |
| topic_facet | Datenverarbeitung Data structures (Computer science) Queuing theory Data processing Datenstruktur Warteschlange Hochschulschrift |
| work_keys_str_mv | AT brownmarkrobbin theanalysisofapracticalandnearlyoptimalpriorityqueue |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 455f 2001 A 8829
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |