Experimental algorithms: 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2009
|
| Schriftenreihe: | Lecture notes in computer science
5526 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | X, 292 S. graph. Darst. 24 cm |
| ISBN: | 9783642020100 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035549063 | ||
| 003 | DE-604 | ||
| 005 | 20090825 | ||
| 007 | t| | ||
| 008 | 090604s2009 xx d||| |||| 10||| eng d | ||
| 015 | |a 09,N21,0047 |2 dnb | ||
| 016 | 7 | |a 994022123 |2 DE-101 | |
| 020 | |a 9783642020100 |c kart. : EUR 52.38 (freier Pr.), sfr 76.00 (freier Pr.) |9 978-3-642-02010-0 | ||
| 024 | 3 | |a 9783642020100 | |
| 028 | 5 | 2 | |a 12682904 |
| 035 | |a (OCoLC)369143446 | ||
| 035 | |a (DE-599)DNB994022123 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-91G |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.0151 |2 22/ger | |
| 082 | 0 | |a 005.0151 |2 22//ger | |
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Experimental algorithms |b 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings |c Jan Vahrenhold (ed.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2009 | |
| 300 | |a X, 292 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 5526 | |
| 500 | |a Literaturangaben | ||
| 650 | 4 | |a Algorithmentheorie - Kongress - Dortmund <2009> | |
| 650 | 4 | |a Algorithmus - Berechnungskomplexität - Graph - Kongress - Dortmund <2009> | |
| 650 | 4 | |a Algorithmus - Kongress - Dortmund <2009> | |
| 650 | 4 | |a Datenstruktur - Algorithmus - Kongress - Dortmund <2009> | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 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 Berechnungskomplexität |0 (DE-588)4134751-1 |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 2009 |z Dortmund |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 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 3 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 3 | 2 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Vahrenhold, Jan |d 1973- |e Sonstige |0 (DE-588)12178214X |4 oth | |
| 711 | 2 | |a SEA |n 8 |d 2009 |c Dortmund |j Sonstige |0 (DE-588)16010457-9 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 5526 |w (DE-604)BV000000607 |9 5526 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017605000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017605000 | |
Datensatz im Suchindex
| _version_ | 1820875122040373248 |
|---|---|
| adam_text |
TABLE OF CONTENTS PARALLELISM IN CURRENT AND FUTURE PROCESSORS -
CHALLENGES AND SUPPORT FOR DESIGNING OPTIMAL ALGORITHMS (INVITED TALK) 1
HEINZ BAST FROM STREAMING B-TREES TO TOKUTEK: HOW A THEORETICIAN LEARNED
TO BE VP OF ENGINEERING (INVITED TALK) 2 MICHAEL A. BENDER EXPERIMENTAL
COMPARISONS OF DERIVATIVE FREE OPTIMIZATION ALGORITHMS (INVITED TALK) 3
A. AUGER, N. HANSEN, J.M. PEREZ ZERPA, R. ROS, AND M. SCHOENAUER ON
COMPUTATIONAL MODELS FOR FLASH MEMORY DEVICES 16 DEEPAK AJWANI, ANDREAS
BECKMANN, RIKO JACOB, ULRICH MEYER, AND GABRIEL MORUZ COMPETITIVE BUFFER
MANAGEMENT WITH STOCHASTIC PACKET ARRIVALS 28 KAMAL AL-BAWANI AND
ALEXANDER SOUZA FAST AND ACCURATE BOUNDS ON LINEAR PROGRAMS 40 ERNST
ALTHAUS AND DANIEL DUMITRIU BATCH DYNAMIC SINGLE-SOURCE SHORTEST-PATH
ALGORITHMS: AN EXPERIMENTAL STUDY 51 REINHARD BAUER AND DOROTHEA WAGNER
ROTATED-BOX TREES: A LIGHTWEIGHT C-ORIENTED BOUNDING-VOLUME HIERARCHY 63
MARK DE BERG AND PETER HACHENBERGER PSORT, YET ANOTHER FAST STABLE
SORTING SOFTWARE 76 PAOLO BERTASI, MARCO BRESSAN, AND ENOCH PESERICO A
HEURISTIC FOR FAIR CORRELATION-AWARE RESOURCE PLACEMENT 89 RAOUF
BOUTABA, MARTIN KARSTEN, AND MAXWELL YOUNG MEASURING THE SIMILARITY OF
GEOMETRIE GRAPHS 101 OTFRIED BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/994022123 DIGITALISIERT DURCH X TABLE OF CONTENTS AN
APPLICATION OF SELF-ORGANIZING DATA STRUCTURES TO COMPRESSION 137 REZA
DORRIGIV, ALEJANDRO LOEPEZ-ORTIZ, AND J. IAN MUNRO SCHEDULING ADDITIONAL
TRAINS ON DENSE CORRIDORS 149 HOLGER FLIER, THOMAS GRAFFAGNINO, AND MARC
NUNKESSER BROADWORD COMPUTING AND FIBONACCI CODE SPEED UP COMPRESSED
SUFFIX ARRAYS 161 SIMON GOG SPEED-UP TECHNIQUES FOR THE SELFISH STEP
ALGORITHM IN NETWORK CONGESTION GAMES 173 MATTHIAS KIRSCHNER, PHILIPP
SCHENGBIER, AND TOBIAS TSCHEUSCHNER EXPERIMENTAL STUDY OF NON-OBLIVIOUS
GREEDY AND RANDOMIZED ROUNDING ALGORITHMS FOR HYPERGRAPH FE-MATCHING
(EXTENDED ABSTRACT) 185 LASSE KLIEMANN AND ANAND SRIVASTAV EMPIRICAL
EVALUATION OF GRAPH PARTITIONING USING SPECTRAL EMBEDDINGS AND FLOW 197
KEVIN J. LANG, MICHAEL W. MAHONEY, AND LORENZO ORECCHIA UNIVARIATE
ALGEBRAIC KERNEL AND APPLICATION TO ARRANGEMENTS 209 SYLVAIN LAZARD,
LUIS PENARANDA, AND ELIAS TSIGARIDAS FAST ALGORITHM FOR GRAPH
ISOMORPHISM TESTING 221 JOSE LUIS LOEPEZ-PRESA AND ANTONIO FERNAENDEZ ANTA
ALGORITHMS AND EXPERIMENTS FOR CLIQUE RELAXATIONS*FINDING MAXIMUM
S-PLEXES 233 HANNES MOSER, ROLF NIEDERMEIER, AND MANUEL SORGE A
DESIGN-FOR-YIELD ALGORITHM TO ASSESS AND IMPROVE THE STRUCTURAL AND
ENERGETIC ROBUSTNESS OF PROTEINS AND DRUGS 245 GIUSEPPE |
| any_adam_object | 1 |
| author_GND | (DE-588)12178214X |
| building | Verbundindex |
| bvnumber | BV035549063 |
| 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)369143446 (DE-599)DNB994022123 |
| dewey-full | 005.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.0151 |
| dewey-search | 005.0151 |
| dewey-sort | 15.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV035549063</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090825</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">090604s2009 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,N21,0047</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">994022123</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642020100</subfield><subfield code="c">kart. : EUR 52.38 (freier Pr.), sfr 76.00 (freier Pr.)</subfield><subfield code="9">978-3-642-02010-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642020100</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12682904</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)369143446</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB994022123</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="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</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.0151</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.0151</subfield><subfield code="2">22//ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</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">Experimental algorithms</subfield><subfield code="b">8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings</subfield><subfield code="c">Jan Vahrenhold (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 292 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">5526</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmentheorie - Kongress - Dortmund <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmus - Berechnungskomplexität - Graph - Kongress - Dortmund <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmus - Kongress - Dortmund <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenstruktur - Algorithmus - Kongress - Dortmund <2009></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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">2009</subfield><subfield code="z">Dortmund</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="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vahrenhold, Jan</subfield><subfield code="d">1973-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)12178214X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">SEA</subfield><subfield code="n">8</subfield><subfield code="d">2009</subfield><subfield code="c">Dortmund</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16010457-9</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">5526</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5526</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017605000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017605000</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2009 Dortmund gnd-content |
| genre_facet | Konferenzschrift 2009 Dortmund |
| id | DE-604.BV035549063 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:10:37Z |
| institution | BVB |
| institution_GND | (DE-588)16010457-9 |
| isbn | 9783642020100 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017605000 |
| oclc_num | 369143446 |
| open_access_boolean | |
| owner | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
| owner_facet | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
| physical | X, 292 S. graph. Darst. 24 cm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings Jan Vahrenhold (ed.) Berlin [u.a.] Springer 2009 X, 292 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5526 Literaturangaben Algorithmentheorie - Kongress - Dortmund <2009> Algorithmus - Berechnungskomplexität - Graph - Kongress - Dortmund <2009> Algorithmus - Kongress - Dortmund <2009> Datenstruktur - Algorithmus - Kongress - Dortmund <2009> Computer algorithms Congresses Graph (DE-588)4021842-9 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2009 Dortmund gnd-content Algorithmentheorie (DE-588)4200409-3 s DE-604 Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s Berechnungskomplexität (DE-588)4134751-1 s Graph (DE-588)4021842-9 s Vahrenhold, Jan 1973- Sonstige (DE-588)12178214X oth SEA 8 2009 Dortmund Sonstige (DE-588)16010457-9 oth Lecture notes in computer science 5526 (DE-604)BV000000607 5526 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017605000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings Lecture notes in computer science Algorithmentheorie - Kongress - Dortmund <2009> Algorithmus - Berechnungskomplexität - Graph - Kongress - Dortmund <2009> Algorithmus - Kongress - Dortmund <2009> Datenstruktur - Algorithmus - Kongress - Dortmund <2009> Computer algorithms Congresses Graph (DE-588)4021842-9 gnd Datenstruktur (DE-588)4011146-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4011146-5 (DE-588)4200409-3 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings |
| title_auth | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings |
| title_exact_search | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings |
| title_full | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings Jan Vahrenhold (ed.) |
| title_fullStr | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings Jan Vahrenhold (ed.) |
| title_full_unstemmed | Experimental algorithms 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings Jan Vahrenhold (ed.) |
| title_short | Experimental algorithms |
| title_sort | experimental algorithms 8th international symposium sea 2009 dortmund germany june 4 6 2009 proceedings |
| title_sub | 8th international symposium, SEA 2009, Dortmund, Germany, June 4 - 6, 2009 ; proceedings |
| topic | Algorithmentheorie - Kongress - Dortmund <2009> Algorithmus - Berechnungskomplexität - Graph - Kongress - Dortmund <2009> Algorithmus - Kongress - Dortmund <2009> Datenstruktur - Algorithmus - Kongress - Dortmund <2009> Computer algorithms Congresses Graph (DE-588)4021842-9 gnd Datenstruktur (DE-588)4011146-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmentheorie - Kongress - Dortmund <2009> Algorithmus - Berechnungskomplexität - Graph - Kongress - Dortmund <2009> Algorithmus - Kongress - Dortmund <2009> Datenstruktur - Algorithmus - Kongress - Dortmund <2009> Computer algorithms Congresses Graph Datenstruktur Algorithmentheorie Berechnungskomplexität Algorithmus Konferenzschrift 2009 Dortmund |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017605000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT vahrenholdjan experimentalalgorithms8thinternationalsymposiumsea2009dortmundgermanyjune462009proceedings AT seadortmund experimentalalgorithms8thinternationalsymposiumsea2009dortmundgermanyjune462009proceedings |