A time-space tradeoff for sorting on a general sequential model of computation:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Toronto
Univ. of Toronto, Dep. of Computer Science
1979
|
| Schriftenreihe: | University <Toronto> / Department of Computer Science: Technical report
133 |
| Schlagworte: | |
| Beschreibung: | 27 S. Zählung |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011833525 | ||
| 003 | DE-604 | ||
| 005 | 19980320 | ||
| 007 | t | ||
| 008 | 980317s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)77453308 | ||
| 035 | |a (DE-599)BVBBV011833525 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510 | |
| 100 | 1 | |a Borodin, A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A time-space tradeoff for sorting on a general sequential model of computation |c A. Borodin ; S. Cook |
| 264 | 1 | |a Toronto |b Univ. of Toronto, Dep. of Computer Science |c 1979 | |
| 300 | |a 27 S. Zählung | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Toronto> / Department of Computer Science: Technical report |v 133 | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Tri (Informatique) | |
| 700 | 1 | |a Cook, S. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University <Toronto> |v 133 |w (DE-604)BV005455013 |9 133 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007991488 | ||
Datensatz im Suchindex
| _version_ | 1804126377352364032 |
|---|---|
| any_adam_object | |
| author | Borodin, A. Cook, S. |
| author_facet | Borodin, A. Cook, S. |
| author_role | aut aut |
| author_sort | Borodin, A. |
| author_variant | a b ab s c sc |
| building | Verbundindex |
| bvnumber | BV011833525 |
| ctrlnum | (OCoLC)77453308 (DE-599)BVBBV011833525 |
| dewey-full | 510 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510 |
| dewey-search | 510 |
| dewey-sort | 3510 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01088nam a2200313 cb4500</leader><controlfield tag="001">BV011833525</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980320 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980317s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)77453308</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011833525</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-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Borodin, A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A time-space tradeoff for sorting on a general sequential model of computation</subfield><subfield code="c">A. Borodin ; S. Cook</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Toronto</subfield><subfield code="b">Univ. of Toronto, Dep. of Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 S. Zählung</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">University <Toronto> / Department of Computer Science: Technical report</subfield><subfield code="v">133</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tri (Informatique)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cook, S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University <Toronto></subfield><subfield code="v">133</subfield><subfield code="w">(DE-604)BV005455013</subfield><subfield code="9">133</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007991488</subfield></datafield></record></collection> |
| id | DE-604.BV011833525 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:16:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007991488 |
| oclc_num | 77453308 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 27 S. Zählung |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Univ. of Toronto, Dep. of Computer Science |
| record_format | marc |
| series2 | University <Toronto> / Department of Computer Science: Technical report |
| spelling | Borodin, A. Verfasser aut A time-space tradeoff for sorting on a general sequential model of computation A. Borodin ; S. Cook Toronto Univ. of Toronto, Dep. of Computer Science 1979 27 S. Zählung txt rdacontent n rdamedia nc rdacarrier University <Toronto> / Department of Computer Science: Technical report 133 Complexité de calcul (Informatique) Tri (Informatique) Cook, S. Verfasser aut Department of Computer Science: Technical report University <Toronto> 133 (DE-604)BV005455013 133 |
| spellingShingle | Borodin, A. Cook, S. A time-space tradeoff for sorting on a general sequential model of computation Complexité de calcul (Informatique) Tri (Informatique) |
| title | A time-space tradeoff for sorting on a general sequential model of computation |
| title_auth | A time-space tradeoff for sorting on a general sequential model of computation |
| title_exact_search | A time-space tradeoff for sorting on a general sequential model of computation |
| title_full | A time-space tradeoff for sorting on a general sequential model of computation A. Borodin ; S. Cook |
| title_fullStr | A time-space tradeoff for sorting on a general sequential model of computation A. Borodin ; S. Cook |
| title_full_unstemmed | A time-space tradeoff for sorting on a general sequential model of computation A. Borodin ; S. Cook |
| title_short | A time-space tradeoff for sorting on a general sequential model of computation |
| title_sort | a time space tradeoff for sorting on a general sequential model of computation |
| topic | Complexité de calcul (Informatique) Tri (Informatique) |
| topic_facet | Complexité de calcul (Informatique) Tri (Informatique) |
| volume_link | (DE-604)BV005455013 |
| work_keys_str_mv | AT borodina atimespacetradeoffforsortingonageneralsequentialmodelofcomputation AT cooks atimespacetradeoffforsortingonageneralsequentialmodelofcomputation |