Algorithms and computation: 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin u.a.
Springer
1996
|
| Schriftenreihe: | Lecture notes in computer science
1178 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 448 S. graph. Darst. |
| ISBN: | 3540620486 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011068205 | ||
| 003 | DE-604 | ||
| 005 | 19970513 | ||
| 007 | t | ||
| 008 | 961113s1996 gw d||| |||| 10||| eng d | ||
| 016 | 7 | |a 948916613 |2 DE-101 | |
| 020 | |a 3540620486 |9 3-540-62048-6 | ||
| 035 | |a (OCoLC)36311836 | ||
| 035 | |a (DE-599)BVBBV011068205 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-739 |a DE-91G |a DE-29T |a DE-20 |a DE-19 |a DE-634 |a DE-83 |a DE-706 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 001.64 |b L497, v.1178 |2 21 | |
| 084 | |a SS 1996 |0 (DE-625)143433: |2 rvk | ||
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a 68-06 |2 msc | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings |c Tetsuo Asano ... (eds.) |
| 264 | 1 | |a Berlin u.a. |b Springer |c 1996 | |
| 300 | |a X, 448 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 1178 | |
| 650 | 4 | |a Algorithmes - Congrès | |
| 650 | 7 | |a Algorithmes - Congrès |2 ram | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Calculs numériques - Congrès |2 ram | |
| 650 | 4 | |a Calculs numériques - Informatique - Congrès | |
| 650 | 7 | |a algorithme graphe |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a cryptographie |2 inriac | |
| 650 | 7 | |a géométrie algorithmique |2 inriac | |
| 650 | 7 | |a ordonnancement |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 1996 |z Osaka |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 Asano, Tetsuo |e Sonstige |4 oth | |
| 711 | 2 | |a ISAAC |n 7 |d 1996 |c Osaka |j Sonstige |0 (DE-588)2159826-5 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1178 |w (DE-604)BV000000607 |9 1178 | |
| 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=007413650&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| _version_ | 1805067693996376064 |
|---|---|
| adam_text |
CONTENTS
SESSION
1:
INVITED
PRESENTATION
APPLICATIONS
OF
A
NUMBERING
SCHEME
FOR
POLYGONAL
OBSTACLES
IN
THE
PLANE
MIKHAIL
J.
ATALLAH
AND
DANNY
Z.
CHEN
.
1
SESSION
2:
INVITED
PRESENTATION
MULTICAST
COMMUNICATION
IN
HIGH
SPEED
NETWORKS
JONATHAN
S.
TURNER
.
25
SESSION
3A
INCREMENTAL
CONVEX
HULL
ALGORITHMS
ARE
NOT
OUTPUT
SENSITIVE
DAVID
BREMNER
.
26
SEPARATING
AND
SHATTERING
LONG
LINE
SEGMENTS
ALON
EFRAT
AND
OTFRIED
SCHWARZKOPF
.
36
OPTIMAL
LINE
BIPARTITIONS
OF
POINT
SETS
OLIVIER
DEVILLERS
AND
MATTHEW
J.
KATZ
.
45
INTERVAL
FINDING
AND
ITS
APPLICATION
TO
DATA
MINTNG
TAKESHI
FUKUDA,
YASUHIKO
MORIMOTO.
SHINICHI
MORISHITA
AND
TAKESHI
TOKUYAMA
.
55
SESSION
3B
ON
THE
APPROXIMABILITY
OF
THE
STEINER
TREE
PROBLEM
IN
PHYLOGENY
DAVID
FERNANDEZ-BACA
AND
JENS
LAGERGREN
.
65
APPROXIMATION
AND
SPECIAL
CASES
OF
COMMON
SUBTREES
AND
EDITING
DISTANCE
MAGNUS
M.
HALLDDRSSON
AND
KEISUKE
TANAKA
.
75
TWO-DIMENSIONAL
DYNAMIC
DICTIONARY
MATCHING
YING
CHOI
AND
TAK
WAH
LAM
.
85
DISCOVERING
UNBOUNDED
UNIONS
OF
REGULAR
PATTERN
LANGUAGES
FROM
POSITIVE
EXAMPLES
ALVIS
BRAZMA,
ESKO
UKKONEN
AND
JAAK
VILO
.
95
SESSION
4A
EXTREMAL
PROBLEMS
FOR
GEOMETRIC
HYPERGRAPHS
TAMAI
K.
DEY
AND
JANOS
PACH
.
105
COMPUTING
FAIR
AND
BOTTLENECK
MATCHINGS
IN
GEOMETRIC
GRAPHS
ALON
EFRAT
AND
MATTHEW
J.
KATZ
.
115
VIII
COMPUTING
THE
MAXIMUM
OVERLAP
OF
TTVO
CONVEX
POLYGONS
UNDER
TRANSLATIONS
MARK
DE
BERG,
OLIVIER
DEVILLERS,
MARC
VAN
KREVELD.
OTFRIED
SCHWARZKOPF
AND
MONIQUE
TEILLAUD
.
126
SESSION
4B
OBDDS
OF
A
MONOTONE
FUNCTION
AND
OF
ITS
PRIME
IMPLICANTS
KAZUYOSHI
HAYASE
AND
HIROSHI
IMAI
.
136
ALGORITHMS
FOR
MAXIMUM
MATCHING
AND
MINIMUM
FILL-IN
ON
CHORDAL
BIPARTITE
GRAPHS
MAW-SHANG
CHANG
.
146
GRAPH
SEARCHING
ON
CHORDAL
GRAPHS
SHENG-LUNG
PENG,
MING-TAT
KO,
CHIN-WEN
HO,
TSAN-SHENG
HSU
AND
CHUAN-YI
TANG
156
SESSION
5A
AN
ALGORITHM
FOR
ENUMERATING
ALL
DIRECTED
SPANNING
TREES
IN
A
DIRECTED
GRAPH
TAKEAKI
UNO
.
166'
VERTEX
RANKING
OF
ASTEROIDAL
TRIPLE-FREE
GRAPHS
TON
KLOKS,
HAIKO
MULLER
AND
C.
K.
WONG
.
174
SESSION
5B
RECURSIVELY
DIVISIBLE
PROBLEMS
ROLF
NIEDERMEIER
.
183
STUSPACETIOGN)
C
DSPACELFOG
2
NF
LOG
LOGN)
ERIC
ALLENDER
AND
KLAUS-JORN
LANGE
.
193
SESSION
6A
FINDING
EDGE-DISJOINT
PATHS
IN
PARTIAL
K-TREES
XIAO
ZHOU,
SYUREI
TAMURA
AND
TAKAO
NISHIZEKI
.
203
OPTIMAL
AUGMENTATION
FOR
BIPARTITE
COMPONENTWISE
BI
CONNECTIVITY
IN
LINEAR
TIME
TSAN-SHENG
HSU
AND
MING-YANG
KAO
.
213
TOWARDS
MORE
PRECISE
PARALLEL
BI
CONNECTIVITY
APPROXIMATION
KA
WONG
CHONG
AND
TAK
WAH
LAM
.
223
SESSION
6B
THE
COMPLEXITY
OF
PROBABILISTIC
VERSUS
DETERMINISTIC
FINITE
AUTOMATA
ANDRIS
AMBAINIS
.
233
BOUNDED
LENGTH
UCFG
EQUIVALENCE
B.
LITOW
.
239
IX
SESSION
7A
THE
STEINER
MINIMAL
TREE
PROBLEM
IN
THE
X-GEOMETRY
PLANE
D.T.
LEE
AND
C.F.
SHEN
.
247
A
STUDY
OF
THE
LMT-SKELETON
SIU-WING
CHENG,
NAOKI
KATOH
AND
MANABU
SUGAI
.
256
A
NEW
SUBGRAPH
OF
MINIMUM
WEIGHT
TRIANGULATIONS
CAO
AN
WANG,
FRANCIS
CHIN
AND
YIN-FENG
XU
.
266
SESSION
7B
DYNAMIC
TREE
ROUTING
UNDER
THE
'
'
MATCHING
WITH
CONSUMPTION
"
MODEL
GRAMMATI
E.
PANTZIOU,
ALAN
ROBERTS
AND
ANTONIS
SYMVONIS
.
275
DIMENSION-EXCHANGE
TOKEN
DISTRIBUTION
ON
THE
MESH
AND
THE
TORUS
MICHAEL
E.
HOULE
AND
GAVIN
TURNER
.
285
DIRECTED
HAMILTONIAN
PACKING
IN
D-DIMENSIONAL
MESHES
AND
ITS
APPLICATION
JAE-HA
LEE,
CHAN-SU
SHIN
AND
KYUNG-YONG
CHWA
.
295
SESSION
8A
K-PAIRS
NON-CROSSING
SHORTEST
PATHS
IN
A
SIMPLE
POLYGON
EVANTHIA
PAPADOPOULOU
.
305
MINIMUM
CONVEX
PARTITION
OF
A
POLYGON
WITH
HOLES
BY
CUTS
IN
GIVEN
DIRECTIONS
A.
LINGAS
AND
V.
SOLTAN
.
315
SESSION
8B
EFFICIENT
LIST
RANKING
ON
THE
RECONFIGURABLE
MESH,
WITH
APPLICATIONS
TATSUYA
HAYASHI,
KOJI
NAKANO
AND
STEPHAN
OLARIU
.
326
PERIODIC
MERGING
NETWORKS
MIROSLAW
KUTYLOWSKI,
KRZYSZTOF
LORYS
AND
BRIGITTE
OESTERDIEKHOFF
.
336
MINIMIZING
WAVELENGTHS
IN
AN
ALL-OPTICAL
RING
NETWORK
GORDON
WILFONG
.
346
SESSION
9A
COMPETITIVE
ANALYSIS
OF
ON-LINE
DISK
SCHEDULING
TZUOO-HAWN
YEH,
CHENG-MING
KUO,
CHIN-LAUNG
LEI,
AND
HSU-CHUN
YEN
.
356
SCHEDULING
INTERVAL
ORDERED
TASKS
WITH
NON-UNIFORM
DEADLINES
JACQUES
VERRIET
.
366
X
SESSION
9B
CRYPTOGRAPHIC
WEAKNESSES
IN
THE
ROUND
TRANSFORMATION
USED
IN
A
BLOCK
CIPHER
WITH
PROVABLE
IMMUNITY
AGAINST
LINEAR
CRYPTANALYSIS
KOUICHI
SAKURAI
AND
YULIANG
ZHENG
.
376
THE
MULTI-VARIABLE
MODULAR
POLYNOMIAL
AND
ITS
APPLICATIONS
TO
CRYPTOGRAPHY
TSUYOSHI
TAKAGI
AND
SHOZO
NAITO
.
386
SESSION
10A
BOUNDS
AND
ALGORITHMS
FOR
A
PRACTICAL
TASK
ALLOCATION
MODEL
TSAN-SHENG
HSU
AND
DIAN
RAE
LOPEZ
.
397
SCHEDULING
ALGORITHMS
FOR
STRICT
MULTITHREADED
COMPUTATIONS
PANAGIOTA
FATOUROU
AND
PAUL
SPIRAKIS
.
407
ON
MULTI-THREADED
PAGING
ESTEBAN
FEUERSTEIN
AND
ALEJANDRO
STREJILEVICH
DE
LOMA
.
417
SESSION
10B
A
FAST
AND
EFFICIENT
HOMOPHONIC
CODING
ALGORITHM
BORIS
RYABKO
AND
ANDREY
FIONOV
.
427
AN
IMPROVEMENT
OF
THE
DIGITAL
CASH
PROTOCOL
OF
OKAMOTO
AND
OHTA
OSAMU
WATANABE
AND
OSAMU
YAMASHITA
.
436
AUTHOR
INDEX
447 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV011068205 |
| 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 1996 SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)36311836 (DE-599)BVBBV011068205 |
| dewey-full | 001.64 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 001 - Knowledge |
| dewey-raw | 001.64 |
| dewey-search | 001.64 |
| dewey-sort | 11.64 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeines 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">BV011068205</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970513</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961113s1996 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">948916613</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540620486</subfield><subfield code="9">3-540-62048-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36311836</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011068205</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-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</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">001.64</subfield><subfield code="b">L497, v.1178</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 1996</subfield><subfield code="0">(DE-625)143433:</subfield><subfield code="2">rvk</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">68-06</subfield><subfield code="2">msc</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">7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings</subfield><subfield code="c">Tetsuo Asano ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 448 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">1178</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">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">Calculs numériques - Congrès</subfield><subfield code="2">ram</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">algorithme graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</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">ordonnancement</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">1996</subfield><subfield code="z">Osaka</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">Asano, Tetsuo</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">7</subfield><subfield code="d">1996</subfield><subfield code="c">Osaka</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2159826-5</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">1178</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1178</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=007413650&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1996 Osaka gnd-content |
| genre_facet | Konferenzschrift 1996 Osaka |
| id | DE-604.BV011068205 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T03:38:18Z |
| institution | BVB |
| institution_GND | (DE-588)2159826-5 |
| isbn | 3540620486 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007413650 |
| oclc_num | 36311836 |
| open_access_boolean | |
| owner | DE-384 DE-739 DE-91G DE-BY-TUM DE-29T DE-20 DE-19 DE-BY-UBM DE-634 DE-83 DE-706 |
| owner_facet | DE-384 DE-739 DE-91G DE-BY-TUM DE-29T DE-20 DE-19 DE-BY-UBM DE-634 DE-83 DE-706 |
| physical | X, 448 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings Tetsuo Asano ... (eds.) Berlin u.a. Springer 1996 X, 448 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1178 Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Calculs numériques - Congrès ram Calculs numériques - Informatique - Congrès algorithme graphe inriac complexité calcul inriac cryptographie inriac géométrie algorithmique inriac ordonnancement 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 1996 Osaka 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 Asano, Tetsuo Sonstige oth ISAAC 7 1996 Osaka Sonstige (DE-588)2159826-5 oth Lecture notes in computer science 1178 (DE-604)BV000000607 1178 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007413650&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings Lecture notes in computer science Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Calculs numériques - Congrès ram Calculs numériques - Informatique - Congrès algorithme graphe inriac complexité calcul inriac cryptographie inriac géométrie algorithmique inriac ordonnancement 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 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings |
| title_auth | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings |
| title_exact_search | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings |
| title_full | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings Tetsuo Asano ... (eds.) |
| title_fullStr | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings Tetsuo Asano ... (eds.) |
| title_full_unstemmed | Algorithms and computation 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings Tetsuo Asano ... (eds.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 7th international symposium isaac 96 osaka japan december 16 18 1996 proceedings |
| title_sub | 7th international symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 ; proceedings |
| topic | Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Calculs numériques - Congrès ram Calculs numériques - Informatique - Congrès algorithme graphe inriac complexité calcul inriac cryptographie inriac géométrie algorithmique inriac ordonnancement 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 Calculs numériques - Congrès Calculs numériques - Informatique - Congrès algorithme graphe complexité calcul cryptographie géométrie algorithmique ordonnancement Datenverarbeitung Computer algorithms Congresses Numerical calculations Data processing Congresses Berechnungstheorie Komplexitätstheorie Algorithmische Geometrie Algorithmus Konferenzschrift 1996 Osaka |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007413650&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT asanotetsuo algorithmsandcomputation7thinternationalsymposiumisaac96osakajapandecember16181996proceedings AT isaacosaka algorithmsandcomputation7thinternationalsymposiumisaac96osakajapandecember16181996proceedings |