Randomization and approximation techniques in computer science: 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2002
|
| Schriftenreihe: | Lecture notes in computer science
2483 |
| Schlagworte: | |
| Online-Zugang: | DE-91 DE-384 DE-19 DE-739 Volltext |
| Beschreibung: | Literaturangaben |
| Beschreibung: | 1 Online-Ressource (VIII, 275 S. graph. Darst.) |
| ISBN: | 3540441476 3540457267 |
| DOI: | 10.1007/3-540-45726-7 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV035161739 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 081114s2002 gw d||| o|||| 10||| eng d | ||
| 020 | |a 3540441476 |9 3-540-44147-6 | ||
| 020 | |a 3540457267 |c Online |9 3-540-45726-7 | ||
| 024 | 7 | |a 10.1007/3-540-45726-7 |2 doi | |
| 035 | |a (OCoLC)699830920 | ||
| 035 | |a (DE-599)BVBBV035161739 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-19 |a DE-91 |a DE-739 |a DE-384 | ||
| 084 | |a DAT 542f |2 stub | ||
| 245 | 1 | 0 | |a Randomization and approximation techniques in computer science |b 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings |c José D. P. Rolim ; Salil Vadhan (ed.) |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2002 | |
| 300 | |a 1 Online-Ressource (VIII, 275 S. |b graph. Darst.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 2483 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Randomisierung |0 (DE-588)4280827-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2002 |z Cambridge Mass. |2 gnd-content | |
| 689 | 0 | 0 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 0 | 1 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
| 689 | 0 | 2 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | 2 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Rolim, José |e Sonstige |4 oth | |
| 711 | 2 | |a RANDOM |n 6 |d 2002 |c Cambridge, Mass. |j Sonstige |0 (DE-588)16030258-4 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 2483 |w (DE-604)BV014880109 |9 2483 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/3-540-45726-7 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016968837 | |
| 966 | e | |u https://doi.org/10.1007/3-540-45726-7 |l DE-91 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-45726-7 |l DE-384 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-45726-7 |l DE-19 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-45726-7 |l DE-739 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820875101737844736 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| building | Verbundindex |
| bvnumber | BV035161739 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 542f |
| collection | ZDB-2-LNC |
| ctrlnum | (OCoLC)699830920 (DE-599)BVBBV035161739 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/3-540-45726-7 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV035161739</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">081114s2002 gw d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540441476</subfield><subfield code="9">3-540-44147-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540457267</subfield><subfield code="c">Online</subfield><subfield code="9">3-540-45726-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-45726-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699830920</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035161739</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Randomization and approximation techniques in computer science</subfield><subfield code="b">6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings</subfield><subfield code="c">José D. P. Rolim ; Salil Vadhan (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 275 S.</subfield><subfield code="b">graph. Darst.)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2483</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2002</subfield><subfield code="z">Cambridge Mass.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rolim, José</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">RANDOM</subfield><subfield code="n">6</subfield><subfield code="d">2002</subfield><subfield code="c">Cambridge, Mass.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16030258-4</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2483</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">2483</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-45726-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016968837</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-45726-7</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-45726-7</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-45726-7</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-45726-7</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2002 Cambridge Mass. gnd-content |
| genre_facet | Konferenzschrift 2002 Cambridge Mass. |
| id | DE-604.BV035161739 |
| illustrated | Illustrated |
| index_date | 2024-07-02T22:50:56Z |
| indexdate | 2025-01-10T15:10:17Z |
| institution | BVB |
| institution_GND | (DE-588)16030258-4 |
| isbn | 3540441476 3540457267 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016968837 |
| oclc_num | 699830920 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 |
| owner_facet | DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 |
| physical | 1 Online-Ressource (VIII, 275 S. graph. Darst.) |
| psigel | ZDB-2-LNC |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings José D. P. Rolim ; Salil Vadhan (ed.) Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2002 1 Online-Ressource (VIII, 275 S. graph. Darst.) txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 2483 Literaturangaben Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Randomisierung (DE-588)4280827-3 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2002 Cambridge Mass. gnd-content Berechnungstheorie (DE-588)4005581-4 s Randomisierung (DE-588)4280827-3 s Approximation (DE-588)4002498-2 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Approximationsalgorithmus (DE-588)4500954-5 s Rolim, José Sonstige oth RANDOM 6 2002 Cambridge, Mass. Sonstige (DE-588)16030258-4 oth Lecture notes in computer science 2483 (DE-604)BV014880109 2483 https://doi.org/10.1007/3-540-45726-7 Verlag Volltext |
| spellingShingle | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings Lecture notes in computer science Approximationsalgorithmus (DE-588)4500954-5 gnd Approximation (DE-588)4002498-2 gnd Berechnungstheorie (DE-588)4005581-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Randomisierung (DE-588)4280827-3 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4002498-2 (DE-588)4005581-4 (DE-588)4120591-1 (DE-588)4280827-3 (DE-588)1071861417 |
| title | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings |
| title_auth | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings |
| title_exact_search | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings |
| title_exact_search_txtP | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings |
| title_full | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings José D. P. Rolim ; Salil Vadhan (ed.) |
| title_fullStr | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings José D. P. Rolim ; Salil Vadhan (ed.) |
| title_full_unstemmed | Randomization and approximation techniques in computer science 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings José D. P. Rolim ; Salil Vadhan (ed.) |
| title_short | Randomization and approximation techniques in computer science |
| title_sort | randomization and approximation techniques in computer science 6th international workshop random 2002 cambridge ma usa september 13 15 2002 proceedings |
| title_sub | 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13 - 15, 2002 ; proceedings |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Approximation (DE-588)4002498-2 gnd Berechnungstheorie (DE-588)4005581-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Randomisierung (DE-588)4280827-3 gnd |
| topic_facet | Approximationsalgorithmus Approximation Berechnungstheorie Komplexitätstheorie Randomisierung Konferenzschrift 2002 Cambridge Mass. |
| url | https://doi.org/10.1007/3-540-45726-7 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT rolimjose randomizationandapproximationtechniquesincomputerscience6thinternationalworkshoprandom2002cambridgemausaseptember13152002proceedings AT randomcambridgemass randomizationandapproximationtechniquesincomputerscience6thinternationalworkshoprandom2002cambridgemausaseptember13152002proceedings |