 | 2009 |
|---|
| 36 |       | László Babai,
Robert Beals,
Ákos Seress:
Polynomial-time theory of matrix groups.
STOC 2009: 55-64 |
| 2008 |
|---|
| 35 | | J. Balogh,
Sergei L. Bezrukov,
L. H. Harper,
Ákos Seress:
On the bandwidth of 3-dimensional Hamming graphs.
Theor. Comput. Sci. 407(1-3): 488-495 (2008) |
| 2007 |
|---|
| 34 | | Michael Giudici,
Cai Heng Li,
Cheryl E. Praeger,
Ákos Seress,
Vladimir Ivanovich Trofimov:
On limit graphs of finite vertex-primitive graphs.
J. Comb. Theory, Ser. A 114(1): 110-134 (2007) |
| 33 | | Cai Heng Li,
Ákos Seress:
Symmetrical path-cycle covers of a graph and polygonal graphs.
J. Comb. Theory, Ser. A 114(1): 35-51 (2007) |
| 2006 |
|---|
| 32 | | Max Neunhöffer,
Ákos Seress:
A data structure for a uniform approach to computations with finite groups.
ISSAC 2006: 254-261 |
| 2005 |
|---|
| 31 | | Ákos Seress:
Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order.
Des. Codes Cryptography 34(2-3): 265-281 (2005) |
| 2004 |
|---|
| 30 | | László Babai,
Robert Beals,
Ákos Seress:
On the diameter of the symmetric group: polynomial bounds.
SODA 2004: 1108-1112 |
| 29 | | Peter A. Brooksbank,
Hongxun Qin,
Edmund Robertson,
Ákos Seress:
On Dowling geometries of infinite groups.
J. Comb. Theory, Ser. A 108(1): 155-158 (2004) |
| 2002 |
|---|
| 28 |  | Robert Beals,
Charles R. Leedham-Green,
Alice C. Niemeyer,
Cheryl E. Praeger,
Ákos Seress:
Permutations With Restricted Cycle Structure And An Algorithmic Application.
Combinatorics, Probability & Computing 11(5): (2002) |
| 27 | | Aart Blokhuis,
Ákos Seress:
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space.
Discrete & Computational Geometry 28(4): 491-494 (2002) |
| 2001 |
|---|
| 26 | | Ákos Seress:
All Lambda-Designs With are Type-1.
Des. Codes Cryptography 22(1): 5-17 (2001) |
| 2000 |
|---|
| 25 | | Péter L. Erdös,
Ákos Seress,
László A. Székely:
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.
Combinatorica 20(1): 27-45 (2000) |
| 24 | | Ákos Seress:
Large Families of Cospectral Graphs.
Des. Codes Cryptography 21(1/3): 205-208 (2000) |
| 1998 |
|---|
| 23 | | Ákos Seress:
On vertex-transitive, non-Cayley graphs of order pqr.
Discrete Mathematics 182(1-3): 279-292 (1998) |
| 1997 |
|---|
| 22 | | László Babai,
Eugene M. Luks,
Ákos Seress:
Fast Management of Permutation Groups I.
SIAM J. Comput. 26(5): 1310-1342 (1997) |
| 1995 |
|---|
| 21 | | Ákos Seress,
Tibor Szabó:
Dense Graphs with Cycle Neighborhoods.
J. Comb. Theory, Ser. B 63(2): 281-293 (1995) |
| 20 | | Zoltán Füredi,
Felix Lazebnik,
Ákos Seress,
Vasiliy A. Ustimenko,
Andrew J. Woldar:
Graphs of Prescribed Girth and Bi-Degree.
J. Comb. Theory, Ser. B 64(2): 228-239 (1995) |
| 19 | | László Babai,
Gene Cooperman,
Larry Finkelstein,
Eugene M. Luks,
Ákos Seress:
Fast Monte Carlo Algorithms for Permutation Groups.
J. Comput. Syst. Sci. 50(2): 296-308 (1995) |
| 1994 |
|---|
| 18 | | Martin Schönert,
Ákos Seress:
Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time.
ISSAC 1994: 154-157 |
| 17 | | Péter L. Erdös,
Ákos Seress,
László A. Székely:
On Intersecting Chains in Boolean Algebras.
Combinatorics, Probability & Computing 3: 57-62 (1994) |
| 1993 |
|---|
| 16 | | Gyula O. H. Katona,
Ákos Seress:
Greedy Construction of Nearly Regular Graphs.
Eur. J. Comb. 14(3): 213-229 (1993) |
| 15 | | László Lovász,
Ákos Seress:
The Cocycle Lattice of Binary Matroids .
Eur. J. Comb. 14(3): 241-250 (1993) |
| 1992 |
|---|
| 14 | | Robert Beals,
Ákos Seress:
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time
STOC 1992: 116-125 |
| 13 | | Aart Blokhuis,
Ákos Seress,
Henny A. Wilbrink:
Characterization of complete exterior sets of conics.
Combinatorica 12(2): 143-147 (1992) |
| 1991 |
|---|
| 12 | | László Babai,
Gene Cooperman,
Larry Finkelstein,
Ákos Seress:
Nearly Linear Time Algorithms for Permutation Groups with a Small Base.
ISSAC 1991: 200-209 |
| 11 | | László Babai,
Gene Cooperman,
Larry Finkelstein,
Eugene M. Luks,
Ákos Seress:
Fast Monte Carlo Algorithms for Permutation Groups
STOC 1991: 90-100 |
| 1990 |
|---|
| 10 | | László Babai,
Gábor Hetyei,
William M. Kantor,
Alexander Lubotzky,
Ákos Seress:
On the Diameter of Finite Groups
FOCS 1990: 857-865 |
| 1989 |
|---|
| 9 | | Ákos Seress:
Some characterizations of type-1 lambda-designs.
J. Comb. Theory, Ser. A 52(2): 288-300 (1989) |
| 1988 |
|---|
| 8 | | László Babai,
Eugene M. Luks,
Ákos Seress:
Fast Management of Permutation Groups
FOCS 1988: 272-282 |
| 7 | | Dezsö Miklós,
Mark J. Newman,
Ákos Seress,
Douglas B. West:
The addition game: an abstraction of a communication problem.
Discrete Mathematics 68(2-3): 265-272 (1988) |
| 6 | | László Babai,
Ákos Seress:
On the diameter of cayley graphs of the symmetric group.
J. Comb. Theory, Ser. A 49(1): 175-179 (1988) |
| 5 | | Ákos Seress:
Quick Gossiping by Conference Calls.
SIAM J. Discrete Math. 1(1): 109-120 (1988) |
| 1987 |
|---|
| 4 | | László Babai,
Eugene M. Luks,
Ákos Seress:
Permutation Groups in NC
STOC 1987: 409-420 |
| 3 | | László Babai,
Ákos Seress:
On the degree of transitivity of permutation groups: A short proof.
J. Comb. Theory, Ser. A 45(2): 310-315 (1987) |
| 1986 |
|---|
| 2 | | Paul Erdös,
Zoltán Füredi,
András Hajnal,
Péter Komjáth,
Vojtech Rödl,
Ákos Seress:
Coloring graphs with locally few colors.
Discrete Mathematics 59(1-2): 21-34 (1986) |
| 1983 |
|---|
| 1 | | Ákos Seress:
Gossiping old ladies.
Discrete Mathematics 46(1): 75-81 (1983) |
