Tight bounds on the complexity of parallel sorting:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Mass. Inst. of Technology
1985
|
| Schlagworte: | |
| Beschreibung: | 23 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021896111 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 910226s1985 |||| 00||| eng d | ||
| 035 | |a (OCoLC)14711547 | ||
| 035 | |a (DE-599)BVBBV021896111 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT LCS TM 272 | ||
| 100 | 1 | |a Leighton, Frank T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tight bounds on the complexity of parallel sorting |c Tom Leighton |
| 264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Mass. Inst. of Technology |c 1985 | |
| 300 | |a 23 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Integrated circuits |x Very large scale integration | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Schaltkreistechnik |0 (DE-588)4206945-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kommunikation |0 (DE-588)4031883-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kommunikation |0 (DE-588)4031883-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Schaltkreistechnik |0 (DE-588)4206945-2 |D s |
| 689 | 4 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015111295 | ||
Datensatz im Suchindex
| _version_ | 1804135840839892992 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Leighton, Frank T. |
| author_facet | Leighton, Frank T. |
| author_role | aut |
| author_sort | Leighton, Frank T. |
| author_variant | f t l ft ftl |
| building | Verbundindex |
| bvnumber | BV021896111 |
| ctrlnum | (OCoLC)14711547 (DE-599)BVBBV021896111 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01561nam a2200457zc 4500</leader><controlfield tag="001">BV021896111</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910226s1985 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14711547</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896111</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="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 272</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Leighton, Frank T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tight bounds on the complexity of parallel sorting</subfield><subfield code="c">Tom Leighton</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Mass. Inst. of Technology</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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="650" ind1=" " ind2="4"><subfield code="a">Integrated circuits</subfield><subfield code="x">Very large scale integration</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltkreistechnik</subfield><subfield code="0">(DE-588)4206945-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</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">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Schaltkreistechnik</subfield><subfield code="0">(DE-588)4206945-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111295</subfield></datafield></record></collection> |
| id | DE-604.BV021896111 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:23Z |
| indexdate | 2024-07-09T20:46:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111295 |
| oclc_num | 14711547 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 23 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Laboratory for Computer Science, Mass. Inst. of Technology |
| record_format | marc |
| spelling | Leighton, Frank T. Verfasser aut Tight bounds on the complexity of parallel sorting Tom Leighton Cambridge, Mass. Laboratory for Computer Science, Mass. Inst. of Technology 1985 23 S. txt rdacontent n rdamedia nc rdacarrier Integrated circuits Very large scale integration Sorting (Electronic computers) Komplexität (DE-588)4135369-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Schaltkreistechnik (DE-588)4206945-2 gnd rswk-swf Kommunikation (DE-588)4031883-7 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Kommunikation (DE-588)4031883-7 s Parallelverarbeitung (DE-588)4075860-6 s Komplexität (DE-588)4135369-9 s Schaltkreistechnik (DE-588)4206945-2 s |
| spellingShingle | Leighton, Frank T. Tight bounds on the complexity of parallel sorting Integrated circuits Very large scale integration Sorting (Electronic computers) Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Schaltkreistechnik (DE-588)4206945-2 gnd Kommunikation (DE-588)4031883-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4001183-5 (DE-588)4206945-2 (DE-588)4031883-7 (DE-588)4075860-6 |
| title | Tight bounds on the complexity of parallel sorting |
| title_auth | Tight bounds on the complexity of parallel sorting |
| title_exact_search | Tight bounds on the complexity of parallel sorting |
| title_exact_search_txtP | Tight bounds on the complexity of parallel sorting |
| title_full | Tight bounds on the complexity of parallel sorting Tom Leighton |
| title_fullStr | Tight bounds on the complexity of parallel sorting Tom Leighton |
| title_full_unstemmed | Tight bounds on the complexity of parallel sorting Tom Leighton |
| title_short | Tight bounds on the complexity of parallel sorting |
| title_sort | tight bounds on the complexity of parallel sorting |
| topic | Integrated circuits Very large scale integration Sorting (Electronic computers) Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Schaltkreistechnik (DE-588)4206945-2 gnd Kommunikation (DE-588)4031883-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Integrated circuits Very large scale integration Sorting (Electronic computers) Komplexität Algorithmus Schaltkreistechnik Kommunikation Parallelverarbeitung |
| work_keys_str_mv | AT leightonfrankt tightboundsonthecomplexityofparallelsorting |