Applicable Algebra in Engineering, Communication and Computing, Volume 12

Volume 12, Number 1/2, 2001

• Jürgen Giesl, Pierre Lescanne:
  Special Issue "Termination". 1-2
  Electronic Edition (Springer LINK) BibTeX
• Hans Zantema:
  The Termination Hierarchy for Term Rewriting. 3-19
  Electronic Edition (Springer LINK) BibTeX
• Dieter Hofbauer:
  Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity. 21-38
  Electronic Edition (Springer LINK) BibTeX
• Jürgen Giesl, Thomas Arts:
  Verification of Erlang Processes by Dependency Pairs. 39-72
  Electronic Edition (Springer LINK) BibTeX
• Enno Ohlebusch:
  Termination of Logic Programs: Transformational Methods Revisited. 73-116
  Electronic Edition (Springer LINK) BibTeX
• Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
  A General Framework for Automatic Termination Analysis of Logic Programs. 117-156
  Electronic Edition (Springer LINK) BibTeX
• Sofie Verbaeten, Danny De Schreye:
  Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. 157-196
  Electronic Edition (Springer LINK) BibTeX

Volume 12, Number 3, 2001

• Nick Cropper, Ursula Martin:
  The Classification of Polynomial Orderings on Monadic Terms. 197-226
  Electronic Edition (Springer LINK) BibTeX
• Radomir S. Stankovic, Claudio Moraga, Jaakko Astola:
  From Fourier Expansions to Arithmetic-Haar Expressions on Quaternion Groups. 227-253
  Electronic Edition (Springer LINK) BibTeX
• Z. Hu, X. Li, Donald Mills, Eva Nuria Müller, W. Sun, Wolfgang Willems, Y. Yang, Z. Zhang:
  On the Crosscorrelation of Sequences with the Decimation Factor d = (pⁿ+1)/(p+1) - (pⁿ-1)/2. 255-263
  Electronic Edition (Springer LINK) BibTeX
• Harald Niederreiter, Arne Winterhof:
  On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields. 265-272
  Electronic Edition (Springer LINK) BibTeX

Volume 12, Number 4, 2001

• Vakhtang Lomadze:
  Convolutional Codes and Coherent Sheaves. 273-326
  Electronic Edition (Springer LINK) BibTeX
• Patrizio Frosini, Claudia Landi:
  Size Functions and Formal Series. 327-349
  Electronic Edition (Springer LINK) BibTeX

Volume 12, Number 5, 2001

• Francesca Cioffi:
  Remarks on the Computation of Minimal Finite Free Resolutions. 351-363
  Electronic Edition (Springer LINK) BibTeX
• San Ling, Patrick Solé:
  Duadic Codes over F₂ + uF₂. 365-379
  Electronic Edition (Springer LINK) BibTeX
• Koji Chinen, Toyokazu Hiramatsu:
  Hyper-Kloosterman Sums and their Applications to the Coding Theory. 381-390
  Electronic Edition (Springer LINK) BibTeX
• Yoshio Takane, Michael A. Hunter:
  Constrained Principal Component Analysis: A Comprehensive Theory. 391-419
  Electronic Edition (Springer LINK) BibTeX
• Hoon Hong:
  Ore Subresultant Coefficients in Solutions. 421-428
  Electronic Edition (Springer LINK) BibTeX
• Manfred Goebel:
  Visualizing Properties of Comprehensive SAGBI Bases - Two Examples. 429-435
  Electronic Edition (Springer LINK) BibTeX

Volume 12, Number 6, 2001

• Maurice Mignotte, Doru Stefanescu:
  Estimates for Polynomial Roots. 437-453
  Electronic Edition (Springer LINK) BibTeX
• Volker Weispfenning:
  Semilinear Motion Planning in REDLOG. 455-475
  Electronic Edition (Springer LINK) BibTeX
• Tim Blackmore, Graham H. Norton:
  Matrix-Product Codes over F_q. 477-500
  Electronic Edition (Springer LINK) BibTeX