机读格式显示(MARC)

• 000 01431nam2 2200361 4500

• 000 1000007963

• 001 0000164252

• 005 20050126105450.0

• 008 011017s1992 gw a b 100 0 eng

• 010 __ |a 92005964

• 020 __ |a 3540552510 (Berlin : acid-free paper) |c CNY25.50

• 020 __ |a 0387552510 (New York : acid-free paper)

• 040 __ |a DLC |c XAIT

• 050 00 |a QA166.2 |b .C65 1992

• 082 00 |a 511/.5 |2 20

• 090 __ |a TP311-53/E3:17TH(92)

• 093 __ |a TP311.1-53 |2 4

• 099 __ |a CAL 022000225027

• 111 2_ |a Colloquium on Trees in Algebra and Programming |n (17th : |d 1992 : |c Rennes, France)

• 245 10 |a CAAP '92 : |b 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, proceedings / |c J.-C. Raoult, ed.

• 260 __ |a Berlin ; |a New York : |b Springer-Verlag, |c 1992.

• 300 __ |a viii, 361 p. : |b ill. ; |c 25 cm.

• 440 _0 |a Lecture notes in computer science ; |v 581

• 504 __ |a Includes bibliographical references.

• 650 _0 |a Data structures (Computer science) |v Congresses.

• 650 _0 |a Computational complexity |v Congresses.

• 650 _0 |a Trees (Graph theory) |x Data processing |v Congresses.

• 700 1_ |a Raoult, J.-C. |q (Jean-Claude)

• 905 __ |a XATU |d TP311-53/E3:17TH(92)

• 920 __ |a 261060 |z 1

• 950 __ |a 261060 |f TP311-53/E3:17th(92)

• 991 __022005003898

• 999 __ |t C |A zhaining |a 20050126 10:53:36 |M zhaining |m 20050126 10:54:50 |G zhaining |g 20050126 10:55:1