Automata, languages and programming: 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1996
|
| Schriftenreihe: | Lecture notes in computer science
1099 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 680 S. graph. Darst. |
| ISBN: | 3540614400 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010804008 | ||
| 003 | DE-604 | ||
| 005 | 19960829 | ||
| 007 | t| | ||
| 008 | 960610s1996 gw d||| |||| 10||| eng d | ||
| 016 | 7 | |a 947666559 |2 DE-101 | |
| 020 | |a 3540614400 |9 3-540-61440-0 | ||
| 035 | |a (OCoLC)35188623 | ||
| 035 | |a (DE-599)BVBBV010804008 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-20 |a DE-19 |a DE-634 |a DE-83 |a DE-706 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 001.64 |b L497, v.1099 |2 21 | |
| 084 | |a DAT 550f |2 stub | ||
| 084 | |a 68-06 |2 msc | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Automata, languages and programming |b 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings |c F. Meyer auf der Heide ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1996 | |
| 300 | |a XII, 680 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 1099 | |
| 650 | 7 | |a Abstracte automaten |2 gtt | |
| 650 | 4 | |a Automates mathématiques, Théorie des - Congrès | |
| 650 | 7 | |a Automates mathématiques, Théorie des - Congrès |2 ram | |
| 650 | 4 | |a Langages formels - Congrès | |
| 650 | 7 | |a Langages formels - Congrès |2 ram | |
| 650 | 7 | |a Ordinateurs - Programmation - Congrès |2 ram | |
| 650 | 4 | |a Programmation (Informatique) - Congrès | |
| 650 | 7 | |a Programmeertalen |2 gtt | |
| 650 | 7 | |a algorithme |2 inriac | |
| 650 | 7 | |a appariement |2 inriac | |
| 650 | 7 | |a apprentissage |2 inriac | |
| 650 | 7 | |a automate |2 inriac | |
| 650 | 7 | |a codage |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a concurrence |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a logique |2 inriac | |
| 650 | 7 | |a protocole communication |2 inriac | |
| 650 | 7 | |a robotique |2 inriac | |
| 650 | 7 | |a réécriture |2 inriac | |
| 650 | 7 | |a structure donnée |2 inriac | |
| 650 | 7 | |a sémantique |2 inriac | |
| 650 | 7 | |a vérification |2 inriac | |
| 650 | 4 | |a Computer programming |v Congresses | |
| 650 | 4 | |a Formal languages |v Congresses | |
| 650 | 4 | |a Machine theory |v Congresses | |
| 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 1996 |z Paderborn |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Meyer auf der Heide, Friedhelm |d 1954- |e Sonstige |0 (DE-588)110026063 |4 oth | |
| 711 | 2 | |a ICALP |n 23 |d 1996 |c Paderborn |j Sonstige |0 (DE-588)2156446-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1099 |w (DE-604)BV000000607 |9 1099 | |
| 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=007217727&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007217727 | |
Datensatz im Suchindex
| _version_ | 1820868178063917056 |
|---|---|
| adam_text |
TABLE
OF
CONTENTS
INVITED
PAPERS
SATURATION-BASED
THEOREM
PROVING
H.
GANZINGER
.
1
BANDWIDTH
EFFICIENT
PARALLEL
COMPUTATION
A.
RANADE
.
4
VARIABLE-LENGTH
MAXIMAL
CODES
V.
BRUYERE,
M.
LATTEUX
.
24
LOWER
BOUNDS
FOR
PROPOSITIONAL
PROOFS
AND
INDEPENDENCE
RESULTS
IN
BOUNDED
ARITHMETIC
A.
A.
RAZBOROV
.
48
SESSION
1:
PROCESS
THEORY
I
ALGEBRAIC
CHARACTERIZATIONS
OF
DECORATED
TRACE
EQUIVALENCES
OVER
TREE
LIKE
STRUCTURES
X.
J.
CHEN,
R.
DE
NICOLA
.
63
FAST
ASYNCHRONOUS
SYSTEMS
IN
DENSE
TIME
L.
JENNER,
W.
VOGLER
.
75
SESSION
2:
FAIRNESS,
DOMINATION,
AND
THE
/X-CALCULUS
A
HIERARCHY
THEOREM
FOR
THE
/Z-CALCULUS
G.
LENZI
.
87
AN
EFFECTIVE
TABLEAU
SYSTEM
FOR
THE
LINEAR
TIME
/Z-CALCULUS
J.
BRADFIELD,
J.
ESPARZA,
A.
MADER
.
98
CHARACTERIZING
FAIRNESS
IMPLEMENTABILITY
FOR
MULTIPARTY
INTERACTION
Y.-J.
JOUNG
.
110
TERMINATION
OF
CONTEXT-SENSITIVE
REWRITING
BY
REWRITING
S.
LUCAS
.
122
SESSION
3:
LOGIC
AND
ALGEBRA
A
COMPLETE
GENTZEN-STYLE
AXIOMATIZATION
FOR
SET
CONSTRAINTS
A.
CHENG,
D.
KOZEN
.
134
FATAL
ERRORS
IN
CONDITIONAL
EXPRESSIONS
M.
BILLAUD
.
146
DIFFERENT
TYPES
OF
ARROW
BETWEEN
LOGICAL
FRAMEWORKS
T.
MOSSAKOWSKI
.
158
EFFECTIVE
MODELS
OF
POLYMORPHISM,
SUBTYPING
AND
RECURSION
J.
MITCHELL,
R.
VISWANATHAN
.
170
X
SESSION
4:
LANGUAGES
AND
PROCESSES
REGULARITY
FOR
A
LARGE
CLASS
OF
CONTEXT-FREE
PROCESSES
IS
DECIDABLE
D.
J.
B.
BOSSCHER,
W.
0.
D.
GRIFFIOEN
.
182
ON
INFINITE
TRANSITION
GRAPHS
HAVING
A
DECIDABLE
MONADIC
THEORY
D.
CAUCAL
.
194
SEMI-GROUPS
ACTING
ON
CONTEXT-FREE
GRAPHS
G.
SENIZERGUES
.
206
HARD
SETS
METHOD
AND
SEMILINEAR
RESERVOIR
METHOD
WITH
APPLICATIONS
L.
P.
LISOVIK
.
219
SESSION
5:
ALGEBRAIC
COMPLEXITY
RANDOM
POLYNOMIALS
AND
POLYNOMIAL
FACTORIZATION
P.
FLAJOLET,
X.
GOURDON,
D.
PANARIO
.
232
OPTIMAL
GROBNER
BASE
ALGORITHMS
FOR
BINOMIAL
IDEALS
U.
KOPPENHAGEN,
E.
W.
MAYR
.
244
SESSION
6:
GRAPH
ALGORITHMS
MINIMUM
FILL-IN
ON
CIRCLE
AND
CIRCULAR-ARC
GRAPHS
T.
KLOKS,
D.
KRATSCH,
C.
K.
WONG
.
256
PRACTICAL
APPROXIMATION
SCHEMES
FOR
MAXIMUM
INDUCED-SUBGRAPH
PROBLEMS
ON
A^-FREE
OR
A^-FREE
GRAPHS
Z.-Z.
CHEN
.
.
.
268
SEARCHING
A
FIXED
GRAPH
E.
KOUTSOUPIAS,
C.
PAPADIMITRIOU,
M.
YANNAKAKIS
.
280
IMPROVED
SAMPLING
WITH
APPLICATIONS
TO
DYNAMIC
GRAPH
ALGORITHMS
M.
RAUCH
HENZINGER,
M.
THORUP
.
290
SESSION
7:
AUTOMATA
THE
EXPRESSIVE
POWER
OF
EXISTENTIAL
FIRST
ORDER
SENTENCES
OF
EIICHI
'
S
SEQUENTIAL
CALCULUS
J.-E.
PIN
.
300
FIXPOINTS
FOR
RABIN
TREE
AUTOMATA
MAKE
COMPLEMENTATION
EASY
R.
KAIVOLA
.
312
NEW
UPPER
BOUNDS
TO
THE
LIMITEDNESS
OF
DISTANCE
AUTOMATA
K.
HASHIGUCHI
.
324
RECOGNIZING
REGULAR
EXPRESSIONS
BY
MEANS
OF
DATAFLOW
NETWORKS
P.
RAYMOND
.
336
SESSION
8:
COMPLEXITY
THEORY
ON
THE
POWER
OF
RANDOMIZED
BRANCHING
PROGRAMS
F.
ABLAYEV,
M.
KARPINSKI
.
348
XI
HITTING
SETS
DERANDOMIZE
BPP
A.
E.
ANDREEV,
A.
E.
F.
CLEMENTI,
J.
D.
P.
ROLIM
.
357
ON
TYPE-2
PROBABILISTIC
QUANTIFIERS
R.
BOOK,
H.
VOLLMER,
K.
WAGNER
.
369
SPEEDING-UP
SINGLE-TAPE
NONDETERMINISTIC
COMPUTATIONS
BY
SINGLE
ALTERNATION,
WITH
SEPARATION
RESULTS
J.
WIEDERMANN
.
381
SESSION
9:
COMBINATORICS
ON
WORDS
ON
W-GENERATORS
AND
CODES
S.
JULIA
.
393
ON
STANDARD
STURMIAN
MORPHISMS
A.
DE
LUCA
.
403
SESSION
10:
ALGORITHMS
I
CONSTRUCTIONS
AND
BOUNDS
FOR
VISUAL
CRYPTOGRAPHY
G.
ATENIESE,
C.
BIUNDO,
A.
DE
SANTIS,
D.
R.
STINSON
.
416
ON
CAPITAL
INVESTMENT
Y.
AZAR,
Y.
BARTAL,
E.
FEUERSTEIN,
A.
FIAT,
S.
LEONARDI,
A.
ROSEN
.
.
429
SESSION
11:
LOWER
BOUNDS
LOWER
BOUNDS
FOR
STATIC
DICTIONARIES
ON
RAMS
WITH
BIT
OPERATIONS
BUT
NO
MULTIPLICATION
P.
B.
MILTER
SEN
.
442
LOWER
BOUNDS
FOR
ROW
MINIMA
SEARCHING
P.
G.
BRADFORD,
K.
REINERT
.
454
SESSION
12:
PROCESS
THEORY
II
ON
THE
COMPLEXITY
OF
RELATIONAL
PROBLEMS
FOR
FINITE
STATE
PROCESSES
S.
K.
SHUKLA,
H.
B.
HUNT
III,
D.
J.
ROSENKRANTZ,
R.
E.
STEAMS
.
466
DECIDING
FINITENESS
OF
PETRI
NETS
UP
TO
BISIMULATION
P.
JANCAR,
J.
ESPARZA
.
478
MOBILE
PROCESSES
WITH
A
DISTRIBUTED
ENVIRONMENT
C.
BODEI,
P.
DEGANO,
C.
PRIAMI
.
490
THE
MEANING
OF
NEGATIVE
PREMISES
IN
TRANSITION
SYSTEM
SPECIFICATIONS
II
R.
J.
VAN
GLABBEEK
.
502
SESSION
13:
DATA
STRUCTURES
AVERAGE
CASE
ANALYSES
OF
LIST
UPDATE
ALGORITHMS,
WITH
APPLICATIONS
TO
DATA
COMPRESSION
S.
ALBERS,
M.
MITZENMACHER
.
514
XII
SELF-ORGANIZING
DATA
STRUCTURES
WITH
DEPENDENT
ACCESSES
F.
SCHULZ,
E.
SCHOMER
.
526
LOPSIDED
TREES:
ANALYSES,
ALGORITHMS,
AND
APPLICATIONS
V.
S.-N.
CHOI,
M.
GOLIN
.
538
OPTIMAL
LOGARITHMIC
TIME
RANDOMIZED
SUFFIX
TREE
CONSTRUCTION
M.
FARACH,
S.
MUTHUKRISHNAN
.
550
SESSION
14:
PARALLEL
ALGORITHMS
IMPROVED
PARALLEL
APPROXIMATION
OF
A
CLASS
OF
INTEGER
PROGRAMMING
PROBLEMS
N.
ALON,
A.
SRINIVASAN
.
562
EFFICIENT
COLLECTIVE
COMMUNICATION
IN
OPTICAL
NETWORKS
J.-C.
BERMOND,
L.
GARGANO,
S.
PERENNES,
A.
A.
RESCIGNO,
U.
VACCARO
574
SHARED-MEMORY
SIMULATIONS
ON
A
FAULTY-MEMORY
DMM
YY
B.
S.
CHLEBUS,
A.
GAMBIN,
P.
INDYK
.
586
FAST
DETERMINISTIC
BACKTRACK
SEARCH
K.
T.
HERLEY,
A.
PIETRACAPRINA,
G.
PUCCI
.
598
SESSION
15:
DISTRIBUTED
SYSTEMS
AGENT
RENDEZVOUS:
A
DYNAMIC
SYMMETRY-BREAKING
PROBLEM
X.
YU,
M.
YUNG
.
610
EFFICIENT
ASYNCHRONOUS
CONSENSUS
WITH
THE
VALUE-OBLIVIOUS
ADVERSARY
SCHEDULER
Y.
AUMANN,
M.
A.
BENDER
.
622
SESSION
16:
ALGORITHMS
II
A
FORMAL
FRAMEWORK
FOR
EVALUATING
HEURISTIC
PROGRAMS
L.
COWEN,
J.
FEIGENBAUM,
S.
KANNAN
.
634
IMPROVED
SCHEDULING
ALGORITHMS
FOR
MINSUM
CRITERIA
S.
CHAKRABARTI,
C.
A.
PHILLIPS,
A.
S.
SCHULZ,
D.
B.
SHMOYS,
C.
STEIN,
J.
WEIN
.
646
ON
THE
COMPLEXITY
OF
STRING
FOLDING
M.
PATERSON,
T.
PRZYTYCKA
.
658
A
POLYNOMIAL-TIME
ALGORITHM
FOR
NEAR-PERFECT
PHYLOGENY
D.
FERNANDEZ-BACA,
J.
LAGERGREN
.
670
AUTHOR
INDEX
.
681 |
| any_adam_object | 1 |
| author_GND | (DE-588)110026063 |
| building | Verbundindex |
| bvnumber | BV010804008 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 1996 SS 4800 |
| classification_tum | DAT 550f |
| ctrlnum | (OCoLC)35188623 (DE-599)BVBBV010804008 |
| 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">BV010804008</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960829</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960610s1996 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947666559</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540614400</subfield><subfield code="9">3-540-61440-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35188623</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010804008</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</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">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.64</subfield><subfield code="b">L497, v.1099</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 550f</subfield><subfield code="2">stub</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">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata, languages and programming</subfield><subfield code="b">23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings</subfield><subfield code="c">F. Meyer auf der Heide ... (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">XII, 680 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">1099</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Abstracte automaten</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Langages formels - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Langages formels - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ordinateurs - Programmation - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmeertalen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">appariement</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">apprentissage</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">codage</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">concurrence</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">logique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">protocole communication</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">robotique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réécriture</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">sémantique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">vérification</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield><subfield code="v">Congresses</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">1996</subfield><subfield code="z">Paderborn</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">Meyer auf der Heide, Friedhelm</subfield><subfield code="d">1954-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)110026063</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ICALP</subfield><subfield code="n">23</subfield><subfield code="d">1996</subfield><subfield code="c">Paderborn</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2156446-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">1099</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1099</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=007217727&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-007217727</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1996 Paderborn gnd-content |
| genre_facet | Konferenzschrift 1996 Paderborn |
| id | DE-604.BV010804008 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:20:14Z |
| institution | BVB |
| institution_GND | (DE-588)2156446-2 |
| isbn | 3540614400 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007217727 |
| oclc_num | 35188623 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-19 DE-BY-UBM DE-634 DE-83 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-19 DE-BY-UBM DE-634 DE-83 DE-706 |
| physical | XII, 680 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 | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings F. Meyer auf der Heide ... (eds.) Berlin [u.a.] Springer 1996 XII, 680 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1099 Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Langages formels - Congrès Langages formels - Congrès ram Ordinateurs - Programmation - Congrès ram Programmation (Informatique) - Congrès Programmeertalen gtt algorithme inriac appariement inriac apprentissage inriac automate inriac codage inriac complexité calcul inriac concurrence inriac langage formel inriac logique inriac protocole communication inriac robotique inriac réécriture inriac structure donnée inriac sémantique inriac vérification inriac Computer programming Congresses Formal languages Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1996 Paderborn gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Meyer auf der Heide, Friedhelm 1954- Sonstige (DE-588)110026063 oth ICALP 23 1996 Paderborn Sonstige (DE-588)2156446-2 oth Lecture notes in computer science 1099 (DE-604)BV000000607 1099 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007217727&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings Lecture notes in computer science Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Langages formels - Congrès Langages formels - Congrès ram Ordinateurs - Programmation - Congrès ram Programmation (Informatique) - Congrès Programmeertalen gtt algorithme inriac appariement inriac apprentissage inriac automate inriac codage inriac complexité calcul inriac concurrence inriac langage formel inriac logique inriac protocole communication inriac robotique inriac réécriture inriac structure donnée inriac sémantique inriac vérification inriac Computer programming Congresses Formal languages Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
| title | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings |
| title_auth | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings |
| title_exact_search | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings |
| title_full | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings F. Meyer auf der Heide ... (eds.) |
| title_fullStr | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings F. Meyer auf der Heide ... (eds.) |
| title_full_unstemmed | Automata, languages and programming 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings F. Meyer auf der Heide ... (eds.) |
| title_short | Automata, languages and programming |
| title_sort | automata languages and programming 23rd international colloquium icalp 96 paderborn germany july 8 12 1996 proceedings |
| title_sub | 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 - 12, 1996 ; proceedings |
| topic | Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Langages formels - Congrès Langages formels - Congrès ram Ordinateurs - Programmation - Congrès ram Programmation (Informatique) - Congrès Programmeertalen gtt algorithme inriac appariement inriac apprentissage inriac automate inriac codage inriac complexité calcul inriac concurrence inriac langage formel inriac logique inriac protocole communication inriac robotique inriac réécriture inriac structure donnée inriac sémantique inriac vérification inriac Computer programming Congresses Formal languages Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Abstracte automaten Automates mathématiques, Théorie des - Congrès Langages formels - Congrès Ordinateurs - Programmation - Congrès Programmation (Informatique) - Congrès Programmeertalen algorithme appariement apprentissage automate codage complexité calcul concurrence langage formel logique protocole communication robotique réécriture structure donnée sémantique vérification Computer programming Congresses Formal languages Congresses Machine theory Congresses Theoretische Informatik Konferenzschrift 1996 Paderborn |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007217727&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT meyeraufderheidefriedhelm automatalanguagesandprogramming23rdinternationalcolloquiumicalp96paderborngermanyjuly8121996proceedings AT icalppaderborn automatalanguagesandprogramming23rdinternationalcolloquiumicalp96paderborngermanyjuly8121996proceedings |