Lecture Notes for the 22nd Mcgill Invitational Workshop on Computational Complexity

[1]  Michael Larsen,et al.  Finite subgroups of algebraic groups , 2011 .

[2]  Ben Green,et al.  Linear Approximate Groups , 2010, 1001.4570.

[3]  L'aszl'o Pyber,et al.  Growth in finite simple groups of Lie type of bounded rank , 2010, 1005.1858.

[4]  A. Lubotzky,et al.  Dimension expanders , 2008, 0804.0481.

[5]  Randall R. Holmes Linear Representations of Finite Groups , 2008 .

[6]  Avi Wigderson,et al.  Expanders In Group Algebras , 2004, Comb..

[7]  Christopher Umans,et al.  A group-theoretic approach to fast matrix multiplication , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Terence Tao,et al.  A sum-product estimate in finite fields, and applications , 2003, math/0301343.

[9]  G. Cooperman Towards a practical, theoretically sound algorithm for random generation in finite groups , 2002, math/0205203.

[10]  A. Eskin,et al.  On uniform exponential growth for linear groups , 2001, math/0108157.

[11]  Noga Alon,et al.  Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

[12]  Joe Harris,et al.  Representation Theory: A First Course , 1991 .

[13]  Lajos Rónyai,et al.  Computing irreducible representations of finite groups , 1989, 30th Annual Symposium on Foundations of Computer Science.

[14]  P. Erdös,et al.  Representation of Group Elements as Short Products , 1982 .

[15]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[16]  J. Fournier Sharpness in Young’s inequality for convolution , 1977 .