Algorithm engineering and experiments: 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2002
|
| Schriftenreihe: | Lecture notes in computer science
2409 |
| Schlagworte: | |
| Beschreibung: | Literaturangaben |
| Beschreibung: | VIII, 205 S. graph. Darst. |
| ISBN: | 3540439773 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV014555404 | ||
| 003 | DE-604 | ||
| 005 | 20020821 | ||
| 007 | t| | ||
| 008 | 020709s2002 gw d||| |||| 10||| eng d | ||
| 016 | 7 | |a 964698811 |2 DE-101 | |
| 020 | |a 3540439773 |9 3-540-43977-3 | ||
| 035 | |a (OCoLC)50124463 | ||
| 035 | |a (DE-599)BVBBV014555404 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-703 |a DE-83 |a DE-706 |a DE-188 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 |2 21 | |
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithm engineering and experiments |b 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers |c David M. Mount ; Clifford Stein (ed.) |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2002 | |
| 300 | |a VIII, 205 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 2409 | |
| 500 | |a Literaturangaben | ||
| 650 | 4 | |a Algorithmes - Congrès | |
| 650 | 7 | |a Algorithmes - Congrès |2 ram | |
| 650 | 7 | |a algorithme graphe |2 inriac | |
| 650 | 7 | |a algorithme géométrique |2 inriac | |
| 650 | 7 | |a algorithme réseau |2 inriac | |
| 650 | 7 | |a cluster |2 inriac | |
| 650 | 7 | |a ordonnancement |2 inriac | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2002 |z San Francisco Calif. |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Mount, David M. |e Sonstige |4 oth | |
| 711 | 2 | |a ALENEX |n 4 |d 2002 |c San Francisco, Calif. |j Sonstige |0 (DE-588)10040287-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 2409 |w (DE-604)BV000000607 |9 2409 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009897972 | |
Datensatz im Suchindex
| _version_ | 1820874913000456192 |
|---|---|
| adam_text | |
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV014555404 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)50124463 (DE-599)BVBBV014555404 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV014555404</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020821</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">020709s2002 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">964698811</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540439773</subfield><subfield code="9">3-540-43977-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)50124463</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014555404</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm engineering and experiments</subfield><subfield code="b">4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers</subfield><subfield code="c">David M. Mount ; Clifford Stein (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">VIII, 205 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">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">Lecture notes in computer science</subfield><subfield code="v">2409</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme géométrique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">cluster</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">ordonnancement</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2002</subfield><subfield code="z">San Francisco Calif.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</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">Mount, David M.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ALENEX</subfield><subfield code="n">4</subfield><subfield code="d">2002</subfield><subfield code="c">San Francisco, Calif.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10040287-2</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">2409</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">2409</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009897972</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2002 San Francisco Calif. gnd-content |
| genre_facet | Konferenzschrift 2002 San Francisco Calif. |
| id | DE-604.BV014555404 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:07:17Z |
| institution | BVB |
| institution_GND | (DE-588)10040287-2 |
| isbn | 3540439773 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009897972 |
| oclc_num | 50124463 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-703 DE-83 DE-706 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-703 DE-83 DE-706 DE-188 |
| physical | VIII, 205 S. graph. Darst. |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers David M. Mount ; Clifford Stein (ed.) Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2002 VIII, 205 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 2409 Literaturangaben Algorithmes - Congrès Algorithmes - Congrès ram algorithme graphe inriac algorithme géométrique inriac algorithme réseau inriac cluster inriac ordonnancement inriac Computer algorithms Congresses Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2002 San Francisco Calif. gnd-content Algorithmentheorie (DE-588)4200409-3 s DE-604 Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s Mount, David M. Sonstige oth ALENEX 4 2002 San Francisco, Calif. Sonstige (DE-588)10040287-2 oth Lecture notes in computer science 2409 (DE-604)BV000000607 2409 |
| spellingShingle | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers Lecture notes in computer science Algorithmes - Congrès Algorithmes - Congrès ram algorithme graphe inriac algorithme géométrique inriac algorithme réseau inriac cluster inriac ordonnancement inriac Computer algorithms Congresses Datenstruktur (DE-588)4011146-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4200409-3 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers |
| title_auth | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers |
| title_exact_search | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers |
| title_full | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers David M. Mount ; Clifford Stein (ed.) |
| title_fullStr | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers David M. Mount ; Clifford Stein (ed.) |
| title_full_unstemmed | Algorithm engineering and experiments 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers David M. Mount ; Clifford Stein (ed.) |
| title_short | Algorithm engineering and experiments |
| title_sort | algorithm engineering and experiments 4th international workshop alenex 2002 san francisco ca usa january 4 5 2002 revised papers |
| title_sub | 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4 - 5, 2002 ; revised papers |
| topic | Algorithmes - Congrès Algorithmes - Congrès ram algorithme graphe inriac algorithme géométrique inriac algorithme réseau inriac cluster inriac ordonnancement inriac Computer algorithms Congresses Datenstruktur (DE-588)4011146-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes - Congrès algorithme graphe algorithme géométrique algorithme réseau cluster ordonnancement Computer algorithms Congresses Datenstruktur Algorithmentheorie Algorithmus Konferenzschrift 2002 San Francisco Calif. |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT mountdavidm algorithmengineeringandexperiments4thinternationalworkshopalenex2002sanfranciscocausajanuary452002revisedpapers AT alenexsanfranciscocalif algorithmengineeringandexperiments4thinternationalworkshopalenex2002sanfranciscocausajanuary452002revisedpapers |