Holdings: Algorithms and data structures

Algorithms and data structures: 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings

Saved in:

Bibliographic Details
Format:	Conference Proceeding Book
Language:	English
Published:	Berlin [u.a.] Springer 2011
Series:	Lecture notes in computer science 6844
Subjects:	Datenstruktur Algorithmus Konferenzschrift > 2011 > New York, NY
Online Access:	Inhaltstext Inhaltsverzeichnis
Item Description:	Literaturangaben
Physical Description:	XV, 718 S. graph. Darst. 24 cm
ISBN:	9783642222993 3642222994

Staff View

MARC


LEADER	00000nam a2200000 cb4500
001	BV039155453
003	DE-604
005	20130806
007	t\|
008	110725s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d
015			\|a 11,N23 \|2 dnb
016	7		\|a 1012463001 \|2 DE-101
020			\|a 9783642222993 \|c kart. : EUR 93.09 (DE) (freier Pr.), ca. sfr 125.00 (freier Pr.) \|9 978-3-642-22299-3
020			\|a 3642222994 \|9 3-642-22299-4
024	3		\|a 9783642222993
028	5	2	\|a Best.-Nr.: 80073615
035			\|a (OCoLC)844886756
035			\|a (DE-599)DNB1012463001
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 005.10151 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a DAT 455f \|2 stub
084			\|a 510 \|2 sdnb
084			\|a DAT 530f \|2 stub
245	1	0	\|a Algorithms and data structures \|b 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings \|c Frank Dehne ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2011
300			\|a XV, 718 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 6844
500			\|a Literaturangaben
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-5 \|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 2011 \|z New York, NY \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	1		\|5 DE-604
700	1		\|a Dehne, Frank \|d 1960- \|e Sonstige \|0 (DE-588)1037996887 \|4 oth
711	2		\|a WADS \|n 12 \|d 2011 \|c New York, NY \|j Sonstige \|0 (DE-588)16165480-0 \|4 oth
830		0	\|a Lecture notes in computer science \|v 6844 \|w (DE-604)BV000000607 \|9 6844
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3835672&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=024173117&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-024173117

Record in the Search Index

