6. AAECC 1988: Rome, Italy
Teo Mora (Ed.):
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings.
Lecture Notes in Computer Science 357 Springer 1989, ISBN 3-540-51083-4 
Invited Contributions
Full Papers
- Maria Emilia Alonso, I. Luengo-Velasco, Mario Raimondo:
An Algorithm on Quasi-Ordinary Polynomials.
59-73
- Jean-Pierre Barbot:
A Computer-Aided Design for Sampling a Non-Linear Analytic System.
74-88
- Martin Bossert:
Decoding of Generalized Concatenated Codes.
89-98
- Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry.
99-110
- Marco Bucci, Adina di Porto:
Fast Serial-Parallel Multipliers.
111-121
- Johannes Buchmann, Michael Pohst:
On the Complexity of Computing Class Groups of Algebraic Number Fields.
122-130
- Leandro Caniglia, André Galligo, Joos Heintz:
Some New Effectivity Bounds in Computational Geometry.
131-151
- Giuseppa Carrà Ferro:
Some Remarks on the Differential Dimension.
152-163
- Guy Castagnoli:
On the Asymptotic Badness of Cyclic Codes with Block-Lengths Composed from a Fixed Set of Prime Factors.
164-168
- Attilio Colagrossi, Carla Limongelli:
Big Numbers p-adic Arithmetic: A Parallel Approach.
169-180
- Vesselin Drensky, Piroska Lakatos:
Monomial Ideals, Group Algebras and Error Correcting Codes.
181-188
- Ricardo Ferré:
Fast Integer Multiplication by Block Recursive, Number Theoretical Transforms.
189-200
- Philippe Flajolet, Bruno Salvy, Paul Zimmermann:
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.
201-212
- Tatiana Gateva-Ivanova:
Global Dimension of Associative Algebras.
213-229
- Willi Geiselmann, Dieter Gollmann:
Symmetry and Duality in Normal Basis Multiplication.
230-238
- Werner Henkel:
Multiple Error Correction with Analog Codes.
239-249
- Harry B. Hunt III, Richard Edwin Stearns:
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report).
250-258
- Alessandro Logar:
A Computational Proof of the Noether Normalization Lemma.
259-273
- Jed Marti:
A Graphics Interface to REDUCE.
274-296
- Edoardo D. Mastrovito:
VLSI Designs for Multiplication over Finite Fields GF (2m).
297-309
- Preda Mihailescu:
A Primality Test Using Cyclotomic Extensions.
310-323
- N. M. Nikityuk:
The Method of Syndrome Coding and its Application for Data Compression and Processing in High Energy Physics Experiments.
324-335
- G. M. Piacentini Cattaneo:
Nonassociative Degree Five Identities not Implied by Commutativity: a Computer Approach.
336-340
- Josep Rifà, Josep M. Basart, Llorenç Huguet i Rotger:
On Completely Regular Propelinear Codes.
341-355
- Shojiro Sakata:
N-Dimensional Berlekamp-Massey Algorithm for Multiple Arrays and Construction of Multivariate Polynomials with Preassigned Zeros.
356-376
- Juriaan Simonis:
Covering Radius: Improving on the Sphere-Covering Bound.
377-385
- William Y. Sit:
On Goldman's Algorithm for Solving First-Order Multinomial Autonomous Systems.
386-395
- Patrick Solé, Arif Ghafoor:
A Covering Problem in the Odd Graphs.
396-406
- Walter Spangher:
On the Computation of Hilbert-Samuel Series and Multiplicity.
407-414
- Jacobo Torán:
Succinct Representations of Counting Problems.
415-426
- Philippe Toffin, Marc Girault, Brigitte Vallée:
How to Guess l-th Roots Modulo n by Reducing Lattice Bases.
427-442
- Kazuhiko Yamaguchi, Hideki Imai:
A Study on Imai-Hirakawa Trellis-Coded Modulation Schemes.
443-453
Extended Abstracts
Copyright © Thu Nov 26 19:20:46 2009
by Michael Ley (ley@uni-trier.de)
