Algorithms and computation: 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1997
|
| Schriftenreihe: | Lecture notes in computer science
1350 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XV, 426 S. graph. Darst. |
| ISBN: | 3540638903 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011637927 | ||
| 003 | DE-604 | ||
| 005 | 19980105 | ||
| 007 | t| | ||
| 008 | 971110s1997 gw d||| |||| 10||| eng d | ||
| 016 | 7 | |a 952016095 |2 DE-101 | |
| 020 | |a 3540638903 |9 3-540-63890-3 | ||
| 035 | |a (OCoLC)38176066 | ||
| 035 | |a (DE-599)BVBBV011637927 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-20 |a DE-91G |a DE-739 |a DE-384 |a DE-19 |a DE-521 |a DE-634 |a DE-83 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 004.015118 |2 21 | |
| 082 | 0 | |a 005.1 |2 20 | |
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings |c Hon Wai Leong ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1997 | |
| 300 | |a XV, 426 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 1350 | |
| 650 | 7 | |a Algorithmes - Congrès |2 ram | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Algoritmos e estruturas de dados |2 larpcal | |
| 650 | 7 | |a Complexiteit |2 gtt | |
| 650 | 7 | |a Complexité de calcul (informatique) - Congrès |2 ram | |
| 650 | 7 | |a Computerwiskunde |2 gtt | |
| 650 | 7 | |a Teoria da computacao |2 larpcal | |
| 650 | 7 | |a algorithme parallèle |2 inriac | |
| 650 | 7 | |a algorithme probabiliste |2 inriac | |
| 650 | 7 | |a algorithme réparti |2 inriac | |
| 650 | 7 | |a automate |2 inriac | |
| 650 | 7 | |a cryptographie |2 inriac | |
| 650 | 7 | |a géométrie algorithmique |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a optimisation combinatoire |2 inriac | |
| 650 | 7 | |a structure donnée |2 inriac | |
| 650 | 7 | |a théorie complexité |2 inriac | |
| 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 Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |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 1997 |z Singapur |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Berechnungstheorie |0 (DE-588)4005581-4 |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 | |
| 689 | 3 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Leong, Hon Wai |d 1955- |e Sonstige |0 (DE-588)1018350985 |4 oth | |
| 711 | 2 | |a ISAAC |n 8 |d 1997 |c Singapur |j Sonstige |0 (DE-588)2166748-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1350 |w (DE-604)BV000000607 |9 1350 | |
| 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=007843156&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007843156 | |
Datensatz im Suchindex
| _version_ | 1820874870905372672 |
|---|---|
| adam_text |
CONTENTS
INVITED
PRESENTATION
SOLVING
NP-HARD
COMBINATORIAL
PROBLEMS
IN
THE
1
PRACTICAL
SENSE
TOSHIHIDE
IBARAKI
SESSION
1
AIRLINE
CREW-SCHEDULING
PROBLEM
WITH
MANY
IRREGULAR
2
FLIGHTS
AKIRA
TAJIMA
AND
SHINJI
MISONO
PRACTICAL
APPROACH
TO
A
FACILITY
LOCATION
PROBLEM
FOR
12
LARGE-SCALE
LOGISTICS
KAZUYOSHI
HIDAKA
AND
HIROYUKI
OKANO
HARD
INSTANCE
GENERATION
FOR
SAT
22
SATOSHI
HORIE
AND
OSAMU
WATANABE
SESSION
2A
PLAYING
TETRIS
ON
MESHES
AND
MULTI-DIMENSIONAL
32
SHEARSORT
MIROLAW
KUTYLOWSKI
AND
ROLF
WANKA
FORMULATION
OF
THE
ADDITION-SHIFT-SEQUENCE
PROBLEM
42
AND
ITS
COMPLEXITY
AKIHIRO
MATSUURA
AND
AKIRA
NAGOYA
WEIGHTED
AND
UNWEIGHTED
SELECTION
ALGORITHMS
FOR
K
52
SORTED
SEQUENCES
TATSUYA
HAYASHI,
KOJI
NAKANO
AND
STEPHAN
OLARIU
SESSION
2B
AN
ADAPTIVE
DISTRIBUTED
FAULT-TOLERANT
ROUTING
62
ALGORITHM
FOR
THE
STAR
GRAPH
LEQIANG
BAI,
HIROYUKI
EBARA,
HIDEO
NAKANO
AND
HAJIME
MAEDA
MULTI-COLOR
ROUTING
IN
THE
UNDIRECTED
HYPERCUBE
72
QIAN-PING
GU
AND
HISAO
TAMAKI
COMPETITIVE
SOURCE
ROUTING
ON
TORI
AND
MESHES
82
TZUOO-HAWN
YEH,
CHENG-MING
KUO,
CHIN-LAUNG
LEI
AND
HSU-CHUN
YEN
SESSION
3A
ALGORITHMS
FOR
ENUMERATING
ALL
PERFECT,
MAXIMUM
92
AND
MAXIMAL
MATCHINGS
IN
BIPARTITE
GRAPHS
TAKEAKI
UNO
AUGMENTING
EDGE
AND
VERTEX
CONNECTIVITIES
102
SIMULTANEOUSLY
TOSHIMASA
ISHII,
HIROSHI
NAGAMOCHI
AND
TOSHIHIDE
IBARAKI
SESSION
3B
TWO-FACE
HORN
EXTENSIONS
112
THOMAS
EITER,
TOSHIHIDE
IBARAKI
AND
KAZUHISA
MAKINO
DECREMENTAL
MAINTENANCE
OF
REACHABILITY
IN
122
HYPERGRAPHS
AND
MINIMUM
MODELS
OF
HOM
FORMULAE
GIORGIO
AUSIELLO,
PAOLO
GIULIO
FRANCIOSA,
DANIELE
FRIGIONI
AND
ROBERTO
GIACCIO
INVITED
PRESENTATION
ALGORITHMIC
ANALYSIS
OF
MULTITHREADED
ALGORITHMS
132
CHARLES
E.
LEISERSON
BEST
PAPER
PRESENTATION
A
CHARACTERIZATION
OF
PLANAR
GRAPHS
BY
PSEUDO-LINE
133
ARRANGEMENTS
HISAO
TAMAKI
AND
TAKESHI
TOKUYAMA
SESSION
4A
OPTIMAL
FAULT-TOLERANT
BROADCASTING
IN
TREES
143
PETRI§OR
PANAITE
AND
ANDRZEJ
PELC
A
THEORETICAL
FRAMEWORK
OF
HYBRID
APPROACHES
TO
153
MAX
SAT
TAKAO
ASANO,
KUNIAKI
HORI,
TAKAO
ONO
AND
TOMIO
HIRATA
EXPONENTIAL
LOWER
BOUNDS
ON
THE
SIZE
OF
OBDDS
163
REPRESENTING
INTEGER
DIVISION
TAKASHI
HORIYAMA
AND
SHUZO
YAJIMA
SESSION
4B
ON-LINE
VERSUS
OFF-LINE
IN
MONEY-MAKING
STRATEGIES
173
WITH
BROKERAGE
EISUKE
DANNOURA
AND
KOUICHI
SAKURAI
DECISION-MAKING
BY
HIERARCHIES
OF
DISCORDANT
AGENTS
183
XIAOTIE
DENG
AND
CHRISTOS
PAPADIMITRIOU
A
NEW
EFFICIENT
OFF-LINE
ANONYMOUS
CASH
SCHEME
193
KHANH
QUOC
NGUYEN,
VIJAY
VARADHARAJAN
AND
YI
MU
SESSION
5A
APPROXIMATING
UNWEIGHTED
CONNECTIVITY
PROBLEMS
IN
202
PARALLEL
ZHI-ZHONG
CHEN
A
RANDOMIZED
LINEAR
WORK
EREW
PRAM
ALGORITHM
212
TO
FIND
A
MINIMUM
SPANNING
FOREST
CHUNG
KEUNG
POON
AND
VIJAYA
RAMACHANDRAN
EFFICIENT
PARALLEL
ALGORITHMS
FOR
PLANAR
ST-GRAPHS
223
MIKHAIL
J.
ATALLAH,
DANNY
Z.
CHEN
AND
OVIDIU
DAESCU
SESSION
5B
PEG-SOLITAIRE,
STRING
REWRITING
SYSTEMS
AND
FINITE
233
AUTOMATA
B.
RAVIKUMAR
ON
THE
SIZE
OF
PROBABILISTIC
FORMULAE
243
HARTMUT
KLAUCK
HOMOPHONIC
CODING
WITH
LOGARITHMIC
MEMORY
SIZE
253
BORIS
RYABKO
AND
ANDREY
FIONOV
SESSION
6A
COMPLEXITY
AND
MODELING
ASPECTS
OF
MESH
REFINEMENT
263
INTO
QUADRILATERALS
ROLF
H.
MBHRING
AND
MATTHIAS
MIILLER-HANNEMANN
TOPOLOGY
ORIENTED
VS
EXACT
ARITHMETIC
-
EXPERIENCE
273
IN
IMPLEMENTING
THE
THREE-DIMENSIONAL
CONVEX
HULL
ALGORITHM
TSUYOSHI
MINAKAWA
AND
KOKICHI
SUGIHARA
SESSION
6B
THE
COMPLEXITY
OF
LEARNING
BRANCHES
AND
STRATEGIES
283
FROM
QUERIES
MATTHIAS
OTT
AND
FRANK
STEPHAN
SINGULARITIES
MAKE
SPATIAL
JOIN
SCHEDULING
HARD
293
GABRIELE
NEYER
AND
PETER
WIDMAYER
SESSION
7
A
A
FASTER
ONE-DIMENSIONAL
TOPOLOGICAL
COMPACTION
303
ALGORITHM
HSIAO-FENG
STEVEN
CHEN
AND
D.
T.
LEE
ALGORITHMS
FOR
FINDING
OPTIMAL
DISJOINT
PATHS
AROUND
314
A
RECTANGLE
WUN-TAT
CHAN
AND
FRANCIS
Y.L.
CHIN
AN
ALGORITHM
FOR
FINDING
A
REGION
WITH
THE
MINIMUM
324
TOTAL
LY
DISTANCE
FROM
PRESCIBED
TERMINALS
YOSHIYUKI
KUSAKARI
AND
TAKAO
NISHIZEKI
SESSION
7B
ON
DEFECT
SETS
IN
BIPARTITE
GRAPHS
P.
E.
HAXELL
AND
M.
LOEBL
334
DYNAMIC
PROGRAMMING
ON
DISTANCE-HEREDITARY
GRAPHS
344
MAW-SHANG
CHANG,
SUN-YUAN
HSIEH
AND
GEN-HUEY
CHEN
ON
THE
EQUIVALENCE
IN
COMPLEXITY
AMONG
BASIC
354
PROBLEMS
ON
BIPARTITE
AND
PARITY
GRAPHS
SERAFINO
CICERONE
AND
GABRIELE
DI
STEFANO
SESSION
8A
ALL-CAVITY
MAXIMUM
MATCHINGS
364
MING-YANG
KAO,
TAK
WAH
LAM,
WING
KIN
SUNG
AND
HING
FUNG
TING
FAST
ALGORITHMS
FOR
COMPUTING
(3
-SKELETONS
AND
THEIR
374
RELATIVES
S.
V.
RAO
AND
ASISH
MUKHOPADHYAY
A
BRANCH-AND-CUT
APPROACH
FOR
MINIMUM
WEIGHT
384
TRIANGULATION
YOSHIAKI
KYODA,
KEIKO
IMAI,
FUMIHIKO
TAKEUCHI
AND
AKIRA
TAJIMA
SESSION
8B
AN
EFFICIENT
APPROXIMATION
SCHEME
FOR
THE
394
SUBSET-SUM
PROBLEM
HANS
KELLERER,
ULRICH
PFERSCHY
AND
MARIA
GRAZIA
SPERANZA
COMPETITIVE
CALL
CONTROL
IN
MOBILE
NETWORKS
GRAMMATI
E.
PANTZIOU,
GEORGE
P.
PENTARIS
AND
PAUL
G.
SPIRAKIS
404
GENERALIZED
SWAP-WITH-PARENT
SCHEMES
FOR
414
SELF-ORGANIZING
SEQUENTIAL
LINEAR
LISTS
JOHN
OOMMEN
AND
JUAN
DONG
AUTHOR
INDEX
425 |
| any_adam_object | 1 |
| author_GND | (DE-588)1018350985 |
| building | Verbundindex |
| bvnumber | BV011637927 |
| 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 1997 SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)38176066 (DE-599)BVBBV011637927 |
| dewey-full | 004.015118 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science 005 - Computer programming, programs, data, security |
| dewey-raw | 004.015118 005.1 |
| dewey-search | 004.015118 005.1 |
| 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 a2200000 cb4500</leader><controlfield tag="001">BV011637927</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980105</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">971110s1997 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">952016095</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540638903</subfield><subfield code="9">3-540-63890-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38176066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011637927</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-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</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="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and computation</subfield><subfield code="b">8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings</subfield><subfield code="c">Hon Wai Leong ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 426 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">1350</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">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos e estruturas de dados</subfield><subfield code="2">larpcal</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">Complexité de calcul (informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computerwiskunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria da computacao</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme probabiliste</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme réparti</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automate</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">cryptographie</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">géométrie algorithmique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">structure donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie complexité</subfield><subfield code="2">inriac</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">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">1997</subfield><subfield code="z">Singapur</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">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</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="689" ind1="3" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Leong, Hon Wai</subfield><subfield code="d">1955-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1018350985</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ISAAC</subfield><subfield code="n">8</subfield><subfield code="d">1997</subfield><subfield code="c">Singapur</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2166748-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">1350</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1350</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=007843156&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-007843156</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1997 Singapur gnd-content |
| genre_facet | Konferenzschrift 1997 Singapur |
| id | DE-604.BV011637927 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:06:37Z |
| institution | BVB |
| institution_GND | (DE-588)2166748-2 |
| isbn | 3540638903 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007843156 |
| oclc_num | 38176066 |
| open_access_boolean | |
| owner | DE-20 DE-91G DE-BY-TUM DE-739 DE-384 DE-19 DE-BY-UBM DE-521 DE-634 DE-83 DE-188 DE-706 |
| owner_facet | DE-20 DE-91G DE-BY-TUM DE-739 DE-384 DE-19 DE-BY-UBM DE-521 DE-634 DE-83 DE-188 DE-706 |
| physical | XV, 426 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings Hon Wai Leong ... (eds.) Berlin [u.a.] Springer 1997 XV, 426 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1350 Algorithmes - Congrès ram Algoritmen gtt Algoritmos e estruturas de dados larpcal Complexiteit gtt Complexité de calcul (informatique) - Congrès ram Computerwiskunde gtt Teoria da computacao larpcal algorithme parallèle inriac algorithme probabiliste inriac algorithme réparti inriac automate inriac cryptographie inriac géométrie algorithmique inriac langage formel inriac optimisation combinatoire inriac structure donnée inriac théorie complexité inriac Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1997 Singapur gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Berechnungstheorie (DE-588)4005581-4 s Algorithmische Geometrie (DE-588)4130267-9 s Komplexitätstheorie (DE-588)4120591-1 s Leong, Hon Wai 1955- Sonstige (DE-588)1018350985 oth ISAAC 8 1997 Singapur Sonstige (DE-588)2166748-2 oth Lecture notes in computer science 1350 (DE-604)BV000000607 1350 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007843156&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings Lecture notes in computer science Algorithmes - Congrès ram Algoritmen gtt Algoritmos e estruturas de dados larpcal Complexiteit gtt Complexité de calcul (informatique) - Congrès ram Computerwiskunde gtt Teoria da computacao larpcal algorithme parallèle inriac algorithme probabiliste inriac algorithme réparti inriac automate inriac cryptographie inriac géométrie algorithmique inriac langage formel inriac optimisation combinatoire inriac structure donnée inriac théorie complexité inriac Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Berechnungstheorie (DE-588)4005581-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4005581-4 (DE-588)4120591-1 (DE-588)4130267-9 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings |
| title_auth | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings |
| title_exact_search | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings |
| title_full | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings Hon Wai Leong ... (eds.) |
| title_fullStr | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings Hon Wai Leong ... (eds.) |
| title_full_unstemmed | Algorithms and computation 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings Hon Wai Leong ... (eds.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 8th international symposium isaac 97 singapore december 17 19 1997 proceedings |
| title_sub | 8th international symposium, ISAAC '97, Singapore, December 17 - 19, 1997 ; proceedings |
| topic | Algorithmes - Congrès ram Algoritmen gtt Algoritmos e estruturas de dados larpcal Complexiteit gtt Complexité de calcul (informatique) - Congrès ram Computerwiskunde gtt Teoria da computacao larpcal algorithme parallèle inriac algorithme probabiliste inriac algorithme réparti inriac automate inriac cryptographie inriac géométrie algorithmique inriac langage formel inriac optimisation combinatoire inriac structure donnée inriac théorie complexité inriac Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Berechnungstheorie (DE-588)4005581-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes - Congrès Algoritmen Algoritmos e estruturas de dados Complexiteit Complexité de calcul (informatique) - Congrès Computerwiskunde Teoria da computacao algorithme parallèle algorithme probabiliste algorithme réparti automate cryptographie géométrie algorithmique langage formel optimisation combinatoire structure donnée théorie complexité Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Berechnungstheorie Komplexitätstheorie Algorithmische Geometrie Algorithmus Konferenzschrift 1997 Singapur |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007843156&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT leonghonwai algorithmsandcomputation8thinternationalsymposiumisaac97singaporedecember17191997proceedings AT isaacsingapur algorithmsandcomputation8thinternationalsymposiumisaac97singaporedecember17191997proceedings |