Multidimensional divide-and-conquer maximin recurrences:
Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of var...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
University of Illinois at Urbana-Champaign, Dept. of Computer Science
1992
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of various algorithms." |
| Beschreibung: | 20 Bl. ill. 28 cm |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035638819 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 090721s1992 a||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)26366998 | ||
| 035 | |a (DE-599)BVBBV035638819 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 | |
| 088 | |a UIUCDCS-R-92-1757 | ||
| 088 | |a UILU-ENG-92-1737 | ||
| 100 | 1 | |a Alonso, Laurent |d 195X- |e Verfasser |0 (DE-588)134235347 |4 aut | |
| 245 | 1 | 0 | |a Multidimensional divide-and-conquer maximin recurrences |c by Laurent Alonso, Edward M. Reingold, René Schott |
| 246 | 1 | 3 | |a UIUCDCS R 92-1757 |
| 264 | 1 | |a Urbana, Ill. |b University of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1992 | |
| 300 | |a 20 Bl. |b ill. |c 28 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | |a Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of various algorithms." | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Point mappings (Mathematics) | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Point mappings (Mathematics) | |
| 700 | 1 | |a Reingold, Edward M. |e Sonstige |4 oth | |
| 700 | 1 | |a Schott, René |e Sonstige |4 oth | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017693648 | ||
Datensatz im Suchindex
| _version_ | 1804139318670786560 |
|---|---|
| any_adam_object | |
| author | Alonso, Laurent 195X- |
| author_GND | (DE-588)134235347 |
| author_facet | Alonso, Laurent 195X- |
| author_role | aut |
| author_sort | Alonso, Laurent 195X- |
| author_variant | l a la |
| building | Verbundindex |
| bvnumber | BV035638819 |
| ctrlnum | (OCoLC)26366998 (DE-599)BVBBV035638819 |
| dewey-full | 510.78 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.78 |
| dewey-search | 510.78 |
| dewey-sort | 3510.78 |
| 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>01472nam a2200373 c 4500</leader><controlfield tag="001">BV035638819</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090721s1992 a||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26366998</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035638819</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-92-1757</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-92-1737</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alonso, Laurent</subfield><subfield code="d">195X-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134235347</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multidimensional divide-and-conquer maximin recurrences</subfield><subfield code="c">by Laurent Alonso, Edward M. Reingold, René Schott</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS R 92-1757</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">University of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 Bl.</subfield><subfield code="b">ill.</subfield><subfield code="c">28 cm</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="520" ind1=" " ind2=" "><subfield code="a">Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of various algorithms."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Point mappings (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Point mappings (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Reingold, Edward M.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schott, René</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017693648</subfield></datafield></record></collection> |
| id | DE-604.BV035638819 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:42:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017693648 |
| oclc_num | 26366998 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 Bl. ill. 28 cm |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | University of Illinois at Urbana-Champaign, Dept. of Computer Science |
| record_format | marc |
| spelling | Alonso, Laurent 195X- Verfasser (DE-588)134235347 aut Multidimensional divide-and-conquer maximin recurrences by Laurent Alonso, Edward M. Reingold, René Schott UIUCDCS R 92-1757 Urbana, Ill. University of Illinois at Urbana-Champaign, Dept. of Computer Science 1992 20 Bl. ill. 28 cm txt rdacontent n rdamedia nc rdacarrier Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of various algorithms." Algorithms Point mappings (Mathematics) Reingold, Edward M. Sonstige oth Schott, René Sonstige oth |
| spellingShingle | Alonso, Laurent 195X- Multidimensional divide-and-conquer maximin recurrences Algorithms Point mappings (Mathematics) |
| title | Multidimensional divide-and-conquer maximin recurrences |
| title_alt | UIUCDCS R 92-1757 |
| title_auth | Multidimensional divide-and-conquer maximin recurrences |
| title_exact_search | Multidimensional divide-and-conquer maximin recurrences |
| title_full | Multidimensional divide-and-conquer maximin recurrences by Laurent Alonso, Edward M. Reingold, René Schott |
| title_fullStr | Multidimensional divide-and-conquer maximin recurrences by Laurent Alonso, Edward M. Reingold, René Schott |
| title_full_unstemmed | Multidimensional divide-and-conquer maximin recurrences by Laurent Alonso, Edward M. Reingold, René Schott |
| title_short | Multidimensional divide-and-conquer maximin recurrences |
| title_sort | multidimensional divide and conquer maximin recurrences |
| topic | Algorithms Point mappings (Mathematics) |
| topic_facet | Algorithms Point mappings (Mathematics) |
| work_keys_str_mv | AT alonsolaurent multidimensionaldivideandconquermaximinrecurrences AT reingoldedwardm multidimensionaldivideandconquermaximinrecurrences AT schottrene multidimensionaldivideandconquermaximinrecurrences AT alonsolaurent uiucdcsr921757 AT reingoldedwardm uiucdcsr921757 AT schottrene uiucdcsr921757 |