Algorithms and computation: 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2001
|
Schriftenreihe: | Lecture notes in computer science
2223 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIV, 780 S. graph. Darst. |
ISBN: | 3540429859 |
Internformat
MARC
LEADER | 00000nam a22000008cb4500 | ||
---|---|---|---|
001 | BV014038390 | ||
003 | DE-604 | ||
005 | 20020104 | ||
007 | t | ||
008 | 011127s2001 gw d||| |||| 10||| eng d | ||
016 | 7 | |a 963118196 |2 DE-101 | |
020 | |a 3540429859 |9 3-540-42985-9 | ||
035 | |a (OCoLC)48621378 | ||
035 | |a (DE-599)BVBBV014038390 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-739 |a DE-91G |a DE-384 |a DE-703 |a DE-29T |a DE-824 |a DE-83 |a DE-188 |a DE-706 | ||
050 | 0 | |a QA76.9.A43 | |
082 | 0 | |a 004.015118 |2 21 | |
084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
084 | |a DAT 530f |2 stub | ||
245 | 1 | 0 | |a Algorithms and computation |b 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings |c Peter Eades ; Tadao Takaoka (ed.) |
264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2001 | |
300 | |a XIV, 780 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 2223 | |
650 | 4 | |a Algorithmes - Congrès | |
650 | 7 | |a Algoritmen |2 gtt | |
650 | 4 | |a Calculs numériques - Informatique - Congrès | |
650 | 7 | |a Complexiteit |2 gtt | |
650 | 7 | |a Computerwiskunde |2 gtt | |
650 | 4 | |a Datenverarbeitung | |
650 | 4 | |a Computer algorithms |v Congresses | |
650 | 4 | |a Numerical calculations |x Data processing |v Congresses | |
650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |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 2001 |z Christchurch |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 | |
689 | 2 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 2 | |5 DE-604 | |
700 | 1 | |a Eades, Peter |e Sonstige |4 oth | |
711 | 2 | |a ISAAC |n 12 |d 2001 |c Christchurch, Neuseeland |j Sonstige |0 (DE-588)10030365-1 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 2223 |w (DE-604)BV000000607 |9 2223 | |
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=009612990&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009612990 |
Datensatz im Suchindex
_version_ | 1814888720805920768 |
---|---|
adam_text |
TABLE
OF
CONTENTS
INVITED
TALK
1
CHAIN
RECONFIGURATION:
THE
INS
AND
OUTS,
UPS
AND
DOWNS
OF
MOVING
POLYGONS
AND
POLYGONAL
LINKAGES
.
1
SUE
WHITESIDES
COMBINATORIAL
GENERATION
AND
OPTIMIZATION
(I)
APPLICATION
OF
M-CONVEX
SUBMODULAR
FLOW
PROBLEM
TO
MATHEMATICAL
ECONOMICS
.
14
KAZUO
MUROTA
AND
AKIHISA
TAMURA
A
POLYNOMIAL
TIME
APPROXIMATION
SCHEME
FOR
MINIMIZING
TOTAL
COMPLETION
TIME
OF
UNBOUNDED
BATCH
SCHEDULING
.
26
XIAOTIE
DENG,
HAODI
FENG,
FIXING
ZHANG,
AND
HONG
ZHU
A
POLYNOMIAL
TIME
APPROXIMATION
SCHEME
FOR
THE
MULTI-VEHICLE
SCHEDULING
PROBLEM
ON
A
PATH
WITH
RELEASE
AND
HANDLING
TIMES
.
36
YOSHIYUKI
KARUNO
AND
HIROSHI
NAGAMOCHI
SEMI-NORMAL
SCHEDULINGS:
IMPROVEMENT
ON
GOEMANS
'
ALGORITHM
.
48
JIANER
CHEN
AND
JINGUI
HUANG
PARALLEL
AND
DISTRIBUTED
ALGORITHMS
(I)
BALANCED
SCHEDULING
TOWARD
LOSS-FREE
PACKET
QUEUING
AND
DELAY
FAIRNESS
.
61
HISASHI
KOGA
BROADCASTING
WITH
UNIVERSAL
LISTS
REVISITED:
USING
COMPETITIVE
ANALYSIS
.
74
JAE-HOON
KIM
AND
KYUNG
YONG
CHWA
ON
ADAPTIVE
FAULT
DIAGNOSIS
FOR
MULTIPROCESSOR
SYSTEMS
.
86
KUMIKO
NOMURA,
TOSHINORI
YAMADA,
AND
SHUICHI
UENO
ON-LINE
MULTICASTING
IN
ALL-OPTICAL
NETWORKS
.
99
KENTA
HASHIMOTO,
TOSHINORI
YAMADA,
AND
SHUICHI
UENO
X
TABLE
OF
CONTENTS
GRAPH
DRAWING
AND
ALGORITHMS
(I)
ENUMERATING
FLOORPLANS
WITH
N
ROOMS
.
107
SHIN-ICHI
NAKANO
ON
MIN-MAX
CYCLE
BASES
.
116
GIULIA
GALBIATI
ON
THE
MINIMUM
LOCAL-VERTEX-CONNECTIVITY
AUGMENTATION
IN
GRAPHS
.
124
HIROSHI
NAGAMACHI
AND
TOSHIMASA
ISHII
COUNTING
GRAPH
ISOMORPHISMS
AMONG
CHORDAL
GRAPHS
WITH
RESTRICTED
CLIQUE
NUMBER
.
136
TAKAYUKI
NAGOYA
COMPUTATIONAL
GEOMETRY
(I)
QUANTUM
ALGORITHMS
FOR
INTERSECTION
AND
PROXIMITY
PROBLEMS
.
148
KUNIHIKO
SADAKANE,
NORITO
SUGAWARA,
AND
TAKESHI
TOKUYAMA
BUSHWHACK:
AN
APPROXIMATION
ALGORITHM
FOR
MINIMAL
PATHS
THROUGH
PSEUDO-EUCLIDEAN
SPACES
.
160
ZHENG
SUN
AND
JOHN
REIF
APPROXIMATION
OF
MINIMUM
TRIANGULATION
FOR
POLYHEDRON
WITH
BOUNDED
DEGREES
.
172
FRANCIS
Y.
L.
CHIN
AND
STANLEY
P.
Y.
FUNG
TREE-APPROXIMATIONS
FOR
THE
WEIGHTED
COST-DISTANCE
PROBLEM
(EXTENDED
ABSTRACT)
.
185
CHRISTIAN
SCHINDELHAUER
AND
BIRGITTA
WEBER
COMPUTATIONAL
COMPLEXITY
AND
CRYPTOLOGY
NECESSARY
AND
SUFFICIENT
NUMBERS
OF
CARDS
FOR
SHARING
SECRET
KEYS
ON
HIERARCHICAL
GROUPS
(EXTENDED
ABSTRACT)
.
196
TAKAAKI
MIZUKI
AND
TAKAO
NISHIZEKI
GENERIC
ALGORITHMS
AND
KEY
AGREEMENT
PROTOCOLS
BASED
ON
GROUP
ACTIONS
.
208
AKIHIRO
YAMAMURA
AND
KAORU
KUROSAWA
BAIRE
CATEGORY
AND
NOWHERE
DIFFERENTIABILITY
FOR
FEASIBLE
REAL
FUNCTIONS
.
219
JOSEF
M.
BREUTZMANN,
DAVID
W.
JUEDES,
AND
JACK
H.
LUTZ
TRANSLATION
AMONG
CNFS,
CHARACTERISTIC
MODELS
AND
ORDERED
BINARY
DECISION
DIAGRAMS
.
231
TAKASHI
HARIYAMA
AND
TOSHIHIDE
IBARAKI
TABLE
OF
CONTENTS
XI
AUTOMATA
AND
FORMAL
LANGUAGES
ON
REMOVING
THE
PUSHDOWN
STACK
IN
REACHABILITY
CONSTRUCTIONS
.
244
OSCAR
H.
IBARRA
AND
ZHE
DANG
A
NEW
RECOGNITION
ALGORITHM
FOR
EXTENDED
REGULAR
EXPRESSIONS
.
257
HIROAKI
YAMAMOTO
POLYNOMIAL-TIME
ALGORITHMS
FOR
THE
EQUIVALENCE
FOR
ONE-WAY
QUANTUM
FINITE
AUTOMATA
.
268
TAKESHI
KOSHIBA
AN
INDEX
FOR
THE
DATA
SIZE
TO
EXTRACT
DECOMPOSABLE
STRUCTURES
IN
LAD
.
279
HIROTAKA
ONO,
MUTSUNORI
YAGIURA,
AND
TOSHIHIDE
IBARAKI
INVITED
TALK
2
PARAMETERIZED
COMPLEXITY:
THE
MAIN
IDEAS
AND
SOME
RESEARCH
FRONTIERS
.
291
MICHAEL
R.
FELLOWS
GRAPH
DRAWING
AND
ALGORITHMS
(II)
TIGHT
BOUNDS
ON
MAXIMAL
AND
MAXIMUM
MATCHINGS
.
308
THERESE
BIEDL,
ERIK
D.
DEMAINE,
CHRISTIAN
A.
DUNCAN,
RUDOLF
FLEISCHER,
AND
STEPHEN
G.
KOBOUROV
RECOGNITION
AND
ORIENTATION
ALGORITHMS
FOR
/^-COMPARABILITY
GRAPHS
.
320
STAVROS
D.
NIKOLOPOULOS
AND
LEONIDAS
PALIOS
EFFICIENT
ALGORITHMS
FOR
K
TERMINAL
CUTS
ON
PLANAR
GRAPHS
.
332
DANNY
Z.
CHEN
AND
XIAODONG
WU
POLYNOMIAL
TIME
ALGORITHMS
FOR
EDGE-CONNECTIVITY
AUGMENTATION
OF
HAMILTONIAN
PATHS
.
345
ANNA
GALLUCCIO
AND
GUIDO
PROIETTI
COMBINATORIAL
GENERATION
AND
OPTIMIZATION
(II)
ALGORITHMS
FOR
PATTERN
INVOLVEMENT
IN
PERMUTATIONS
.
355
MICHAEL
H.
ALBERT,
ROBERT
E.
L.
ALDRED,
MIKE
D.
ATKINSON,
AND
DEREK
A.
HOLTON
A
FAST
ALGORITHM
FOR
ENUMERATING
BIPARTITE
PERFECT
MATCHINGS
.
367
TAKEAKI
UNO
XII
TABLE
OF
CONTENTS
ON-LINE
SCHEDULING
A
BATCH
PROCESSING
SYSTEM
TO
MINIMIZE
TOTAL
WEIGHTED
JOB
COMPLETION
TIME
.
380
BO
CHEN,
XIAOTIE
DENG,
AND
WENAN
ZANG
ON
THE
COMPLEXITY
OF
TRAIN
ASSIGNMENT
PROBLEMS
.
390
THOMAS
ERLEBACH,
MARTIN
GANTENBEIN,
DANIEL
HIIRLIMANN,
GABRIELE
NEYER,
ARIS
PAGOURTZIS,
PAOLO
PENNA,
KONRAD
SCHLUDE,
KATHLEEN
STEINHOFEL,
DAVID
SCOT
TAYLOR,
AND
PETER
WIDMAYER
COMPUTATIONAL
BIOLOGY
AND
STRING
MATCHING
(I)
A
COMBINATORIAL
TOOLBOX
FOR
PROTEIN
SEQUENCE
DESIGN
AND
LANDSCAPE
ANALYSIS
IN
THE
GRAND
CANONICAL
MODEL
.
403
JAMES
ASPNES,
JULIA
HARTLING,
MING
YANG
KAO,
JUNHYONG
KIM,
AND
GAURI
SHAH
COMPLEXITY
OF
COMPARING
HIDDEN
MARKOV
MODELS
.
416
RUNE
B.
LYNGS0
AND
CHRISTIAN
N.
S.
PEDERSEN
DNA
SELF-ASSEMBLY
FOR
CONSTRUCTING
3D
BOXES
(EXTENDED
ABSTRACT)
.
429
MING
YANG
KAO
AND
VIJAY
RAMACHANDRAN
EXACT
SOLUTIONS
FOR
C
LOSEST
S
TRING
AND
RELATED
PROBLEMS
.
441
JENS
GRAMM,
ROLF
NIEDERMEIER,
AND
PETER
ROSSMANITH
COMPUTATIONAL
GEOMETRY
(II)
TOPOLOGICAL
PEELING
AND
IMPLEMENTATION
.
454
DANNY
Z.
CHEN,
SHUANG
LUAN,
AND
JINHUI
XU
IMAGE
SEGMENTATION
WITH
MONOTONICITY
AND
SMOOTHNESS
CONSTRAINTS
.
467
DANNY
Z.
CHEN,
JIE
WANG,
AND
XIAODONG
WU
OPTIMIZATION
ALGORITHMS
FOR
SWEEPING
A
POLYGONAL
REGION
WITH
MOBILE
GUARDS
.
480
JAE-HA
LEE,
SANG-MIN
PARK,
AND
KYUNG
YONG
CHWA
APPROXIMATION
OF
A
GEOMETRIC
SET
COVERING
PROBLEM
.
493
SOFIA
KOVALEVA
AND
FRITS
C.
R.
SPIEKSMA
INVITED
TALK
3
SHORTEST
PATH
ALGORITHMS:
ENGINEERING
ASPECTS
.
502
ANDREW
V.
GOLDBERG
TABLE
OF
CONTENTS
XIII
GRAPH
DRAWING
AND
ALGORITHMS
(III)
EFFICIENT
ALGORITHMS
FOR
WEIGHTED
COLORINGS
OF
SERIES-PARALLEL
GRAPHS
.
514
XIAO
ZHOU
AND
TAKAO
NISHIZEKI
GO
WITH
THE
WINNERS
ALGORITHMS
FOR
CLIQUES
IN
RANDOM
GRAPHS
.
525
MARCUS
PEINADO
COMPLEXITY
OF
PARTIAL
COVERS
OF
GRAPHS
.
537
JIRI
FIALA
AND
JAN
KRATOCHVFL,
ON
GAME-THEORETIC
MODELS
OF
NETWORKS
.
550
HANS
L.
BODLAENDER,
MICHAEL
J.
DINNEEN,
AND
BAKHADYR
KHOUSSAINOV
PARALLEL
AND
DISTRIBUTED
ALGORITHMS
(II)
THE
COMPLEXITY
OF
SOME
BASIC
PROBLEMS
FOR
DYNAMIC
PROCESS
GRAPHS
.
562
ANDREAS
JAKOBY
AND
MACIEJ
LISKIEWICZ
DELAY
OPTIMIZATIONS
IN
QUORUM
CONSENSUS
.
575
XUEMIN
LIN
RANDOMIZED
SHARED
QUEUES
APPLIED
TO
DISTRIBUTED
OPTIMIZATION
ALGORITHMS
.
587
HYUNYOUNG
LEE
AND
JENNIFER
L.
WELCH
MULTIPROCESS
TIME
QUEUE
.
599
ANDREJ
BRODNIK
AND
JOHAN
KARLSSON
COMPUTATIONAL
GEOMETRY
(III)
LABELING
POINTS
WITH
WEIGHTS
.
610
SHEUNG-HUNG
POON,
CHAN-SU
SHIN,
TYCHO
STRIJK,
AND
ALEXANDER
WOLFF
SMALL
CONVEX
QUADRANGULATIONS
OF
POINT
SETS
.
623
DAVID
BREMNER,
FERRAN
HURTADO,
SUNEETA
RAMASWAMI,
AND
VERA
SACRISTAN
HOW
TO
COLOR
A
CHECKERBOARD
WITH
A
GIVEN
DISTRIBUTION
-
MATRIX
ROUNDING
ACHIEVING
LOW
2
X
2-DISCREPANCY
.
636
TETSUO
ASANO
AND
TAKESHI
TOKUYAMA
LABELING
SUBWAY
LINES
.
649
MARI
ANGELES
GARRIDO,
CLAUDIA
ITURRIAGA,
ALBERTO
MARQUEZ,
JOSE
RAMON
PORTILLO,
PEDRO
REYES,
AND
ALEXANDER
WOLFF
RANDOMIZED
AND
APPROXIMATION
ALGORITHMS
COMPLEXITY
STUDY
ON
TWO
CLUSTERING
PROBLEMS
(EXTENDED
ABSTRACT)
.
660
LOUXIN
ZHANG
AND
SONG
ZHU
XIV
TABLE
OF
CONTENTS
A
MODIFIED
GREEDY
ALGORITHM
FOR
THE
SET
COVER
PROBLEM
WITH
WEIGHTS
1
AND
2
.
670
TOSHIHIRO
FUJITO
AND
TSUYOSHI
OKUMURA
A
UNIFIED
FRAMEWORK
FOR
APPROXIMATING
MULTIWAY
PARTITION
PROBLEMS
(EXTENDED
ABSTRACT)
.
682
LIANG
ZHAO,
HIROSHI
NAGAMOCHI,
AND
TOSHIHIDE
IBARAKI
ON-LINE
ALGORITHMS
FOR
CARDINALITY
CONSTRAINED
BIN
PACKING
PROBLEMS
.
695
LUITPOLD
BABEL,
BO
CHEN,
HANS
KELLERER,
AND
VLADIMIR
KOTOV
COMPUTATIONAL
BIOLOGY
AND
STRING
MATCHING
(II)
SUFFIX
VECTOR:
A
SPACE-EFFICIENT
SUFFIX
TREE
REPRESENTATION
.
707
KRISZTIAN
MONOSTORI,
ARKADY
ZASLAVSKY,
AND
ISTVAN
VAJK
FRAGMENTARY
PATTERN
MATCHING:
COMPLEXITY,
ALGORITHMS
AND
APPLICATIONS
FOR
ANALYZING
CLASSIC
LITERARY
WORKS
.
719
HIDEAKI
HORI,
SHINICHI
SHIMOZONO,
MASAYUKI
TAKEDA,
AND
AYUMI
SHINOHARA
COMPUTING
THE
QUARTET
DISTANCE
BETWEEN
EVOLUTIONARY
TREES
IN
TIME
O(NLOG
2
N)
.
731
GERTH
ST0LTING
BRODAL,
ROLF
FAGERBERG,
AND
CHRISTIAN
N.
S.
PEDERSEN
ALGORITHMS
AND
DATA
STRUCTURES
THE
CENT-DIAN
PATH
PROBLEM
ON
TYEE
NETWORKS
.
743
RONALD
I.
BECKER,
YEN-I
CHIANG,
ISABELLA
LARI,
AND
ANDREA
SCOZZARI
APPROXIMATE
HOTLINK
ASSIGNMENT
.
756
EVANGELOS
KRANAKIS,
DANNY
KRIZANC,
AND
SUNIL
SHENDE
EFFICIENT
ALGORITHMS
FOR
TWO
GENERALIZED
2-MEDIAN
PROBLEMS
ON
TREES
.
768
SHAN-CHYUN
KU,
CHI-JEN
LU,
BIING-FENG
WANG,
AND
TZU-CHIN
LIN
AUTHOR
INDEX
.
779 |
any_adam_object | 1 |
building | Verbundindex |
bvnumber | BV014038390 |
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)48621378 (DE-599)BVBBV014038390 |
dewey-full | 004.015118 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.015118 |
dewey-search | 004.015118 |
dewey-sort | 14.015118 |
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">BV014038390</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020104</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">011127s2001 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">963118196</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540429859</subfield><subfield code="9">3-540-42985-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)48621378</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014038390</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-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</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">004.015118</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</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 computation</subfield><subfield code="b">12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings</subfield><subfield code="c">Peter Eades ; Tadao Takaoka (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">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 780 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">2223</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">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculs numériques - Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computerwiskunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical calculations</subfield><subfield code="x">Data processing</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">2001</subfield><subfield code="z">Christchurch</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="689" ind1="2" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Eades, Peter</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ISAAC</subfield><subfield code="n">12</subfield><subfield code="d">2001</subfield><subfield code="c">Christchurch, Neuseeland</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10030365-1</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">2223</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">2223</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=009612990&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-009612990</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2001 Christchurch gnd-content |
genre_facet | Konferenzschrift 2001 Christchurch |
id | DE-604.BV014038390 |
illustrated | Illustrated |
indexdate | 2024-11-05T13:19:17Z |
institution | BVB |
institution_GND | (DE-588)10030365-1 |
isbn | 3540429859 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009612990 |
oclc_num | 48621378 |
open_access_boolean | |
owner | DE-739 DE-91G DE-BY-TUM DE-384 DE-703 DE-29T DE-824 DE-83 DE-188 DE-706 |
owner_facet | DE-739 DE-91G DE-BY-TUM DE-384 DE-703 DE-29T DE-824 DE-83 DE-188 DE-706 |
physical | XIV, 780 S. graph. Darst. |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings Peter Eades ; Tadao Takaoka (ed.) Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2001 XIV, 780 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 2223 Algorithmes - Congrès Algoritmen gtt Calculs numériques - Informatique - Congrès Complexiteit gtt Computerwiskunde gtt Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2001 Christchurch gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Datenstruktur (DE-588)4011146-5 s Algorithmische Geometrie (DE-588)4130267-9 s Eades, Peter Sonstige oth ISAAC 12 2001 Christchurch, Neuseeland Sonstige (DE-588)10030365-1 oth Lecture notes in computer science 2223 (DE-604)BV000000607 2223 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009612990&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings Lecture notes in computer science Algorithmes - Congrès Algoritmen gtt Calculs numériques - Informatique - Congrès Complexiteit gtt Computerwiskunde gtt Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Datenstruktur (DE-588)4011146-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4011146-5 (DE-588)4130267-9 (DE-588)4001183-5 (DE-588)1071861417 |
title | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings |
title_auth | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings |
title_exact_search | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings |
title_full | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings Peter Eades ; Tadao Takaoka (ed.) |
title_fullStr | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings Peter Eades ; Tadao Takaoka (ed.) |
title_full_unstemmed | Algorithms and computation 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings Peter Eades ; Tadao Takaoka (ed.) |
title_short | Algorithms and computation |
title_sort | algorithms and computation 12th international symposium isaac 2001 christchurch new zealand december 19 21 2001 proceedings |
title_sub | 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19 - 21, 2001 ; proceedings |
topic | Algorithmes - Congrès Algoritmen gtt Calculs numériques - Informatique - Congrès Complexiteit gtt Computerwiskunde gtt Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Datenstruktur (DE-588)4011146-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Algorithmes - Congrès Algoritmen Calculs numériques - Informatique - Congrès Complexiteit Computerwiskunde Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Datenstruktur Algorithmische Geometrie Algorithmus Konferenzschrift 2001 Christchurch |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009612990&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT eadespeter algorithmsandcomputation12thinternationalsymposiumisaac2001christchurchnewzealanddecember19212001proceedings AT isaacchristchurchneuseeland algorithmsandcomputation12thinternationalsymposiumisaac2001christchurchnewzealanddecember19212001proceedings |