Information and Communication

Circuits and Networks

94Cxx

  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. 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]
  3. Willi Geiselmann and Rainer Steinwandt, A redundant representation of GF(qn) for designing arithmetic circuits, IEEE Trans. Comp 52 (2003), no. 7, 848–853.
  4. Stephen T. Schibell and Richard M. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math. 40 (1992), no. 3, 333–357.[MR]
  5. Lewis Stiller, Group graphs and computational symmetry on massively parallel architecture, The Journal of Supercomputing (1991), no. 5, 99-117.
  6. Lewis Stiller, Exploiting Symmetry on Parallel Architectures, PhD Thesis, John Hopkins University, 1995.