_version_	1820875336799223808
adam_text	IMAGE 1 TABLE OF CONTENTS PIECEWISE-LINEAR APPROXIMATIONS OF UNCERTAIN FUNCTIONS 1 MOHAMMAD AH ABAM, MARK DE BERG, AND AMIRALI KHOSRAVI A CONSTANT FACTOR APPROXIMATION ALGORITHM FOR BOXICITY OF CIRCULAR ARC GRAPHS 13 ABHIJIN ADIGA, JASINE BABU, AND L. SUNIL CHANDRAN ON THE AREA REQUIREMENTS OF EUCLIDEAN MINIMUM SPANNING TREES 25 PATRIZIO ANGELINI, TILL BRUCKDORFER, MARCO CHIESA, FABRIZIO FRATI, MICHAEL KAUFMANN, AND CLAUDIO SQUARCELLA MULTI-TARGET RAY SEARCHING PROBLEMS 37 SPYROS ANGELOPOULOS, ALEJANDRO LOPEZ-ORTIZ, AND KONSTANTINOS PANAGIOTOU CONVEX TRANSVERSALS 49 ESTHER M. ARKIN, CLAUDIA DIECKMANN, CHRISTIAN KNAUER, JOSEPH S.B. MITCHELL, VALENTIN POLISHCHUK, LENA SCHLIPF, AND SHANG YANG HOW TO COVER A POINT SET WITH A V-SHAPE OF MINIMUM WIDTH 61 BORIS ARONOV AND MURIEL DULIEU WITNESS RECTANGLE GRAPHS 73 BORIS ARONOV, MURIEL DULIEU, AND FERRAN HURTADO FASTER OPTIMAL ALGORITHMS FOR SEGMENT MINIMIZATION WITH SMALL MAXIMAL VALUE 86 THERESE BIEDL, STEPHANE DUROCHER, CELINE ENGELBEEN, SAMUEL FIORINI, AND MAXWELL YOUNG ORTHOGONAL CARTOGRAMS WITH FEW CORNERS PER FACE 98 THERESE BIEDL AND LESVIA ELENA RUIZ VELAZQUEZ SMOOTHED ANALYSIS OF PARTITIONING ALGORITHMS FOR EUCLIDEAN FUNCTIONAL 110 MARKUS BLAESER, BODO MANTHEY, AND B. V. RAGHAVENDRA RAO FEEDBACK VERTEX SET IN MIXED GRAPHS 122 PAUL BONSMA AND DANIEL LOKSHTANOV BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1012463001 DIGITALISIERT DURCH IMAGE 2 XII TABLE OF CONTENTS SWITCHING TO DIRECTIONAL ANTENNAS WITH CONSTANT INCREASE IN RADIUS AND HOP DISTANCE 134 PROSENJIT BOSE, PAZ CARMI, MIRELA DAMIAN, ROBIN FLATLAND, MATTHEW J. KATZ, AND ANIL MAHESHWARI FREQUENCY CAPPING IN ONLINE ADVERTISING (EXTENDED ABSTRACT) 147 NIV BUCHBINDER, MORAN FELDMAN, ARPITA GHOSH, AND JOSEPH (SEFFI) NAOR ADJACENCY-PRESERVING SPATIAL TREEMAPS 159 KEVIN BUCHIN, DAVID EPPSTEIN, MAARTEN LOEFFLER, MARTIN NOELLENBURG, AND RODRIGO I. SILVEIRA REGISTER LOADING VIA LINEAR PROGRAMMING 171 GRUIA CALINESCU AND MINMING LI CONNECTING A SET OF CIRCLES WITH MINIMUM SUM OF RADII 183 ERIN WOLF CHAMBERS, SDNDOR P. FEKETE, HELLA-FRANZISKA HOFFMANN, DIMITRI MARINAKIS, JOSEPH S.B. MITCHELL, VENKATESH SRINIVASAN, ULRIKE STEGE, AND SUE WHITESIDES STREAMING AND DYNAMIC ALGORITHMS FOR MINIMUM ENCLOSING BALLS IN HIGH DIMENSIONS 195 TIMOTHY M. CHAN AND VINAYAK PATHAK NEW ALGORITHMS FOR 1-D FACILITY LOCATION AND PATH EQUIPARTITION PROBLEMS 207 DANNY Z. CHEN AND HAITAO WANG MULTICUT IN TREES VIEWED THROUGH THE EYES OF VERTEX COVER 219 JIANER CHEN, JIA-HAO FAN, IYAD A. KANJ, YANG LIU, AND FENGHUI ZHANG BEYOND TRIANGULATION: COVERING POLYGONS WITH TRIANGLES 231 TOBIAS CHRIST LOSSLESS FAULT-TOLERANT DATA STRUCTURES WITH ADDITIVE OVERHEAD 243 PAUL CHRISTIANO, ERIK D. DEMAINE, AND SHAUNAK KISHORE BINARY IDENTIFICATION PROBLEMS FOR WEIGHTED TREES 255 FERDINANDO CICALESE, TOBIAS JACOBS, EDUARDO LABER, AND CAIO VALENTIM COMPUTING THE FRECHET DISTANCE BETWEEN FOLDED POLYGONS 267 ATLAS F. COOK IV, ANNE DRIEMEL, SARIEL HAR-PELED, JESSICA SHERETTE, AND CAROLA WENK PARAMETERIZED REDUCTIONS AND ALGORITHMS FOR ANOTHER VERTEX COVER GENERALIZATION 279 PETER DAMASCHKE AND LEONID MOLOKOV IMAGE 3 TABLE OF CONTENTS XIII PATH MINIMA QUERIES IN DYNAMIC WEIGHTED TREES 290 GERTH ST0LTING BRODAI, POOYA DAVOODI, AND S. SRINIVASA RAO ON RECTILINEAR PARTITIONS WITH MINIMUM STABBING NUMBER 302 MARK DE BERG, AMIRALI KHOSRAVI, SANDER VERDONSCHOT, AND VINCENT VAN DER WEELE FLATTENING FIXED-ANGLE CHAINS IS STRONGLY NP-HARD 314 ERIK D. DEMAINE AND SARAH EISENSTAT AN O(N LOG N) ALGORITHM FOR A LOAD BALANCING PROBLEM ON PATHS 326 NIKHIL R. DEVANUR AND URIEL FEIGE FULLY-DYNAMIC HIERARCHICAL GRAPH CLUSTERING USING CUT TREES 338 CHRISTOF DOLL, TANJA HARTMANN, AND DOROTHEA WAGNER FLOW COMPUTATIONS ON IMPRECISE TERRAINS 350 ANNE DRIEMEL, HERMAN HAVERKORT, MAARTEN LOEFFLER, AND RODRIGO I. SILVEIRA TRACKING MOVING OBJECTS WITH FEW HANDOVERS 362 DAVID EPPSTEIN, MICHAEL T. GOODRICH, AND MAARTEN LOEFFLER INDUCING THE LCP-ARRAY 374 JOHANNES FISCHER HOROBALL HULLS AND EXTENTS IN POSITIVE DEFINITE SPACE 386 P. THOMAS FLETCHER, JOHN MOELLER, JEFF M. PHILLIPS, AND SURESH VENKATASUBRAMANIAN ENUMERATING MINIMAL SUBSET FEEDBACK VERTEX SETS 399 FEDOR V. FOMIN, PINAR HEGGERNES, DIETER KRATSCH, CHARTS PAPADOPOULOS, AND YNGVE VILLANGER UPPER BOUNDS FOR MAXIMALLY GREEDY BINARY SEARCH TREES 411 KYLE FOX ON THE MATTER OF DYNAMIC OPTIMALITY IN AN EXTENDED MODEL FOR TREE ACCESS OPERATIONS 423 MICHAEL L. FREDMAN RESILIENT AND LOW STRETCH ROUTING THROUGH EMBEDDING INTO TREE METRICS 438 JIE GAO AND DENGPAN ZHOU CONSISTENT LABELING OF ROTATING MAPS 451 ANDREAS GEMSA, MARTIN NOELLENBURG, AND IGNAZ RUTTER FINDING LONGEST APPROXIMATE PERIODIC PATTERNS 463 BEAT GFELLER IMAGE 4 XIV TABLE OF CONTENTS A (5/3 + ^-APPROXIMATION FOR STRIP PACKING 475 ROLF HARREN, KLAUS JANSEN, LARS PRAEDEL, AND ROB VAN STEE REVERSING LONGEST PREVIOUS FACTOR TABLES IS HARD 488 JING HE, HONGYU LIANG, AND GUANG YANG SPACE EFFICIENT DATA STRUCTURES FOR DYNAMIC ORTHOGONAL RANGE COUNTING 500 MENG HE AND J. IAN MUNRO SEARCHING IN DYNAMIC TREE-LIKE PARTIAL ORDERS 512 BRENT HEERINGA, MARINS CAETAELIN IORDAN, AND LOUIS THERAN COUNTING PLANE GRAPHS: FLIPPABILITY AND ITS APPLICATIONS 524 MICHAEL HOFFMANN, MICHA SHARIR, ADAM SHEFFER, CSABA D. TOETH, AND EMO WELZL GEOMETRIC COMPUTATIONS ON INDECISIVE POINTS 536 ALLAN J0RGENSEN, MAARTEN LOEFFLER, AND JEFF M. PHILLIPS CLOSEST PAIR AND THE POST OFFICE PROBLEM FOR STOCHASTIC POINTS 548 PEGAH KAMOUSI, TIMOTHY M. CHAN, AND SUBHASH SURI COMPETITIVE SEARCH IN SYMMETRIC TREES 560 DAVID KIRKPATRICK AND SANDRA ZILLES MULTIPLE-SOURCE SINGLE-SINK MAXIMUM FLOW IN DIRECTED PLANAR GRAPHS IN O(DIAMETER * N LOG N) TIME 571 PHILIP N. KLEIN AND SHAY MOZES PLANAR SUBGRAPHS WITHOUT LOW-DEGREE NODES 583 EVANGELOS KRANAKIS, OSCAR MORALES PONCE, AND JUKKA SUOMELA CONSTRUCTING ORTHOGONAL DE BRUIJN SEQUENCES 595 YAW-LING LIN, CHARLES WARD, BHARAT JAIN, AND STEVEN SKIENA A FAST ALGORITHM FOR THREE-DIMENSIONAL LAYERS OF MAXIMA PROBLEM . . 607 YAKOV NEKRICH SUCCINCT 2D DICTIONARY MATCHING WITH NO SLOWDOWN 619 SHOSHANA NEUBURGER AND DINA SOKOL PTAS FOR DENSEST FC-SUBGRAPH IN INTERVAL GRAPHS 631 TIM NONNER IMPROVED DISTANCE QUERIES IN PLANAR GRAPHS 642 YAHAV NUSSBAUM PIERCING QUASI-RECTANGLES: ON A PROBLEM OF DANZER AND ROGERS 654 JANOS PACH AND GABOR TARDOS IMAGE 5 TABLE OF CONTENTS XV FASTER ALGORITHMS FOR MINIMUM-LINK PATHS WITH RESTRICTED ORIENTATIONS 655 VALENTIN POLISHCHUK AND MIKKO SYSIKASKI STREAMING ALGORITHMS FOR 2-COLORING UNIFORM HYPERGRAPHS 667 JAIKUMAR RADHAKRISHNAN AND SASWATA SHANNIGRAHI DENSITY-CONSTRAINED GRAPH CLUSTERING 679 ROBERT GOERKE, ANDREA SCHUMM, AND DOROTHEA WAGNER THE MST OF SYMMETRIC DISK GRAPHS (IN ARBITRARY METRIC SPACES) IS LIGHT 691 SHAY SOLOMON THEORY VS. PRACTICE IN THE DESIGN AND ANALYSIS OF ALGORITHMS 703 ROBERT E. TARJAN A FULLY POLYNOMIAL APPROXIMATION SCHEME FOR A KNAPSACK PROBLEM WITH A MINIMUM FILLING CONSTRAINT (EXTENDED ABSTRACT) 704 ZHOU XU AND XIAOFAN LAI AUTHOR INDEX 717
any_adam_object	1
author_GND	(DE-588)1037996887
building	Verbundindex
bvnumber	BV039155453
classification_rvk	SS 4800
classification_tum	DAT 455f DAT 530f
ctrlnum	(OCoLC)844886756 (DE-599)DNB1012463001
dewey-full	005.10151
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.10151
dewey-search	005.10151
dewey-sort	15.10151
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">BV039155453</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130806</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,N23</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1012463001</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642222993</subfield><subfield code="c">kart. : EUR 93.09 (DE) (freier Pr.), ca. sfr 125.00 (freier Pr.)</subfield><subfield code="9">978-3-642-22299-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642222994</subfield><subfield code="9">3-642-22299-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642222993</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80073615</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844886756</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1012463001</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">005.10151</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 455f</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">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and data structures</subfield><subfield code="b">12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings</subfield><subfield code="c">Frank Dehne ... (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">XV, 718 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">6844</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">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">2011</subfield><subfield code="z">New York, NY</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dehne, Frank</subfield><subfield code="d">1960-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1037996887</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WADS</subfield><subfield code="n">12</subfield><subfield code="d">2011</subfield><subfield code="c">New York, NY</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16165480-0</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">6844</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6844</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=3835672&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=024173117&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-024173117</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2011 New York, NY gnd-content
genre_facet	Konferenzschrift 2011 New York, NY
id	DE-604.BV039155453
illustrated	Illustrated
indexdate	2025-01-10T15:14:00Z
institution	BVB
institution_GND	(DE-588)16165480-0
isbn	9783642222993 3642222994
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-024173117
oclc_num	844886756
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	XV, 718 S. graph. Darst. 24 cm
publishDate	2011
publishDateSearch	2011
publishDateSort	2011
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings Frank Dehne ... (eds.) Berlin [u.a.] Springer 2011 XV, 718 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6844 Literaturangaben Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 New York, NY gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Datenstruktur (DE-588)4011146-5 s Dehne, Frank 1960- Sonstige (DE-588)1037996887 oth WADS 12 2011 New York, NY Sonstige (DE-588)16165480-0 oth Lecture notes in computer science 6844 (DE-604)BV000000607 6844 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3835672&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=024173117&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings Lecture notes in computer science Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4011146-5 (DE-588)4001183-5 (DE-588)1071861417
title	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings
title_auth	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings
title_exact_search	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings
title_full	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings Frank Dehne ... (eds.)
title_fullStr	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings Frank Dehne ... (eds.)
title_full_unstemmed	Algorithms and data structures 12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings Frank Dehne ... (eds.)
title_short	Algorithms and data structures
title_sort	algorithms and data structures 12th international symposium wads 2011 new york ny usa august 15 17 2011 proceedings
title_sub	12th international symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011 ; proceedings
topic	Datenstruktur (DE-588)4011146-5 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Datenstruktur Algorithmus Konferenzschrift 2011 New York, NY
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3835672&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=024173117&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT dehnefrank algorithmsanddatastructures12thinternationalsymposiumwads2011newyorknyusaaugust15172011proceedings AT wadsnewyorkny algorithmsanddatastructures12thinternationalsymposiumwads2011newyorknyusaaugust15172011proceedings

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Description

MARC

Record in the Search Index

There is no print copy available.

Similar Items