Linear lists and priority queues as balanced binary trees:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
1972
|
| Schlagworte: | |
| Beschreibung: | Stanford, Calif., Univ., Diss., 1972. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. |
| Beschreibung: | 131 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021927654 | ||
| 003 | DE-604 | ||
| 005 | 20041022000000.0 | ||
| 007 | t | ||
| 008 | 951215s1972 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)25841630 | ||
| 035 | |a (DE-599)BVBBV021927654 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Crane, Clark Allan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear lists and priority queues as balanced binary trees |c by Clark Allan Crane |
| 264 | 1 | |c 1972 | |
| 300 | |a 131 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Stanford, Calif., Univ., Diss., 1972. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. | ||
| 650 | 4 | |a List processing (Electronic computers) | |
| 650 | 4 | |a Queuing theory | |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 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 |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Listenverarbeitung |0 (DE-588)4167833-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015142811 | ||
Datensatz im Suchindex
| _version_ | 1804135883514839040 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Crane, Clark Allan |
| author_facet | Crane, Clark Allan |
| author_role | aut |
| author_sort | Crane, Clark Allan |
| author_variant | c a c ca cac |
| building | Verbundindex |
| bvnumber | BV021927654 |
| ctrlnum | (OCoLC)25841630 (DE-599)BVBBV021927654 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01363nam a2200397zc 4500</leader><controlfield tag="001">BV021927654</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041022000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951215s1972 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25841630</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021927654</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Crane, Clark Allan</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><subfield code="c">by Clark Allan Crane</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1972</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">131 Bl.</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="500" ind1=" " ind2=" "><subfield code="a">Stanford, Calif., Univ., Diss., 1972. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich.</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="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="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="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">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Listenverarbeitung</subfield><subfield code="0">(DE-588)4167833-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015142811</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021927654 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:06:05Z |
| indexdate | 2024-07-09T20:47:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015142811 |
| oclc_num | 25841630 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 131 Bl. graph. Darst. |
| publishDate | 1972 |
| publishDateSearch | 1972 |
| publishDateSort | 1972 |
| record_format | marc |
| spelling | Crane, Clark Allan Verfasser aut Linear lists and priority queues as balanced binary trees by Clark Allan Crane 1972 131 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Stanford, Calif., Univ., Diss., 1972. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. List processing (Electronic computers) Queuing theory Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Listenverarbeitung (DE-588)4167833-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Graph (DE-588)4021842-9 s DE-604 Listenverarbeitung (DE-588)4167833-3 s Warteschlangentheorie (DE-588)4255044-0 s |
| spellingShingle | Crane, Clark Allan Linear lists and priority queues as balanced binary trees List processing (Electronic computers) Queuing theory Warteschlangentheorie (DE-588)4255044-0 gnd Graph (DE-588)4021842-9 gnd Listenverarbeitung (DE-588)4167833-3 gnd |
| subject_GND | (DE-588)4255044-0 (DE-588)4021842-9 (DE-588)4167833-3 (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_exact_search_txtP | Linear lists and priority queues as balanced binary trees |
| title_full | Linear lists and priority queues as balanced binary trees by Clark Allan Crane |
| title_fullStr | Linear lists and priority queues as balanced binary trees by Clark Allan Crane |
| title_full_unstemmed | Linear lists and priority queues as balanced binary trees by Clark Allan Crane |
| title_short | Linear lists and priority queues as balanced binary trees |
| title_sort | linear lists and priority queues as balanced binary trees |
| topic | List processing (Electronic computers) Queuing theory Warteschlangentheorie (DE-588)4255044-0 gnd Graph (DE-588)4021842-9 gnd Listenverarbeitung (DE-588)4167833-3 gnd |
| topic_facet | List processing (Electronic computers) Queuing theory Warteschlangentheorie Graph Listenverarbeitung Hochschulschrift |
| work_keys_str_mv | AT craneclarkallan linearlistsandpriorityqueuesasbalancedbinarytrees |