|
|
|
|
LEADER |
01460nam a2200337 a 4500 |
001 |
c000161608 |
003 |
CARM |
005 |
19990922000000.0 |
008 |
900410s1990 gw a b 101 0 eng |
010 |
|
|
|a 90009771
|
019 |
1 |
|
|a 7270076
|5 LACONCORD2021
|
020 |
|
|
|a 3540525904
|b (Berlin : acid-free paper)
|
020 |
|
|
|a 0387525904
|b (New York : acid-free paper)
|
035 |
|
|
|a (OCoLC)21444823
|5 LACONCORD2021
|
040 |
|
|
|a DLC
|b eng
|c DLC
|d DLC
|d LC
|
050 |
0 |
0 |
|a QA166.2
|b .C65 1990
|
082 |
0 |
0 |
|a 511/.5
|2 20
|
082 |
0 |
4 |
|a 511/.5
|2 20
|
111 |
2 |
|
|a Colloquium on Trees in Algebra and Programming
|n (15th :,
|d 1990 :
|c Copenhagen, Denmark)
|
245 |
1 |
0 |
|a CAAP '90 :
|b 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings /
|c A. Arnold (ed.)
|
260 |
|
|
|a Berlin ;
|a New York :
|b Springer-Verlag,
|c c1990.
|
300 |
|
|
|a vi, 284 p. :
|b ill. ;
|c 25 cm.
|
440 |
|
0 |
|a Lecture notes in computer science ;
|v 431.
|
504 |
|
|
|a Includes bibliographical references and index.
|
650 |
|
0 |
|a Trees (Graph theory)
|x Data processing
|x Congresses.
|
650 |
|
0 |
|a Data structure (Computer science)
|x Congresses.
|
650 |
|
0 |
|a Computational complexity
|x Congresses.
|
700 |
1 |
|
|a Arnold, A.
|q (André),
|d 1945-
|
852 |
8 |
|
|b CARM
|h A2:AL17F0
|i C05337
|p 0213208
|f BK
|
999 |
f |
f |
|i ea9c239e-6974-5ed1-90b6-555b57c68e64
|s a9847473-306b-50f0-9c97-3634601e8d5c
|
952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e C05337
|f A2:AL17F0
|h Other scheme
|i book
|m 0213208
|