Seress, Akos
| Office: | MW 602 (Columbus) |
| Phone: | 614-292-5754 (Columbus) |
| Email: | |
| Website: | http://www.math.ohio-state.edu/~akos |
| OSU ID: | Seress.1 |
| Research Areas: | Algorithms for computing with finite groups, Cayley graphs, extremal graph theory, extremal set theory. Combinatorics Group Theory |
| Teaching: | View Teaching Schedule |
MW714 MWF 12:30 pm - 1:18 pm
by appointment
Selected Publications
- Permutation Group Algorithms, Cambridge University Press, 2003.
- Black box classical groups, Memoirs of the AMS, 149 (2001), nr. 708 (with William Kantor).
- All lambda-designs with lambda=2p are type-1, Designs, Codes, and Cryptography 22(2001), 5-17.
- The minimal base size of primitive solvable permutation groups, J. London Math. Soc. 53 (1996), 243--255.
- Maximal triangle-free graphs with restrictions on the degrees, J. of Graph Theory 18(1994), 11-24 (with Z. Furedi).
