Communication complexity (for algorithm designers):
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Delft
now
c2016
|
| Schriftenreihe: | Foundations and trends in theoretical computer science
11,3-4 |
| Beschreibung: | XI, 193 Seiten Diagramme |
| ISBN: | 9781680831146 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV043577589 | ||
| 003 | DE-604 | ||
| 005 | 20170322 | ||
| 007 | t | ||
| 008 | 160531s2016 |||| |||| 00||| eng d | ||
| 020 | |a 9781680831146 |9 978-1-68083-114-6 | ||
| 035 | |a (OCoLC)964064068 | ||
| 035 | |a (DE-599)BVBBV043577589 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-188 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 68Q15 |2 msc | ||
| 100 | 1 | |a Roughgarden, Tim |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Communication complexity (for algorithm designers) |c Tim Roughgarden,Stanford University, USA |
| 264 | 1 | |a Boston ; Delft |b now | |
| 264 | 1 | |c c2016 | |
| 300 | |a XI, 193 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations and trends in theoretical computer science |v 11,3-4 | |
| 830 | 0 | |a Foundations and trends in theoretical computer science |v 11,3-4 |w (DE-604)BV041155925 |9 11,3-4 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028992295 | ||
Datensatz im Suchindex
| _version_ | 1804176257117585408 |
|---|---|
| any_adam_object | |
| author | Roughgarden, Tim |
| author_facet | Roughgarden, Tim |
| author_role | aut |
| author_sort | Roughgarden, Tim |
| author_variant | t r tr |
| building | Verbundindex |
| bvnumber | BV043577589 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)964064068 (DE-599)BVBBV043577589 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01030nam a2200313 cb4500</leader><controlfield tag="001">BV043577589</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170322 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">160531s2016 |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781680831146</subfield><subfield code="9">978-1-68083-114-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)964064068</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043577589</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q15</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Roughgarden, Tim</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Communication complexity (for algorithm designers)</subfield><subfield code="c">Tim Roughgarden,Stanford University, USA</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Delft</subfield><subfield code="b">now</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">c2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 193 Seiten</subfield><subfield code="b">Diagramme</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">Foundations and trends in theoretical computer science</subfield><subfield code="v">11,3-4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations and trends in theoretical computer science</subfield><subfield code="v">11,3-4</subfield><subfield code="w">(DE-604)BV041155925</subfield><subfield code="9">11,3-4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028992295</subfield></datafield></record></collection> |
| id | DE-604.BV043577589 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:29:18Z |
| institution | BVB |
| isbn | 9781680831146 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028992295 |
| oclc_num | 964064068 |
| open_access_boolean | |
| owner | DE-83 DE-188 |
| owner_facet | DE-83 DE-188 |
| physical | XI, 193 Seiten Diagramme |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | now |
| record_format | marc |
| series | Foundations and trends in theoretical computer science |
| series2 | Foundations and trends in theoretical computer science |
| spelling | Roughgarden, Tim Verfasser aut Communication complexity (for algorithm designers) Tim Roughgarden,Stanford University, USA Boston ; Delft now c2016 XI, 193 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Foundations and trends in theoretical computer science 11,3-4 Foundations and trends in theoretical computer science 11,3-4 (DE-604)BV041155925 11,3-4 |
| spellingShingle | Roughgarden, Tim Communication complexity (for algorithm designers) Foundations and trends in theoretical computer science |
| title | Communication complexity (for algorithm designers) |
| title_auth | Communication complexity (for algorithm designers) |
| title_exact_search | Communication complexity (for algorithm designers) |
| title_full | Communication complexity (for algorithm designers) Tim Roughgarden,Stanford University, USA |
| title_fullStr | Communication complexity (for algorithm designers) Tim Roughgarden,Stanford University, USA |
| title_full_unstemmed | Communication complexity (for algorithm designers) Tim Roughgarden,Stanford University, USA |
| title_short | Communication complexity (for algorithm designers) |
| title_sort | communication complexity for algorithm designers |
| volume_link | (DE-604)BV041155925 |
| work_keys_str_mv | AT roughgardentim communicationcomplexityforalgorithmdesigners |