Information and Communication

  1. François Arnault and Thierry P. Berger, Design and properties of a new pseudorandom generator based on a filtered FCSR automaton, IEEE Trans. Comput 54 (2005), no. 11, 1374–1383.
  2. Alin Bostan, Pierrick Gaudry, and Éric Schost, Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves, Finite Fields and Applications, Lecture Notes in Comput. Sci., vol. 2948, Springer, Berlin, 2004, pp. 40–58.[MR]
  3. Michael Clausen, Fast Fourier transforms for metabelian groups, SIAM J. Comput. 18 (1989), no. 3, 584–593.[MR]
  4. Michael Clausen, Beiträge zum Entwurf schneller Spektraltransformationen, PhD Thesis, Universität Karlsruhe, 1998.
  5. Jean-Charles Faugère, François Moreau de Saint-Martin, and Fabrice Rouillier, Design of regular nonseparable bidimensional wavelets using Gröbner basis techniques, IEEE Trans. Signal Process. 46 (1998), no. 4, 845–856.[MR]
  6. Willi Geiselmann, Jörn Müller-Quade, and Rainer Steinwandt, Comment on: "A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits" by G. Drolet, IEEE Trans. Comput. 51 (2002), no. 12, 1460–1461.[MR]
  7. Willi Geiselmann and Rainer Steinwandt, A redundant representation of GF(qn) for designing arithmetic circuits, IEEE Trans. Comp 52 (2003), no. 7, 848–853.
  8. Daniel M. Gordon, Victor Miller, and Peter Ostapenko, Optimal hash functions for approximate closest pairs on the n-cube, preprint (2008).[arXiv]
  9. Gohar M. Kyureghyan and Alexander Pott, On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences, in Proceedings of the Conference on Finite Geometries (Oberwolfach, 2001), vol. 29, 2003, pp. 149–164.[MR]
  10. San Ling and Patrick Solé, Nonlinear p-ary sequences, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 2, 117–125.[MR]
  11. Torsten Minkwitz, Algorithmensynthese für lineare Systeme mit Symmetrie, PhD Thesis, Technische Hochschule, Universität Karlsruhe, 1993.
  12. Eva Nuria Müller, On the crosscorrelation of sequences over GF(p) with short periods, IEEE Trans. Inform. Theory 45 (1999), no. 1, 289–295.[MR]
  13. Jonas Samuelsson, Multidimensional companding quantization of the Gaussian source, IEEE Trans. Inform. Theory 49 (2003), no. 5, 1343–1351.[MR]
  14. Luciano Sbaiz, Patrick Vandewalle, and Martin Vetterli, Groebner basis methods for multichannel sampling with unknown offsets, Appl. Comput. Harmon. Anal. 25 (2008), no. 3, 277–294.[doi]
  15. Stephen T. Schibell and Richard M. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math. 40 (1992), no. 3, 333–357.[MR]
  16. Lewis Stiller, Group graphs and computational symmetry on massively parallel architecture, The Journal of Supercomputing (1991), no. 5, 99-117.
  17. Lewis Stiller, Exploiting Symmetry on Parallel Architectures, PhD Thesis, John Hopkins University, 1995.
  18. Benno Tietz, Automatisierter Entwurf schneller Spektraltransformationen, Master's Thesis, Universität Karlsruhe, 1989.
  19. Chaoping Xing, Applications of algebraic curves to constructions of sequences, Cryptography and Computational Number Theory (Singapore, 1999), Progr. Comput. Sci. Appl. Logic, vol. 20, Birkhäuser, Basel, 2001, pp. 137–146.[MR]