Linear lists and priority queues as balanced binary trees:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York u.a.
Garland
1980
|
| Schriftenreihe: | Outstanding dissertations in the computer sciences.
|
| Schlagworte: | |
| Beschreibung: | Zugl.: Stanford, Calif., Stanford Univ., Diss., 1972 |
| Beschreibung: | 131, 24 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002104653 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 890928s1980 m||| 00||| eng d | ||
| 035 | |a (OCoLC)7070991 | ||
| 035 | |a (DE-599)BVBBV002104653 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-83 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 001.6/42 |2 19 | |
| 100 | 1 | |a Crane, Clark A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear lists and priority queues as balanced binary trees |
| 264 | 1 | |a New York u.a. |b Garland |c 1980 | |
| 300 | |a 131, 24 S. | ||
| 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., 1972 | ||
| 650 | 7 | |a Grafentheorie |2 gtt | |
| 650 | 7 | |a Wachttijdproblemen |2 gtt | |
| 650 | 4 | |a List processing (Electronic computers) | |
| 650 | 4 | |a Queuing theory | |
| 650 | 4 | |a Trees (Graph theory) | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Listenverarbeitung |0 (DE-588)4167833-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Listenverarbeitung |0 (DE-588)4167833-3 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 940 | 1 | |q TUB-nveb | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001379809 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804116558065172480 |
|---|---|
| any_adam_object | |
| author | Crane, Clark A. |
| author_facet | Crane, Clark A. |
| author_role | aut |
| author_sort | Crane, Clark A. |
| author_variant | c a c ca cac |
| building | Verbundindex |
| bvnumber | BV002104653 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)7070991 (DE-599)BVBBV002104653 |
| 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 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01836nam a2200517 c 4500</leader><controlfield tag="001">BV002104653</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1980 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)7070991</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002104653</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.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.6/42</subfield><subfield code="2">19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Crane, Clark A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear lists and priority queues as balanced binary trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York u.a.</subfield><subfield code="b">Garland</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">131, 24 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="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., 1972</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wachttijdproblemen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">List processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Listenverarbeitung</subfield><subfield code="0">(DE-588)4167833-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</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">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Listenverarbeitung</subfield><subfield code="0">(DE-588)4167833-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001379809</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV002104653 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:40:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001379809 |
| oclc_num | 7070991 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-83 |
| physical | 131, 24 S. |
| psigel | TUB-nveb |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Garland |
| record_format | marc |
| series2 | Outstanding dissertations in the computer sciences. |
| spelling | Crane, Clark A. Verfasser aut Linear lists and priority queues as balanced binary trees New York u.a. Garland 1980 131, 24 S. txt rdacontent n rdamedia nc rdacarrier Outstanding dissertations in the computer sciences. Zugl.: Stanford, Calif., Stanford Univ., Diss., 1972 Grafentheorie gtt Wachttijdproblemen gtt List processing (Electronic computers) Queuing theory Trees (Graph theory) Graph (DE-588)4021842-9 gnd rswk-swf Listenverarbeitung (DE-588)4167833-3 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Warteschlangentheorie (DE-588)4255044-0 s 1\p DE-604 Listenverarbeitung (DE-588)4167833-3 s 2\p DE-604 Graph (DE-588)4021842-9 s 3\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Crane, Clark A. Linear lists and priority queues as balanced binary trees Grafentheorie gtt Wachttijdproblemen gtt List processing (Electronic computers) Queuing theory Trees (Graph theory) Graph (DE-588)4021842-9 gnd Listenverarbeitung (DE-588)4167833-3 gnd Warteschlangentheorie (DE-588)4255044-0 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4167833-3 (DE-588)4255044-0 (DE-588)4113937-9 |
| title | Linear lists and priority queues as balanced binary trees |
| title_auth | Linear lists and priority queues as balanced binary trees |
| title_exact_search | Linear lists and priority queues as balanced binary trees |
| title_full | Linear lists and priority queues as balanced binary trees |
| title_fullStr | Linear lists and priority queues as balanced binary trees |
| title_full_unstemmed | Linear lists and priority queues as balanced binary trees |
| title_short | Linear lists and priority queues as balanced binary trees |
| title_sort | linear lists and priority queues as balanced binary trees |
| topic | Grafentheorie gtt Wachttijdproblemen gtt List processing (Electronic computers) Queuing theory Trees (Graph theory) Graph (DE-588)4021842-9 gnd Listenverarbeitung (DE-588)4167833-3 gnd Warteschlangentheorie (DE-588)4255044-0 gnd |
| topic_facet | Grafentheorie Wachttijdproblemen List processing (Electronic computers) Queuing theory Trees (Graph theory) Graph Listenverarbeitung Warteschlangentheorie Hochschulschrift |
| work_keys_str_mv | AT craneclarka linearlistsandpriorityqueuesasbalancedbinarytrees |