Quantum Computing

• Limitations of quantum coset states for graph isomorphism,
  S. Hallgren, C. Moore, M. Rötteler, A. Russell, and P. Sen,
  Proceedings 38th ACM Symposium on Theory of Computing (STOC'06), pp. 604-617, 2006.
• Equivalence of decoupling schemes and orthogonal arrays,
  M. Rötteler and P. Wocjan,
  IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4171-4181, 2006.
• Thresholds for linear optics quantum computing with photon loss at the detectors,
  M. Silva, M. Rötteler, and Ch. Zalka,
  Physical Review A, 72:032307, 2005.
• On the power of random bases in Fourier sampling: hidden subgroup problem in the Heisenberg group,
  J. Radhakrishnan, M. Rötteler, and P. Sen,
  Proceedings ICALP'05, LNCS, vol. 3580, pp. 1399-1411, Springer, 2005.
• Quantum software reusability,
  A. Klappenecker and M. Rötteler,
  International Journal of Foundations of Computer Science, vol. 14, no. 5, pp. 777-796, 2003.
• Simulating Hamiltonians in quantum networks: efficient schemes and complexity bounds,
  P. Wocjan, M. Rötteler, D. Janzing, and Th. Beth,
  Physical Review A, 65:042309 2002.

Quantum Codes

• General scheme for perfect quantum network coding with free classical communication,
  H. Kobayashi, F. Le Gall, H. Nishimura und M. Rötteler,
  Proceedings ICALP'09, LNCS, vol. 5555, pp. 622-633. Springer, 2009.
  
• Mutually unbiased bases are complex projective 2-designs,
  A. Klappenecker and M. Rötteler,
  Proceedings of the 2005 IEEE International Symposium on Information Theory (ISIT'05), pp. 1740-1744, 2005.
• On the monomiality of nice error bases,
  A. Klappenecker and M. Rötteler,
  IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 1084-1089, 2005.
• Constructions of mutually unbiased bases,
  A. Klappenecker and M. Rötteler,
  Proceedings International Conference on Finite Fields and Applications, LNCS, vol. 2948, pp. 137-144. Springer, 2004.
  
• Efficient quantum circuits for non-qubit quantum error-correcting codes,
  M. Grassl, M. Rötteler, and Th. Beth,
  International Journal of Foundations of Computer Science, vol. 14, no. 5, pp. 757-775, 2003.
• Graphs, quadratic forms, and quantum codes,
  M. Grassl, A. Klappenecker, and M. Rötteler,
  Proceedings IEEE International Symposium on Information Theory (ISIT'02), p. 45, 2002.

Signal Processing

• A hybrid nano-CMOS architecture for defect and fault tolerance,
  M. Simsir, S. Cadambi, F. Ivancic, M. Rötteler, and N. Jha,
  ACM Journal on Emerging Technologies in Computing Systems, 2009 (accepted for publication).
• Using hardware transactional memory for data race detection,
  S. Gupta, F. Sultan, S. Cadambi, F. Ivancic, and M. Rötteler,
  Proceedings IEEE International Parallel and Distributed Processing Symposium (IPDPS'09), pp. 1-11, 2009.
• Algebraic signal processing theory: 2-D spatial hexagonal lattice,
  M. Püschel and M. Rötteler,
  IEEE Transactions on Image Processing, vol. 16, no. 6, pp. 1506-1521, 2007.

Algebra

• On minimal length factorizations of finite groups,
  M.-I. Gonzalez Vasco, M. Rötteler, and R. Steinwandt,
  Experimental Mathematics, vol. 12, no. 1, pp. 1-12. A K Peters, 2003.
• Homogeneous bent functions, invariants, and designs,
  Ch. Charnes, M. Rötteler, and Th. Beth,
  Designs, Codes, and Cryptography, vol. 26, no. 1-3, pp. 139-154, 2002.
• Computing local invariants of quantum-bit systems,
  M. Grassl, M. Rötteler, and Th. Beth,
  Phys. Rev. A., vol. 58, no. 3, pp. 1833-1839, 1998.