STACS 94: 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings
Gespeichert in:
Körperschaft: | |
---|---|
Format: | Tagungsbericht Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
1994
|
Schriftenreihe: | Lecture notes in computer science
775 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIV, 782 S. graph. Darst. |
ISBN: | 3540577858 0387577858 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008858830 | ||
003 | DE-604 | ||
005 | 20140226 | ||
007 | t| | ||
008 | 940117s1994 gw d||| |||| 10||| eng d | ||
016 | 7 | |a 940161532 |2 DE-101 | |
020 | |a 3540577858 |9 3-540-57785-8 | ||
020 | |a 0387577858 |9 0-387-57785-8 | ||
035 | |a (OCoLC)265807686 | ||
035 | |a (DE-599)BVBBV008858830 | ||
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-20 |a DE-19 |a DE-706 |a DE-634 |a DE-11 |a DE-188 |a DE-83 | ||
084 | |a 68-06 |2 msc | ||
084 | |a DAT 500f |2 stub | ||
111 | 2 | |a STACS |n 11 |d 1994 |c Caen |j Verfasser |0 (DE-588)2134264-7 |4 aut | |
245 | 1 | 0 | |a STACS 94 |b 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings |c P. Enjalbert ... (ed.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 1994 | |
300 | |a XIV, 782 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 775 | |
650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1994 |z Caen |2 gnd-content | |
689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Enjalbert, Patrice |e Sonstige |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 775 |w (DE-604)BV000000607 |9 775 | |
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=005859000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005859000 |
Datensatz im Suchindex
_version_ | 1820874842008715264 |
---|---|
adam_text |
TABLE
OF
CONTENTS
INVITED
LECTURE
THE
NATURE
AND
MEANING
OF
PERTURBATIONS
IN
GEOMETRIC
COMPUTING
RAIMUND
SEIDEL
(UNIV.
CALIFORNIA,
BERKELEY,
USA)
3
LOGIC
ONE
BINARY
HOM
CLAUSE
IS
ENOUGH
PH.
DEVIENNE,
P.
LEBBGUE,
J-CH.
ROUTIER
(UNIV.
LILLE,
F),
J.
WURTZ
(DFKI,
D)
21
TRANSFORMING
CONSTRAINT
LOGIC
PROGRAMS
N.
BENSAOU,
I.
GUESSARIAN
(UNIV.
PARIS
VI,
F)
33
A
HIERARCHY
OF
TEMPORAL
LOGICS
WITH
PAST
F.
LAROUSSINIE,
PH.
SCHNOEBELEN
(LIFIA-IMAG,
GRENOBLE,
F)
47
THE
COMPLEXITY
OF
RESOURCE-BOUNDED
FIRST-ORDER
CLASSICAL
LOGIC
J.
GOUBAULT
(BULL
CORP.
RESEARCH
CENTRE,
CLAYES
SOUS
BOIS,
F)
59
TWO
PROOF
PROCEDURES
FOR
A
CARDINALITY
BASED
LANGUAGE
IN
PROPOSITIONAL
CALCULUS
B.
BENHAMOU,
L.
SAIS,
P.
SIEGEL
(UNIV.
PROVENCE,
F)
71
COMPLEXITY
CLASSES
THE
ALTERNATION
HIERARCHY
FOR
MACHINES
WITH
SUBLOGARITHMIC
SPACE
IS
INFINITE
B.
VON
BRAUNMIIHL,
R.
GENGLER,
R.
RETTINGER
(UNIV.
BONN,
D)
85
QUASILINEAR
TIME
COMPLEXITY
THEORY
A.V.
NAIK,
K.W.
REGAN,
D.
SIVAKUMAR
(STATE
UNIV.
NEW
YORK
AT
BUFFALO,
USA)
97
SPACE-EFFICIENT
DETERMINISTIC
SIMULATION
OF
PROBABILISTIC
AUTOMATA
LI.
MACARIE
(UNIV.
ROCHESTER,
USA)
109
REACHABILITY
AND
THE
POWER
OF
LOCAL
ORDERING
K.
ETESSAMI,
N,
IMMERMAN
(UNIV.
MASSACHUSETTS,
AMHERST,
USA)
123
ARE
PARALLEL
MACHINES
ALWAYS
FASTER
THAN
SEQUENTIAL
MACHINES
?
L.
MAK
(UNIV.
ILLINOIS
AT
URBANA-CHAMPAIGN,
USA)
137
X
TERM
REWRITING
AND
UNIFICATION
GROUND
REDUCIBILITY
AND
AUTOMATA
WITH
DISEQUALITY
CONSTRAINTS
H.
COMON,
F.
JACQUEMARD
(UNIV.
PARIS-SUD,
F)
151
PERPETUALITY
AND
STRONG
NORMALIZATION
IN
ORTHOGONAL
TERM
REWRITING
SYSTEMS
Z.
KHASIDASHVILI
(SCHOOL
OF
INFORMATION
SYSTEMS,
NORWICH,
UK)
163
ABOUT
CHANGING
THE
ORDERING
DURING
KNUTH-BENDIX
COMPLETION
A.
SATTLER-KLEIN
(UNIV.
KAISERSLAUTERN,
D)
175
COMBINATION
OF
MATCHING
ALGORITHMS
C.
RINGEISSEN
(CRIN-CNRS
&
INRIA-LORRAINE,
NANCY,
F)
187
PARALLEL
ALGORITHMS
1
PERIODIC
CONSTANT
DEPTH
SORTING
NETWORKS
M.
KIK,
M.
KUTYLOWSKI,
G.
STACHOWIAK
(UNIV.
WROCLAW,
PL)
201
OPTIMAL
PATTERN
MATCHING
ON
MESHES
B.S.
CHLEBUS,
L.
GASIENIEC
(UNIV.
WARSAW,
PL)
213
FASTER
SORTING
AND
ROUTING
ON
GRIDS
WITH
DIAGONALS
M.
KUNDE,
R.
NIEDERMEIER,
P.
ROSSMANITH
(TECHN.
UNIV.
MUNCHEN,
D)
225
DETERMINISTIC
1-K
ROUTING
ON
MESHES
J.F.
SIBEYN
(MAX-PLANCK
INST
FIIR
INFORMATIK,
SAARBRIICKEN,
D),
M.
KAUFMANN
(UNIV.
TUBINGEN,
D),
237
SEMANTICS
AND
SPECIFICATIONS
A
UNIFYING
TYPE-THEORETIC
FRAMEWORK
FOR
OBJECTS
M.
HOFMANN,
B.
PIERCE
(UNIV.
EDINBURGH,
UK)
251
OPERATIONAL
SPECIFICATIONS
WITH
BUILT-INS
J.
AVENHAUS,
K.
BECKER
(UNIV.
KAISERSLAUTERN,
D)
263
REACTIVE
VARIABLES
FOR
SYSTEM
SPECIFICATION
AND
DESIGN
E.P.
GRIBOMONT
(UNIV.
LI&GE,
B),
J.
HAGELSTEIN
(SEMA
GROUP
BELGIUM,
B)
275
COMPLEXITY:
NC
HIERARCHY
A
NEW
PARALLEL
VECTOR
MODEL,
WITH
EXACT
CHARACTERIZATIONS
OFNC^
K.W.
REGAN
(STATE
UNIV.
NEW
YORK
AT
BUFFALO,
USA)
289
XI
ON
ADAPTIVE
DIOGTIME
AND
POLYLOGTIME
REDUCTIONS
C.
ALVAREZ
(UNIV.
POLITIC.
CATALUNYA,
BARCELONA,
E),
B.
JENNER
(TECH.
UNIV.
MUNCHEN,
D)
301
NCK(NP)
=
ACK-L(NP),
M.
OGIWARA
(UNIV.
ROCHESTER,
USA)
313
INVITED
LECTURE
HYPERTRANSITION
SYSTEMS
ANDRD
ARNOLD
(UNIV.
BORDEAUX
I,
F)
327
FORMAL
LANGUAGES
ON
THE
STAR
OPERATION
AND
THE
FINITE
POWER
PROPERTY
IN
FREE
PARTIALLY
COMMUTATIVE
MONOIDS
Y.
MDTIVIER,
G.
RICHOMME
(UNIV.
BORDEAUX
I,
F)
341
CODING
WITH
TRACES
V.
BRUY&RE
(UNIV.
MONS-HAINAUT,
B),
C.
DE
FELICE
(UNIV.
SALEMO,
BARONISSI,
I),
G.
GUAIANA
(UNIV.
PARIS
VII,
F)
353
MONADIC
SECOND-ORDER
LOGIC
OVER
PICTURES
AND
RECOGNIZABILITY
BY
TILING
SYSTEMS
D.
GIAMMARRESI,
A.
RESTIVO
(UNIV.
PALERMO,
I),
S.
SEIBERT,
W.
THOMAS
(CHRISTIAN-ALBRECHTS
UNIV.
KIEL,
D)
365
Q-GRAMMARS:
RESULTS,
IMPLEMENTATION
M.
DELEST
(UNIV.
BORDEAUX
I,
F),
J-PH.
DUBEMARD
(UNIV.
POITIERS,
F)
377
A
TOPOLOGY
FOR
COMPLETE
SEMIRINGS
G.
KAMER
(ALCATEL
AUSTRIA,
WIEN,
A)
389
STRUCTURAL
COMPLEXITY
AND
RECURSIVITY
THE
GLOBAL
POWER
OF
ADDITIONAL
QUERIES
TO
RANDOM
ORACLES
R.V.
BOOK
(UNIV.
CALIFORNIA,
SANTA
BARBARA,
USA),
J.H.
LUTZ
(IOWA
STATE
UNIV.,
AMES,
USA),
D.M.
MARTIN
JR
(UNIV.
BOSTON,
USA)
403
COOK
VERSUS
KARP-LEVIN:
SEPARATING
COMPLETENESS
NOTIONS
IFNP
IS
NOT
SMALL
J.H.
LUTZ
(IOWA
STATE
UNIV.,
AMES,
USA),
E.
MAYORDOMO
(UNIV.
POLITIC.
CATALUNYA,
BARCELONA,
E)
415
ON
SETS
BOUNDED
TRUTH-TABLE
REDUCIBLE
TO
P-SELECTIVE
SETS
TH.
THIERAUF
(UNIV.
ULM,
D),
S.
TODA
(UNIV.
ELECTRO-COMMUNICATIONS,
J),
O.
WATANABE
(TOKYO
INST,
OF
TECHNOLOGY,
J)
427
XII
TWO
REFINEMENTS
OF
THE
POLYNOMIAL
HIERARCHY
V.L.
SELIVANOV
(INST,
OF
MATHEMATICS,
NOVOSIBIRSK,
RUSSIA)
439
ON
DIFFERENT
REDUCIBILITY
NOTIONS
FOR
FUNCTION
CLASSES
H.
VOLLMER
(UNIV.
WURZBURG,
D)
449
PARALLEL
ALGORITHMS
2
OPTIMAL
PARALLELIZATION
OF
LAS
VEGAS
ALGORITHMS
M.
LUBY,
W.
ERTEL
(INT.
COMPUTER.
SCIENCE
INST.,
BERKELEY,
USA)
463
EFFICIENT
PARALLEL
ALGORITHMS
FOR
GEOMETRIC
K-CLUSTERING
PROBLEMS
A.DATTA
(MAX
PLANCK
INST,
FUR
INFONMATIK,
SAARBRIICKEN,
D)
475
A
SIMPLE
OPTIMAL
PARALLEL
ALGORITHM
FOR
REPORTING
PATHS
IN
A
TREE
A.
MAHESHWARI
(TATA
INST.OF
FUNDAM.
RESEARCH,
BOMBAY,
IND),
A.LINGAS
(UNIV.
LUND,
S)
487
PARALLEL
DETECTION
OF
ALL
PALINDROMES
IN
A
STRING
A.
APOSTOLICO
(PURDUE
UNIV.,
USA
&
UNIV.
PADOVA,
I),
D.
BRESLAUER
(CNR,
PISA,
I),
Z.
GALIL
(UNIV.
TEL-AVIV,
IL
&
COLUMBIA
UNIV.
NEW
YORK,
USA)
497
COMPUTATIONAL
COMPLEXITY
ON
THE
STRUCTURE
OF
PARAMETERIZED
PROBLEMS
IN
NP
L.CAI,
J.CHEN
(TEXAS
A&M
UNIV,
USA),
R.DOWNEY
(UNIV.
VICTORIA
,
WELLINGTON,
NZ),
M.
FELLOWS
(UNIV.
VICTORIA,
CDN)
509
ON
THE
APPROXIMABILITY
OF
FINDING
MAXIMUM
FEASIBLE
SUBSYSTEMS
OF
LINEAR
SYSTEMS
E.
AMALDI
(SWISS
FEDERAL
INST,
OF
TECHNOLOGY.
LAUSANNE,
CH),
V.
KANN
(ROYAL
INST,
OF
TECHNOLOGY,
STOCKHOLM,
S)
521
ON
THE
ACCEPTANCE
POWER
OF
REGULAR
LANGUAGES
B.
BORCHERT
(UNIV.
HEIDELBERG,
D)
533
COMPLEXITY
CLASSES
WITH
FINITE
ACCEPTANCE
TYPES
U.
HERTRAMPF
(UNIV.
WURZBURG,
D)
543
THEORY
OF
PARALLEL
COMPUTATION
THE
COMPLETE
AXIOMATIZATION
OF
CS-CONGRUENCE
J.
PARROW
(SWEDISH
INST.
COMPUTER
SC.
&
ROYAL
INST.
TECHNOLOGY,
STOCKOLM
&
UNIV.
UPPSALA,
S),
P.
SJODIN
(SWEDISH
INST.COMPUTER
SC.
&
ROYAL
INST.
TECHNOLOGY,
S)
557
XIII
TRANSITION
SYSTEM
SPECIFICATIONS
IN
STALK
FORMAT
WITH BISIMULATION
AS
A
CONGRUENCE
V.
VAN
OOSTROM,
E.P.
DE
VINK
(VRIJE
UNIV.
AMSTERDAM,
NL)
569
DECIDABILITY
QUESTIONS
FOR
BISIMILARITY
OF
PETRI
NETS
AND
SOME
RELATED
PROBLEMS
P.
JANCAR
(UNIV.
OSTRAVA,
CZ)
581
FORMAL
LANGUAGES
AND
COMPLEXITY
THE
VARIABLE
MEMBERSHIP
PROBLEM:
SUCCINCTNESS
VERSUS
COMPLEXITY
G.
BUNTROCK
(UNIV.
WURZBURG,
D),
K.
LORYS
(UNIV.
WROCLAWSKI,
PL)
595
ECONOMY
OF
DESCRIPTION
FOR
SINGLE-VALUED
TRANSDUCERS
A.
WEBER,
R.
KLEMM
(GOETHE
UNIV.
FRANKFURT
AM
MAIN,
D)
607
AUTOMATICITY:
PROPERTIES
OF
A
MEASURE
OF
DESCRIPTIONAL
COMPLEXITY
J.
SHALLIT
(UNIV.
WATERLOO,
CDN),
Y.
BREITBART
(UNIV.
KENTUCKY,
USA)
619
INVITED
LECTURE
TOWARDS
A
THEORY
OF
RECURSIVE
STRUCTURES
DAVID
HAREL
(WEIZMANN
INSTITUTE
OF
SCIENCE,
REHOVOT,
ISRAEL)
633
STRINGS,
CODES,
COMBINATORICS
FINDING
MINIMAL
GENERALIZATIONS
FOR
UNIONS
OF
PATTERN
LANGUAGES
AND
ITS
APPLICATION
TO
INDUCTIVE
INFERENCE
FROM
POSITIVE
DATA
H.
ARIMURA
T.
SHINOHARA,
S.
OTSUKI
(KYUSHU
INST,
OF
TECHNOLOGY,
IIZUKA,
J)
649
NONDETERMINISM
IN
PATTERNS
A.
MATEESCU,
A.
SALOMAA
(UNIV.
TURKU,
SF)
661
UPPER
BOUNDS
FOR
THE
EXPECTED
LENGTH
OF
A
LONGEST
COMMON
SUBSEQUENCE
OF
TWO
BINARY
SEQUENCES
V.
DANCIK,
M.
PATERSON
(UNIV.
WARWICK,
COVENTRY,
UK)
669
THE
AMBIGUITY
OF
PRIMITIVE
WORDS
H.
PETERSEN
(UNIV.
HAMBURG,
D)
679
ON
CODES
HAVING
NO
FINITE
COMPLETION
N.
H.
LAM
(HANOI
INST,
OF
MATHEMATICS,
VIETNAM)
691
A
NEW
APPROACH
TO
INFORMATION
THEORY
R.J.
LIPTON
(UNIV.
PRINCETON,
USA)
699
XIV
EFFICIENT
ALGORITHMS
ON
VORONOI
DIAGRAMS
IN
THE
LP-METRIC
IN
HIGHER
DIMENSIONS
N.-M.
LE
(FEM
UNIV.
HAGEN,
D)
711
TOTAL
PROTECTION
OF
ANALYTIC
INVARIANT
INFORMATION
IN
CROSS
TABULATED
TABLES
M.-Y.
KAO
(DUKE
UNIV.,
DURHAM,
USA)
723
DOMINATING
CLIQUES
IN
GRAPHS
WITH
HYPERTREE
STRUCTURE
F.F.
DRAGAN
(MOLDAVIAN
STATE
UNIV.,CHISINAU,
MOLDOVA),
A.BRANDSTADT
(UNIV.
DUISBURG,
D)
735
ON
VERTEX
RANKING
FOR
PERMUTATION
AND
OTHER
GRAPHS
J.S.DEOGUN
(UNIV.
NEBRASKA,
LINCOLN
,
USA),
T.KLOKS
(UNIV.
TECHN.
EINDHOVEN,
NL),
D.KRATSCH,
H.MIILLER
(FRIEDRICH-SCHILLER-UNIV.,
JENA,
D)
747
FINDING
ALL
MINIMAL
SEPARATORS
OF
A
GRAPH
T.KLOKS
(UNIV.
TECHN.
EINDHOVEN,
NL),
D.
KRATSCH
(FRIEDRICH-SCHILLER-UNIV.,
JENA,
D)
759
ON
THE
COMPLEXITY
OF
THE
MAXIMUM
CUT
PROBLEM
H.L.
BODLAENDER
(UNIV.
UTRECHT,
NL),
K.
JANSEN
(UNIV.
DUISBURG,
D)
769
INDEX
OF
AUTHORS
781 |
any_adam_object | 1 |
author_corporate | STACS Caen |
author_corporate_role | aut |
author_facet | STACS Caen |
author_sort | STACS Caen |
building | Verbundindex |
bvnumber | BV008858830 |
classification_rvk | SS 4800 |
classification_tum | DAT 500f |
ctrlnum | (OCoLC)265807686 (DE-599)BVBBV008858830 |
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">BV008858830</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140226</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940117s1994 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">940161532</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540577858</subfield><subfield code="9">3-540-57785-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387577858</subfield><subfield code="9">0-387-57785-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)265807686</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008858830</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-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-83</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 500f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">STACS</subfield><subfield code="n">11</subfield><subfield code="d">1994</subfield><subfield code="c">Caen</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)2134264-7</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">STACS 94</subfield><subfield code="b">11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings</subfield><subfield code="c">P. Enjalbert ... (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 782 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">775</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1994</subfield><subfield code="z">Caen</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Enjalbert, Patrice</subfield><subfield code="e">Sonstige</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">775</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">775</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=005859000&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-005859000</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 1994 Caen gnd-content |
genre_facet | Konferenzschrift 1994 Caen |
id | DE-604.BV008858830 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:06:09Z |
institution | BVB |
institution_GND | (DE-588)2134264-7 |
isbn | 3540577858 0387577858 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005859000 |
oclc_num | 265807686 |
open_access_boolean | |
owner | DE-384 DE-739 DE-91G DE-BY-TUM DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-11 DE-188 DE-83 |
owner_facet | DE-384 DE-739 DE-91G DE-BY-TUM DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-11 DE-188 DE-83 |
physical | XIV, 782 S. graph. Darst. |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | STACS 11 1994 Caen Verfasser (DE-588)2134264-7 aut STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings P. Enjalbert ... (ed.) Berlin [u.a.] Springer 1994 XIV, 782 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 775 Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1994 Caen gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Enjalbert, Patrice Sonstige oth Lecture notes in computer science 775 (DE-604)BV000000607 775 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005859000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings Lecture notes in computer science Theoretische Informatik (DE-588)4196735-5 gnd |
subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
title | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings |
title_auth | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings |
title_exact_search | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings |
title_full | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings P. Enjalbert ... (ed.) |
title_fullStr | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings P. Enjalbert ... (ed.) |
title_full_unstemmed | STACS 94 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings P. Enjalbert ... (ed.) |
title_short | STACS 94 |
title_sort | stacs 94 11th annual symposium on theoretical aspects of computer science caen france february 24 26 1994 proceedings |
title_sub | 11th annual Symposium on Theoretical Aspects of Computer Science, Caen, France, february 24 - 26, 1994 ; proceedings |
topic | Theoretische Informatik (DE-588)4196735-5 gnd |
topic_facet | Theoretische Informatik Konferenzschrift 1994 Caen |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005859000&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT stacscaen stacs9411thannualsymposiumontheoreticalaspectsofcomputersciencecaenfrancefebruary24261994proceedings AT enjalbertpatrice stacs9411thannualsymposiumontheoreticalaspectsofcomputersciencecaenfrancefebruary24261994proceedings |