Seress, Akos

Office:MW 602 (Columbus)
Phone:614-292-5754 (Columbus)
Email:
Website:http://www.math.osu.edu/~seress.1
OSU ID:seress.1
Online Preprints:Link
Research Areas:Algorithms for computing with finite groups, Cayley graphs, statistical and asymptotic group theory, extremal and algebraic graph theory, extremal set theory.
Combinatorics
Group Theory

Office Hours
By appointment

Selected Publications

  1. On the diameter of permutation groups. http://arxiv.org/abs/1109.3550 (with Harald Helfgott).
  2. Polynomial-time theory of matrix groups. Proc. 41st ACM Symp. on Theory of Computing (2009), pp. 55--64 (with Laszlo Babai, Robert Beals).
  3. Permutation Group Algorithms. Cambridge University Press, 2003.
  4. Black box classical groups. Memoirs of the AMS, 149 (2001), nr. 708 (with William Kantor).
  5. The minimal base size of primitive solvable permutation groups. J. London Math. Soc. 53 (1996), 243--255.