Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1986
|
| Schlagworte: | |
| Beschreibung: | 27 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021896197 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 910301s1986 |||| 00||| eng d | ||
| 035 | |a (OCoLC)17014596 | ||
| 035 | |a (DE-599)BVBBV021896197 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT LCS TM 298 | ||
| 100 | 1 | |a Leighton, Frank T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms |c Tom Leighton ; Peter Shor |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1986 | |
| 300 | |a 27 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a ULSI |0 (DE-588)4226286-0 |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 Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a ULSI |0 (DE-588)4226286-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Shor, Peter |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015111380 | ||
Datensatz im Suchindex
| _version_ | 1804135840973062144 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Leighton, Frank T. Shor, Peter |
| author_facet | Leighton, Frank T. Shor, Peter |
| author_role | aut aut |
| author_sort | Leighton, Frank T. |
| author_variant | f t l ft ftl p s ps |
| building | Verbundindex |
| bvnumber | BV021896197 |
| ctrlnum | (OCoLC)17014596 (DE-599)BVBBV021896197 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01262nam a2200385zc 4500</leader><controlfield tag="001">BV021896197</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910301s1986 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)17014596</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896197</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 298</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 for minimax grid matching, with applications to the average case analysis of algorithms</subfield><subfield code="c">Tom Leighton ; Peter Shor</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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">Algorithms</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">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">ULSI</subfield><subfield code="0">(DE-588)4226286-0</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">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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">ULSI</subfield><subfield code="0">(DE-588)4226286-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shor, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111380</subfield></datafield></record></collection> |
| id | DE-604.BV021896197 |
| 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-015111380 |
| oclc_num | 17014596 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 27 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Leighton, Frank T. Verfasser aut Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms Tom Leighton ; Peter Shor Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1986 27 S. txt rdacontent n rdamedia nc rdacarrier Algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf ULSI (DE-588)4226286-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Kombinatorik (DE-588)4031824-2 s ULSI (DE-588)4226286-0 s Shor, Peter Verfasser aut |
| spellingShingle | Leighton, Frank T. Shor, Peter Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms Algorithms Algorithmus (DE-588)4001183-5 gnd Kombinatorik (DE-588)4031824-2 gnd ULSI (DE-588)4226286-0 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4031824-2 (DE-588)4226286-0 |
| title | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms |
| title_auth | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms |
| title_exact_search | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms |
| title_exact_search_txtP | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms |
| title_full | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms Tom Leighton ; Peter Shor |
| title_fullStr | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms Tom Leighton ; Peter Shor |
| title_full_unstemmed | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms Tom Leighton ; Peter Shor |
| title_short | Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms |
| title_sort | tight bounds for minimax grid matching with applications to the average case analysis of algorithms |
| topic | Algorithms Algorithmus (DE-588)4001183-5 gnd Kombinatorik (DE-588)4031824-2 gnd ULSI (DE-588)4226286-0 gnd |
| topic_facet | Algorithms Algorithmus Kombinatorik ULSI |
| work_keys_str_mv | AT leightonfrankt tightboundsforminimaxgridmatchingwithapplicationstotheaveragecaseanalysisofalgorithms AT shorpeter tightboundsforminimaxgridmatchingwithapplicationstotheaveragecaseanalysisofalgorithms |