Computing and combinatorics: 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
Schriftenreihe: | Lecture notes in computer science
6842 |
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | XIII, 650 S. graph. Darst. |
ISBN: | 9783642226847 3642226841 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV039155318 | ||
003 | DE-604 | ||
005 | 20111115 | ||
007 | t| | ||
008 | 110725s2011 xx d||| |||| 10||| eng d | ||
015 | |a 11,N26 |2 dnb | ||
016 | 7 | |a 101299645X |2 DE-101 | |
020 | |a 9783642226847 |c Pb. : EUR 84.53 (DE) (freier Pr.), ca. sfr 113.50 (freier Pr.) |9 978-3-642-22684-7 | ||
020 | |a 3642226841 |c Pb. : EUR 84.53 (DE) (freier Pr.), ca. sfr 113.50 (freier Pr.) |9 3-642-22684-1 | ||
024 | 3 | |a 9783642226847 | |
028 | 5 | 2 | |a Best.-Nr.: 80074819 |
035 | |a (OCoLC)844906607 | ||
035 | |a (DE-599)DNB101299645X | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-83 |a DE-91G | ||
082 | 0 | |a 004.0151 |2 22/ger | |
084 | |a 004 |2 sdnb | ||
084 | |a DAT 537f |2 stub | ||
084 | |a 510 |2 sdnb | ||
084 | |a MAT 050f |2 stub | ||
084 | |a DAT 517f |2 stub | ||
245 | 1 | 0 | |a Computing and combinatorics |b 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings |c Bin Fu ... (eds. ) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
300 | |a XIII, 650 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 6842 | |
650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-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 Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2011 |z Dallas Tex. |2 gnd-content | |
689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
689 | 1 | 1 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 1 | |5 DE-604 | |
700 | 1 | |a Fu, Bin |e Sonstige |0 (DE-588)140422285 |4 oth | |
711 | 2 | |a COCOON |n 17 |d 2011 |c Dallas, Tex. |j Sonstige |0 (DE-588)16165565-8 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 6842 |w (DE-604)BV000000607 |9 6842 | |
856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3845103&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
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=024172985&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024172985 |
Datensatz im Suchindex
_version_ | 1820875336762523648 |
---|---|
adam_text |
IMAGE 1
TABLE OF CONTENTS
DERANDOMIZING HSSW ALGORITHM FOR 3-SAT 1
KAZUHISA MAKINO, SUGURU TAMAKI, AND MASAKI YAMAMOTO
DOMINATING SET COUNTING IN GRAPH CLASSES 13
SHUJI KIJIMA, YOSHIO OKAMOTO, AND TAKEAKI UNO
THE DENSITY MAXIMIZATION PROBLEM IN GRAPHS 25
MONG-JEN KAO, BASTIAN KATZ, MARCUS KRUG, D.T. LEE, IGNAZ RUTTER, AND
DOROTHEA WAGNER
FLIPCUT SUPERTREES: TOWARDS MATRIX REPRESENTATION ACCURACY IN POLYNOMIAL
TIME 37
MALTE BRINKMEYER, THASSO GRIEBEL, AND SEBASTIAN BOECKER
TIGHT BOUNDS ON LOCAL SEARCH TO APPROXIMATE THE MAXIMUM SATISFIABILITY
PROBLEMS 49
DARNING ZHU, SHAOHAN MA, AND PINGPING ZHANG
PARAMETERIZED COMPLEXITY IN MULTIPLE-INTERVAL GRAPHS: PARTITION,
SEPARATION, IRREDUNDANCY 62
MINGHUI JIANG AND YONG ZHANG
EXACT PARAMETERIZED MULTILINEAR MONOMIAL COUNTING VIA FC-LAYER SUBSET
CONVOLUTION AND /^-DISJOINT SUM 74
DONGXIAO YU, YUEXUAN WANG, QIANG-SHENG HUA, AND FRANCIS CM. LAU
ON THE RAINBOW CONNECTIVITY OF GRAPHS: COMPLEXITY AND F PT ALGORITHMS 86
KEI UCHIZAWA, TAKANORI AOKI, TAKEHIRO ITO, AKIRA SUZUKI, AND XIAO ZHOU
ON PARAMETERIZED INDEPENDENT FEEDBACK VERTEX SET 98
NEELDHARA MISRA, GEEVARGHESE PHILIP, VENKATESH RAMAN, AND SAKET SAURABH
COGRAPH EDITING: COMPLEXITY AND PARAMETERIZED ALGORITHMS 110 YUNLONG
LIU, JIANXIN WANG, JIONG GUO, AND JIANER CHEN
APPROXIMATION COMPLEXITY OF COMPLEX-WEIGHTED DEGREE-TWO COUNTING
CONSTRAINT SATISFACTION PROBLEMS (EXTENDED ABSTRACT) 122 TOMOYUKI
YAMAKAMI
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/101299645X
DIGITALISIERT DURCH
IMAGE 2
X TABLE OF CONTENTS
STRONG I/O LOWER BOUNDS FOR BINOMIAL AND FFT COMPUTATION GRAPHS 134
DESH RANJAN, JOHN SAVAGE, AND MOHAMMAD ZUBAIR
SPIN SYSTEMS ON GRAPHS WITH COMPLEX EDGE FUNCTIONS AND SPECIFIED DEGREE
REGULARITIES 146
JIN- YI CAI AND MICHAEL KOWALCZYK
QUANTUM ALGORITHM FOR THE BOOLEAN HIDDEN SHIFT PROBLEM 158
DMITRY GAVINSKY, MARTIN ROETTELER, AND JEREMIE ROLAND
A KOLMOGOROV COMPLEXITY PROOF OF THE LOVASZ LOCAL LEMMA FOR
SATISFIABILITY 168
JOCHEN MESSNER AND THOMAS THIERAUF
PROPER N-CELL POLYCUBES IN N - 3 DIMENSIONS 180
ANDREI ASINOWSKI, GILL BAREQUET, RONNIE BAREQUET, AND GUENTER ROTE
LARGEST AREA CONVEX HULL OF AXIS-ALIGNED SQUARES BASED ON IMPRECISE DATA
192
OVIDIU DAESCU, WENQI JU, JUN LUO, AND BINHAI ZHU
IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE
3-TREES 204
TANAEEM M. MOOSA AND M. SOHEL RAHMAN
OPTIMAL STRATEGIES FOR THE ONE-ROUND DISCRETE VORONOI GAME ON A LINE 213
ARITRA BANIK, BHASWAR B. BHATTACHARYA, AND SANDIP DAS
COMPUTING THE GIRTH OF A PLANAR GRAPH IN LINEAR TIME 225
HSIEN-CHIH CHANG AND HSUEH-I. LU
DIAGONALIZATION STRIKES BACK: SOME RECENT LOWER BOUNDS IN COMPLEXITY
THEORY 237
RYAN WILLIAMS
UNIONS OF DISJOINT NP-COMPLETE SETS 240
CHRISTIAN GLASSER, JOHN M. HITCHCOCK, A. PAVAN, AND STEPHEN TRAVERS
REACHFEWL = REACHUL 252
BRADY GARVIN, DERRICK STOLEE, RAGHUNATH TEWARI, AND N. V. VINODCHANDRAN
(1 + E)-COMPETITIVE ALGORITHM FOR ONLINE OVSF CODE ASSIGNMENT WITH
RESOURCE AUGMENTATION 259
YUICHI ASAHIRO, KENTA KANMERA, AND EIJI MIYANO
SCHEDULING JOBS ON HETEROGENEOUS PLATFORMS 271
MARIN BOUGERET, PIERRE FRANCOIS DUTOT, KLAUS JANSEN, CHRISTINA ROBENEK,
AND DENIS TRYSTRAM
IMAGE 3
TABLE OF CONTENTS XI
SELF-ASSEMBLING RULERS FOR APPROXIMATING GENERALIZED SIERPINSKI CARPETS
284
STEVEN M. KAUTZ AND BRAD SHUTTERS
APPROXIMATELY UNIFORM ONLINE CHECKPOINTING 297
LAURI AHLROTH, OLLI POTTONEN, AND ANDRE SCHUMACHER
BANDWIDTH OF CONVEX BIPARTITE GRAPHS AND RELATED GRAPHS 307
ANISH MAN SINGH SHRESTHA, SATOSHI TAYU, AND SHUICHI UENO
ALGORITHMS FOR PARTITION OF SOME CLASS OF GRAPHS UNDER COMPACTION . .
319 NARAYAN VIKAS
A GENERIC APPROACH TO DECOMPOSITION ALGORITHMS, WITH AN APPLICATION TO
DIGRAPH DECOMPOSITION 331
BINH-MINH BUI-XUAN, PINAR HEGGERNES, DANIEL MEISTER, AND ANDRZEJ
PROSKUROWSKI
MATCHING AND P2-PACKING: WEIGHTED VERSIONS 343
QILONG FENG, JIANXIN WANG, AND JIANER CHEN
ON TOTALLY UNIMODULARITY OF EDGE-EDGE ADJACENCY MATRICES 354 YUSUKE
MATSUMOTO, NAOYUKI KAMIYAMA, AND KEIKO IMAI
THE TOPOLOGY AWARE FILE DISTRIBUTION PROBLEM 366
SHAWN T. O'NEIL, AMITABH CHAUDHARY, DANNY Z. CHEN, AND HAITAO WANG
EXPLOITING THE ROBUSTNESS ON POWER-LAW NETWORKS 379
YILIN SHEN, NAM P. NGUYEN, AND MY T. THAI
COMPETITIVE ALGORITHMS FOR ONLINE PRICING 391
YONG ZHANG, FRANCIS Y.L. CHIN, AND HING-FUNG TING
MAKING ABSTRACTION-REFINEMENT EFFICIENT IN MODEL CHECKING 402 CONG TIAN
AND ZHENHUA DUAN
AN INTEGER PROGRAMMING APPROACH FOR THE RURAL POSTMAN PROBLEM WITH TIME
DEPENDENT TRAVEL TIMES 414
GUOZHEN TAN AND JINGHAO SUN
PROPERTY TESTING FOR CYCLIC GROUPS AND BEYOND 432
FRANCOIS LE GALL AND YUICHI YOSHIDA
CANONIZING HYPERGRAPHS UNDER ABELIAN GROUP ACTION 444
V. ARVIND AND JOHANNES KB'BLER
IMAGE 4
XII TABLE OF CONTENTS
LINEAR TIME ALGORITHMS FOR THE BASIS OF ABELIAN GROUPS 456
GREGORY KARAGIORGOS AND DIMITRIOS POULAKIS
CHARACTERIZATIONS OF LOCALLY TESTABLE LINEAR- AND AFFINE-INVARIANT
FAMILIES 467
ANGSHENG LI AND YICHENG PAN
A NEW CONDITIONALLY ANONYMOUS RING SIGNATURE 479
SHENGKE ZENG, SHAOQUAN JIANG, AND ZHIGUANG QIN
ON THE RIGHT-SEED ARRAY OF A STRING 492
MICHAIIS CHRISTOU, MAXIME CROCHEMORE, ONDREJ GUTH, COSTAS S. ILIOPOULOS,
AND SOLON P. PISSIS
COMPRESSED DIRECTED ACYCLIC WORD GRAPH WITH APPLICATION IN LOCAL
ALIGNMENT 503
DO HUY HOANG AND SUNG WING KIN
UNAVOIDABLE REGULARITIES IN LONG WORDS WITH BOUNDED NUMBER OF SYMBOL
OCCURRENCES 519
JUHA KORTELAINEN, TUOMAS KORTELAINEN, AND ARI VESANEN
SUMMING SYMBOLS IN MUTUAL RECURRENCES 531
BERKELEY R. CHURCHILL AND EDMUND A. LAMAGNA
FLIPPING TRIANGLES AND RECTANGLES 543
MINGHUI JIANG
UNCONSTRAINED AND CONSTRAINED FAULT-TOLERANT RESOURCE ALLOCATION . . .
555 KEWEN LIAO AND HONG SHEN
FINDING PATHS WITH MINIMUM SHARED EDGES 567
MASOUD T. OMRAN, JOERG-RUEDIGER SACK, AND HAMID ZARRABI-ZADEH
COMBINATORIAL GROUP TESTING FOR CORRUPTION LOCALIZING HASHING 579
ANNALISA DE BONIS AND GIOVANNI DI CRESCENZO
TASK ORDERING AND MEMORY MANAGEMENT PROBLEM FOR DEGREE OF PARALLELISM
ESTIMATION 592
SERGIU CARPOV, JACQUES CARLIER, DRITAN NACE, AND RENAUD SIRDEY
COMPUTING MAJORITY WITH TRIPLE QUERIES 604
GIANLUCA DE MARCO, EVANGELOS KRANAKIS, AND GABOR WIENER
A NEW VARIATION OF HAT GUESSING GAMES 616
TENGYU MA, XIAOMING SUN, AND HUACHENG YU
IMAGE 5
TABLE OF CONTENTS XIII
OBLIVIOUS TRANSFER AND N-VARIATE LINEAR FUNCTION EVALUATION 627 YEOW
MENG CHEE, HUAXIONG WANG, AND LIANG FENG ZHANG
OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE
AUGMENTATION 638
YIWEI JIANG, AN ZHANG, AND JUELIANG HU
AUTHOR INDEX 649 |
any_adam_object | 1 |
author_GND | (DE-588)140422285 |
building | Verbundindex |
bvnumber | BV039155318 |
classification_rvk | SS 4800 |
classification_tum | DAT 537f MAT 050f DAT 517f |
ctrlnum | (OCoLC)844906607 (DE-599)DNB101299645X |
dewey-full | 004.0151 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.0151 |
dewey-search | 004.0151 |
dewey-sort | 14.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">BV039155318</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111115</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">110725s2011 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N26</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">101299645X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642226847</subfield><subfield code="c">Pb. : EUR 84.53 (DE) (freier Pr.), ca. sfr 113.50 (freier Pr.)</subfield><subfield code="9">978-3-642-22684-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642226841</subfield><subfield code="c">Pb. : EUR 84.53 (DE) (freier Pr.), ca. sfr 113.50 (freier Pr.)</subfield><subfield code="9">3-642-22684-1</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642226847</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80074819</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844906607</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB101299645X</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-83</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.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">DAT 537f</subfield><subfield code="2">stub</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">MAT 050f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing and combinatorics</subfield><subfield code="b">17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings</subfield><subfield code="c">Bin Fu ... (eds. )</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 650 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">6842</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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">2011</subfield><subfield code="z">Dallas Tex.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-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="1"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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">Fu, Bin</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)140422285</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">COCOON</subfield><subfield code="n">17</subfield><subfield code="d">2011</subfield><subfield code="c">Dallas, Tex.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16165565-8</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">6842</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6842</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3845103&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=024172985&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-024172985</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2011 Dallas Tex. gnd-content |
genre_facet | Konferenzschrift 2011 Dallas Tex. |
id | DE-604.BV039155318 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:14:00Z |
institution | BVB |
institution_GND | (DE-588)16165565-8 |
isbn | 9783642226847 3642226841 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024172985 |
oclc_num | 844906607 |
open_access_boolean | |
owner | DE-706 DE-83 DE-91G DE-BY-TUM |
owner_facet | DE-706 DE-83 DE-91G DE-BY-TUM |
physical | XIII, 650 S. graph. Darst. |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings Bin Fu ... (eds. ) Berlin [u.a.] Springer 2011 XIII, 650 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6842 Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 Dallas Tex. gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Kombinatorik (DE-588)4031824-2 s Berechenbarkeit (DE-588)4138368-0 s Fu, Bin Sonstige (DE-588)140422285 oth COCOON 17 2011 Dallas, Tex. Sonstige (DE-588)16165565-8 oth Lecture notes in computer science 6842 (DE-604)BV000000607 6842 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3845103&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024172985&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings Lecture notes in computer science Theoretische Informatik (DE-588)4196735-5 gnd Kombinatorik (DE-588)4031824-2 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
subject_GND | (DE-588)4196735-5 (DE-588)4031824-2 (DE-588)4138368-0 (DE-588)1071861417 |
title | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings |
title_auth | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings |
title_exact_search | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings |
title_full | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings Bin Fu ... (eds. ) |
title_fullStr | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings Bin Fu ... (eds. ) |
title_full_unstemmed | Computing and combinatorics 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings Bin Fu ... (eds. ) |
title_short | Computing and combinatorics |
title_sort | computing and combinatorics 17th annual international conference cocoon 2011 dallas tx usa august 14 16 2011 proceedings |
title_sub | 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14 - 16, 2011 ; proceedings |
topic | Theoretische Informatik (DE-588)4196735-5 gnd Kombinatorik (DE-588)4031824-2 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
topic_facet | Theoretische Informatik Kombinatorik Berechenbarkeit Konferenzschrift 2011 Dallas Tex. |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=3845103&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024172985&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT fubin computingandcombinatorics17thannualinternationalconferencecocoon2011dallastxusaaugust14162011proceedings AT cocoondallastex computingandcombinatorics17thannualinternationalconferencecocoon2011dallastxusaaugust14162011proceedings |