Á. Seress: Permutation Group Algorithms. x+264 pages,
Cambridge University Press, 2003.
1. Groups and Computation III. (W. Kantor, Á. Seress)
Vol. 8 of Ohio State Univ. Math. Research Inst. Publ., viii+368 pages,
de Gruyter, 2001.
2. Codes and Designs. (K. T. Arasu, Á. Seress)
Vol. 10 of Ohio State Univ. Math. Research Inst. Publ., viii+322 pages,
de Gruyter, 2002.
3. Finite Geometries, Groups and Computation.
(A. Hulpke, R. Liebler, T. Penttila, Á. Seress), viii+278 pages, deGruyter, 2006.
1. One of the (about 50) authors of GAP: Groups, Algorithms and Programming.
http://www.gap-stystem.org
Wrote large part of the permutation group library.
2. M. Neunhöffer, Á. Seress: GAP Package "recogbase".
http://www-groups.mcs.st-and.ac.uk/~neunhoef/Computer/Software/Gap/recogbase.html
3. M. Neunhöffer, Á. Seress: GAP Package "recog".
http://www-groups.mcs.st-and.ac.uk/~neunhoef/Computer/Software/Gap/recog.html In collaboration
with N. Ankaralioglu, P. Brooksbank, F. Celler, S. Howe,
M. Law, S. Linton, G. Malle, A. Niemeyer, E. O'Brien, C. M. Roney-Dougal.
1. Á. Seress: Gossiping old ladies. Discrete Mathematics 46 (1983),
75--81.
2. Á. Seress: k-sum-free decompositions. Matematikai Lapok 31 (1978-83),
191--195. (In Hungarian; English summary.)
3. P. Erdős, Z. Füredi, A. Hajnal, P. Komjáth, V. Rödl, Á. Seress:
Coloring graphs with locally few colors.
Discrete Mathematics 59 (1986), 21--34.
4. Á. Seress: Quick gossiping without duplicate transmissions.
Graphs and Combinatorics 2 (1986), 363--381.
5. L. Babai, Á. Seress: On the degree of transitivity of permutation groups: a short proof.
J. Comb. Theory (A) 45 (1987), 310--315.
6. L Babai, E. M. Luks, Á. Seress: Permutation groups in NC.
Proc. 19th ACM Symp. on the Theory of Computing (1987), 409--420.
7. Á. Seress: Gossips by conference calls.
Studia Sci. Math. Hungarica 22 (1987), 229--238.
8. Á. Seress: Quick gossiping by conference calls.
SIAM J. on Discrete Methods 1 (1988), 109--120.
9. D. Miklós, M. Newman, Á. Seress, D. West: The addition game:
an abstraction of a communication problem. Discrete Mathematics
68 (1988), 265--272.
10. L. Babai, Á. Seress: On the diameter of Cayley graphs of the symmetric group.
J. of Comb. Theory (A) 49 (1988), 175--179.
11. L. Babai, E. M. Luks, Á. Seress: Fast management of permutation groups.
Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), 272--282.
12. H. Friedman, Á. Seress: Decidability in elementary analysis I.
Advances in Mathematics 76 (1989), 94--115.
13. Á. Seress: Quick gossiping without duplicate transmissions (extended abstract).
Annals of the New York Academy of Sciences 555 (1989), 375--382.
14. Á. Seress: Some characterizations of type-1 lambda-designs.
J. of Comb. Theory (A) 52 (1989), 288--300.
15. H. Friedman, Á. Seress: Decidability in elementary analysis II.
Advances in Mathematics 79 (1990), 1--17.
16. Á. Seress: On lambda-designs with lambda = 2P.
Proc. of Workshop on Coding Theory and Design Theory,
IMA, Minneapolis, Ray-Chaudhuri editor., Springer 1990, 290--303.
17. L. Babai, G. Hetyei, W. Kantor, A. Lubotzky, Á. Seress: On the diameter of finite groups.
Proc. 31st IEEE Symp. on Foundations of Computer Science (1990), 857--866.
18. L. Babai, G. Cooperman, L. Finkelstein, E. Luks, Á. Seress:
Fast Monte Carlo algorithms for permutation groups.
Proc. 23rd ACM Symp. on the Theory of Computing (1991), 90--100.
19. A. Blokhuis, Á. Seress: On sets of points in PG(2,q) without tangents.
Proc. of the First International Conference on Blocking Sets,
A. Beutelspacher, F. Eugeni, F. Mazzocca eds, Mitteilungen aus dem Mathem. Seminar Giessen:
Heft 201, Giessen 1991, 39--44.
20. L. Babai, G. Cooperman, L. Finkelstein, Á. Seress:
Nearly linear time algorithms for permutation groups with a small base.
Proc. International Symposium on Symbolic and Algebraic Computation
(ISSAC '91), 1991, 200--209.
21. A. Blokhuis, R. Calderbank, K. Metsch, Á. Seress: An embedding theorem for
partial linear spaces. Advances in Finite Geometries and Designs, Proc. of
the Third Isle of Thorns Conf. , Hirschfeld, Hughes, Thas eds, Oxford Univ. Press 1991, 35--46.
22. Z. Füredi, D. Reimer, Á. Seress: Hajnal's triangle-free game and extremal graph problems.
Congressus Numerantium 82 (1991), 123--128.
23. Á. Seress: On Hajnal's triangle-free game. Graphs and Combinatorics
8 (1992), 75--79.
pdf file
24. R. Beals, Á. Seress: Computing composition factors of small base groups in almost linear time.
Proc. 24th STOC, 1992, pp. 116--125.
25. A. Blokhuis, Á. Seress, H. Wilbrink: A characterization of complete exterior sets of conics.
Combinatorica 12 (1992), 143--147.
26. L. Babai, Á. Seress: On the diameter of permutation groups.
European J. of Combinatorics 13 (1992), 231--243.
pdf file
27. L. Lovász, Á. Seress: The cocycle lattice of binary matroids.
European J. of Combinatorics 14 (1993), 241--250.
28. G. O. H. Katona, Á. Seress: Greedy construction of nearly regular graphs.
European J. of Combinatorics 14 (1993), 213--229.
29. Á. Seress, I. Weisz: PERM: a program computing strong generating sets.
Groups and Computation , L. Finkelstein, W. Kantor ed.,
DIMACS Series on Discrete Math. and Theor. Computer Science 11 AMS
1993, 269--276.
30. L. Babai, E. M. Luks, Á. Seress: Computing composition series in primitive groups.
Groups and Computation , L. Finkelstein, W. Kantor ed.,
DIMACS Series on Discrete Math. and Theor. Computer Science 11 AMS
1993, 1--16.
31. Z. Füredi, Á. Seress: Maximal triangle-free graphs with restrictions on the degrees.
J. of Graph Theory 18 (1994), 11--24.
pdf file
32. M. Schönert, Á. Seress: Finding blocks of imprimitivity in small-base groups
in nearly linear time. Proc. International Symposium on Symbolic and Algebraic Computation
(ISSAC '94), 1994, 154--157.
pdf file
33. P. L. Erdős, Á. Seress, L. Székely: On intersecting chains in Boolean algebras.
Combinatorics, Probability, and Computing 3 (1994), 57--62.
33a. P. L. Erdős, Á. Seress, L Székely: On intersecting chains in Boolean algebras.
Combinatorics, Geometry, and Probability ,
Cambridge Univ. Press 1997, 299--304.
34. L. Babai, G. Cooperman, L. Finkelstein, E. M. Luks, Á. Seress:
Fast Monte Carlo algorithms for permutation groups.
J. Comp. Syst. Sci. 50 (1995), 296--308.
35. Á. Seress, T. Szabó: Dense graphs with cycle neighborhoods.
J. Comb. Theory (B) 63 (1995), 281--293.
36. Z. Füredi, F. Lazebnik, Á. Seress, A. Ustimenko, A. Woldar:
Graphs of prescribed girth and bi-degree.
J. Comb. Theory (B) 64 (1995), 228--239.
37. L. Lovász, Á. Seress: The cocycle lattice of binary matroids II.
Lin. Alg. and Appl. 226/228 (1995), 553--565.
38. Á. Seress: The minimal base size of primitive solvable permutation groups.
J. London Math. Soc. 53 (1996), 243--255.
pdf file
39. E. M. Luks, Á. Seress: Computing the Fitting subgroup and solvable radical of small-base
permutation groups in nearly linear time.
Groups and Computation II (New Brunswick, NJ, 1995),
DIMACS Ser. Discrete Math. Theoret. Comput. Sci. , 28 , Amer. Math.
Soc., Providence, RI, 1997, pp. 169--181.
40. Á. Seress: An introduction to computational group theory.
Notices Amer. Math. Soc. 44 (1997), 671--679.
40a. Á. Seress: An introduction to computational group theory, extended version.
pdf file
41. Á. Seress: Primitive groups with no regular orbits on the set of subsets.
Bull. London Math. Soc. 29 (1997), 697--704.
pdf file
42. L. Babai, E. M. Luks, Á. Seress: Fast management of permutation groups I.
SIAM J. of Comput. 26 (1997), 1310--1342.
43. Á. Seress: On vertex-transitive, non-Cayley graphs of order pqr.
Discrete Math. 182 (1998), 279--292.
pdf file
44. Á. Seress: Nearly linear time algorithms for permutation groups: an interplay
between theory and practice. Acta Appl. Math. 52 (1998), 183--207.
45. D. Gluck, Á. Seress, A. Shalev: Bases for primitive permutation groups and
a conjecture of Babai. , J. Algebra 199 (1998), 367--378.
46. W. Kantor, Á. Seress: Permutation group algorithms via black box group recognition algorithms.
Proc. Groups St. Andrews 1997 in Bath, vol. II,
London Math. Soc. Lecture Note Series 261 (1999), 436--446.
47. Á. Seress, T. Szabó: On Erdős's eulerian trail game.
Graphs and Combinatorics 15 (1999), 233--237.
pdf file
47a. Á. Seress, T. Szabó: On Erdős's eulerian trail game.
Paul Erdős and his mathematics (Budapest, 1999), 226--227.
48. P. L. Erdős, Á. Seress, L. Székely: Erdős--Ko--Rado and Hilton--Milner
type theorems for intersecting chains in posets. Combinatorica 20 (2000), 27--47.
49. Á. Seress: Large families of cospectral graphs.
Designs, Codes, and Cryptography 21 (2000), 205--208.
50. Á. Seress: All lambda-designs with lambda = 2p are type-1.
Designs, Codes, and Cryptography 22 (2001), 5--17.
51. W. Kantor, Á. Seress: Black box classical groups.
Memoirs Amer. Math. Soc. 149 (2001), Nr. 708, viii+168 pages.
52. A. Hulpke, Á. Seress: Short presentations for three-dimensional unitary groups.
J. Algebra 245 (2001), 719--729.
pdf file
53. W. Kantor, Á. Seress: Prime power graphs of groups of Lie type.
J. Algebra 247 (2002), 370--434.
54. R. Beals, C. Leedham-Green, A. Niemeyer, C. Praeger, Á. Seress: Permutations with
restricted cycle structure and an algorithmic application.
Combinatorics, Probability, and Computing 11 (2002), 447--464.
55. A. Blokhuis, Á. Seress: The number of directions determined by points in the
three-dimensional Euclidean space.
Discrete and Computational Geometry 28 (2002), 491--494.
56. L. Babai, W. Kantor, P. Pálfy, Á. Seress: Black-box recognition of finite
simple groups of Lie type by statistics of element orders.
J. Group Theory 5 (2002), 383--401.
pdf file
57. Á. Seress: Highlights of Dijen Ray-Chaudhuri's research.
Codes and Designs , Ohio State Univ. Math. Research Inst. Publ. 10,
de Gruyter, 2002, pp. 1--7.
58. Á. Seress: A product decomposition of infinite symmetric groups.
Proc. Amer. Math. Soc. 131 (2003), 1681--1685.
59. R. Beals, C. Leedham-Green, A. Niemeyer, C. Praeger, Á. Seress:
A black-box group algorithm for recognizing finite symmetric and alternating groups.
I Trans. Amer. Math. Soc. 355 (2003), 2097--2113.
60. J. Dixon, L. Pyber, Á. Seress, A. Shalev: Residual properties of free groups and
probabilistic methods. J. reine angew. Math. 556 (2003), 159--172.
61. W. Kantor, Á. Seress: Computing with matrix groups.
Groups, Combinatorics, and Geometry (Durham 2001),
World Scientific , 2003, pp. 123--137.
62. C. H. Li, Á. Seress: The primitive permutation groups of squarefree degree.
Bulletin London Math. Soc. 35 (2003), 635--644.
pdf file
63. L. Babai, R. Beals, Á. Seress: On the diameter of the symmetric group: polynomial bounds.
Proc. Symp. on Discrete Algorithms , New Orleans, 2004, pp. 1108--1102.
64. P. Brooksbank, H. Qin, E. Robertson, Á. Seress: On Dowling geometries of infinite groups.
J. Comb. Theory (A) 108 (2004), 155--158.
pdf file
65. C. H. Li, Á. Seress: On vertex-transitive non-Cayley graphs of square-free order.
Designs, Codes, and Cryptography 34 (2005), 265--281.
pdf file
66. P. L. Erdős, L. Székely, Á. Seress: Non-trivial t-intersection in
the function lattice. Annals of Combinatorics 9 (2005), 177--187.
67. R. Beals, C. Leedham-Green, A. Niemeyer, C. Praeger, Á. Seress: Constructive recognition of
finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
J. Algebra 292 (2005), 4--46.
68. C. Praeger, Á. Seress: On minimal subdegrees of finite primitive permutation groups.
Oberwolfach Reports 2 (2005), 690--693.
69. P. Brooksbank, A. Niemeyer, Á. Seress: A reduction algorithm for matrix groups with an extraspecial
normal subgroup. Finite Geometries, Groups and Computation, deGruyter, 2006, pp. 1--16.
pdf file
70. M. Giudici, C. H. Li, C. Praeger, Á. Seress, V. Trofimov: On minimal subdegrees of finite prim
permutation groups. Finite Geometries, Groups and Computation, deGruyter, 2006, pp. 75--93.
71. C. H. Li, Á. Seress: Constructions of quasiprimitive two-arc transitive graphs of product action
type. Finite Geometries, Groups and Computation, deGruyter, 2006, pp. 115--123.
72. M. Law, A. Niemeyer, C. Praeger, Á. Seress: A reduction algorithm for large-base
primitive permutation groups. London Math. Soc. J. Comput. Math. 9 (2006), 159--173.
73. M. Giudici, C. H. Li, C. Praeger, Á. Seress, V. Trofimov: Limits of vertex-transitive graphs.
Ischia Group Theory 2004, Contemporary Math. 402 (2006), 159--169.
74. M. Neunhöffer, Á. Seress: A data structure for a uniform approach to computations with finite
groups. Proc. International Symposium on Symbolic and Algebraic Computation
(ISSAC '06), 2006, 254--261.
pdf file
75. Á. Seress: A data structure for a uniform approach to computations with finite groups.
Oberwolfach Reports 3 (2006), 1826--1827.
76. Á. Seress: A unified approach to computations with permutation and matrix groups.
Proc. of the International Congress of Mathematicians,
Madrid, Spain, 2006, European Math. Soc., 245--258.
pdf file
77. C. H. Li, Á. Seress: Symmetrical path-cycle covers of a graph and polygonal graphs.
J. Comb. Theory (A) 114 (2007), 35--51.
pdf file
78. M. Giudici, C. H. Li, C. Praeger, Á. Seress, V. Trofimov: On limit graphs of finite
vertex-primitive graphs. J. Comb. Theory (A) 114 (2007), 110--134.
79. Á. Seress: Toward the classification of s-arc transitive graphs.
Proc. Groups St Andrews 2005, vol. II,
London Math. Soc. Lecture Note Series 340 (2007), 401--414.
pdf file
80. A. Mann, C. Praeger, Á. Seress: Extremely primitive groups.
Groups, Geometry and Dynamics 1 (2007), 623--660.
pdf file
81. Á. Seress, K. Yang: On orbit-equivalent, two-step imprimitive permutation groups.
Computational Group Theory and the Theory of Groups, Contemporary Math. 470 (2008), 271--285.
pdf file
82. Á. Seress: Polygonal graphs. Horizons of Combinatorics,
Bolyai Soc. Math. Stud. 17 (2008), 179--188.
pdf file
83. J. Balogh, S. Bezrukov, L. H. Harper, Á. Seress: On the bandwidth of 3-dimensional
Hamming graphs. Theoret. Comput. Sci. 407 (2008), 488--495.
84. K. Magaard, E. O'Brien, Á. Seress: Recognition of small dimensional representations
of general linear groups. J. Australian Math. Soc. 85 (2008), 229--250.
pdf file
85. W. Kantor, Á. Seress: Large element orders and the characteristic of Lie-type simple groups.
J. of Algebra 322 (2009), 802--832.
86. L. Babai, R. Beals, Á. Seress: Polynomial-time theory of matrix groups.
Proc. 41st ACM Symp. on Theory of Computing (2009), pp. 55--64.
pdf file
87. C. H. Li, L. Niu, Á. Seress, R. Solomon: The vertex primitive and vertex bi-primitive
s-arc regular graphs. J. Combin. Theory (B) 100 (2010), 359-366.
pdf file
88. A. A. Ivanov, D. V. Pasechnik, Á. Seress, S. Shpectorov: Majorana representations of the
symmetric group of degree 4. J. Algebra 324 (2010), 2432-2463.
pdf file
89. C. Praeger, Á. Seress: Probabilistic generation of finite classical groups in odd
characteristic by involutions. J. Group Theory 14 (2011), 521-545.
pdf file
90. N. Mehta, Á. Seress: Connected, bounded degree, triangle avoidance games.
Electronic J. Combinatorics 18 (2011), no. 1, Paper 193, 37 pp.
EJC website
91. Á. Seress, E. Swartz: A note on the girth-doubling construction of polygonal graphs.
J. Graph Theory 68 (2011), 246-254.
pdf file
92. N. Ankaralioglu, Á. Seress: Computing tensor decompositions of finite matrix groups.
Discrete Mathematics and Theoretical Computer Science 13:4 (2011), 5-14.
DMTCS website
93. Á. Seress: T.-L. Wong, X. Zhu: Distinguishing labeling of the actions of almost simple
groups. Combinatorica 31 (2011), 489-506.
pdf file
94. T. Burness, C. Praeger, Á. Seress: Extremely primitive classical groups.
J. Pure and Applied Algebra 216 (2012), 1580-1610.
pdf file