"When can we sort in o (n log n) time?" revisited:
Abstract: "In the paper mentioned in the title, Galil and the author examined the conditions under which a RAM model allows sorting in o(n log n) worst-case time. The results in this paper were largely inspired by Fredman and Willard's Fusion Tree sorting algorithm. In this report, the res...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
København
1995
|
| Series: | Datalogisk Institut <København>: DIKU-Rapport
1995,21 |
| Subjects: | |
| Summary: | Abstract: "In the paper mentioned in the title, Galil and the author examined the conditions under which a RAM model allows sorting in o(n log n) worst-case time. The results in this paper were largely inspired by Fredman and Willard's Fusion Tree sorting algorithm. In this report, the results are re-examined in view of recent, fast sorting algorithms by Anderson, Hagerup, Nilsson and Raman." |
| Physical Description: | 7 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010685730 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960326s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)38561894 | ||
| 035 | |a (DE-599)BVBBV010685730 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ben-Amram, Amir M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a "When can we sort in o (n log n) time?" revisited |
| 264 | 1 | |a København |c 1995 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,21 | |
| 520 | 3 | |a Abstract: "In the paper mentioned in the title, Galil and the author examined the conditions under which a RAM model allows sorting in o(n log n) worst-case time. The results in this paper were largely inspired by Fredman and Willard's Fusion Tree sorting algorithm. In this report, the results are re-examined in view of recent, fast sorting algorithms by Anderson, Hagerup, Nilsson and Raman." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Numbers, Random | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,21 |w (DE-604)BV010011493 |9 1995,21 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007132246 | ||
Record in the Search Index
| _version_ | 1804125163486183424 |
|---|---|
| any_adam_object | |
| author | Ben-Amram, Amir M. |
| author_facet | Ben-Amram, Amir M. |
| author_role | aut |
| author_sort | Ben-Amram, Amir M. |
| author_variant | a m b a amb amba |
| building | Verbundindex |
| bvnumber | BV010685730 |
| ctrlnum | (OCoLC)38561894 (DE-599)BVBBV010685730 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01322nam a2200313 cb4500</leader><controlfield tag="001">BV010685730</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960326s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38561894</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010685730</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ben-Amram, Amir M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">"When can we sort in o (n log n) time?" revisited</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,21</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In the paper mentioned in the title, Galil and the author examined the conditions under which a RAM model allows sorting in o(n log n) worst-case time. The results in this paper were largely inspired by Fredman and Willard's Fusion Tree sorting algorithm. In this report, the results are re-examined in view of recent, fast sorting algorithms by Anderson, Hagerup, Nilsson and Raman."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numbers, Random</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,21</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1995,21</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007132246</subfield></datafield></record></collection> |
| id | DE-604.BV010685730 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:57:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007132246 |
| oclc_num | 38561894 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 7 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Ben-Amram, Amir M. Verfasser aut "When can we sort in o (n log n) time?" revisited København 1995 7 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,21 Abstract: "In the paper mentioned in the title, Galil and the author examined the conditions under which a RAM model allows sorting in o(n log n) worst-case time. The results in this paper were largely inspired by Fredman and Willard's Fusion Tree sorting algorithm. In this report, the results are re-examined in view of recent, fast sorting algorithms by Anderson, Hagerup, Nilsson and Raman." Algorithms Numbers, Random Sorting (Electronic computers) Datalogisk Institut <København>: DIKU-Rapport 1995,21 (DE-604)BV010011493 1995,21 |
| spellingShingle | Ben-Amram, Amir M. "When can we sort in o (n log n) time?" revisited Datalogisk Institut <København>: DIKU-Rapport Algorithms Numbers, Random Sorting (Electronic computers) |
| title | "When can we sort in o (n log n) time?" revisited |
| title_auth | "When can we sort in o (n log n) time?" revisited |
| title_exact_search | "When can we sort in o (n log n) time?" revisited |
| title_full | "When can we sort in o (n log n) time?" revisited |
| title_fullStr | "When can we sort in o (n log n) time?" revisited |
| title_full_unstemmed | "When can we sort in o (n log n) time?" revisited |
| title_short | "When can we sort in o (n log n) time?" revisited |
| title_sort | when can we sort in o n log n time revisited |
| topic | Algorithms Numbers, Random Sorting (Electronic computers) |
| topic_facet | Algorithms Numbers, Random Sorting (Electronic computers) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT benamramamirm whencanwesortinonlogntimerevisited |