Ákos Seress - researchr alias

researchr

You are not signed in
Sign in
Sign up

2010

The vertex primitive and vertex bi-primitive s-arc regular graphsCai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon. JCT, 100(4):359-366, 2010. [doi]

2009

Polynomial-time theory of matrix groupsLászló Babai, Robert Beals, Ákos Seress. stoc 2009: 55-64 [doi]

2008

On the bandwidth of 3-dimensional Hamming graphsJ. Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress. TCS, 407(1-3):488-495, 2008. [doi]

2007

On limit graphs of finite vertex-primitive graphsMichael Giudici, Cai Heng Li, Cheryl E. Praeger, Ákos Seress, Vladimir Ivanovich Trofimov. JCT, 114(1):110-134, 2007. [doi]

Symmetrical path-cycle covers of a graph and polygonal graphsCai Heng Li, Ákos Seress. JCT, 114(1):35-51, 2007. [doi]

2006

A data structure for a uniform approach to computations with finite groupsMax Neunhöffer, Ákos Seress. issac 2006: 254-261 [doi]

2005

Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free OrderÁkos Seress. dcc, 34(2-3):265-281, 2005. [doi]

2004

On the diameter of the symmetric group: polynomial boundsLászló Babai, Robert Beals, Ákos Seress. soda 2004: 1108-1112 [doi]

On Dowling geometries of infinite groupsPeter A. Brooksbank, Hongxun Qin, Edmund Robertson, Ákos Seress. JCT, 108(1):155-158, 2004. [doi]

2002

Permutations With Restricted Cycle Structure And An Algorithmic ApplicationRobert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress. cpc, 11(5), 2002.

The Number of Directions Determined by Points in the Three-Dimensional Euclidean SpaceAart Blokhuis, Ákos Seress. dcg, 28(4):491-494, 2002. [doi]

2001

All Lambda-Designs With are Type-1Ákos Seress. dcc, 22(1):5-17, 2001.

2000

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in PosetsPéter L. Erdös, Ákos Seress, László A. Székely. combinatorica, 20(1):27-45, 2000. [doi]

Large Families of Cospectral GraphsÁkos Seress. dcc, 21(1/3):205-208, 2000.

1998

On vertex-transitive, non-Cayley graphs of order pqrÁkos Seress. DM, 182(1-3):279-292, 1998. [doi]

1997

Fast Management of Permutation Groups ILászló Babai, Eugene M. Luks, Ákos Seress. siamcomp, 26(5):1310-1342, 1997.

1995

Fast Monte Carlo Algorithms for Permutation GroupsLászló Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress. jcss, 50(2):296-308, 1995.

Graphs of Prescribed Girth and Bi-DegreeZoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar. JCT, 64(2):228-239, 1995. [doi]

Dense Graphs with Cycle NeighborhoodsÁkos Seress, Tibor Szabó. JCT, 63(2):281-293, 1995. [doi]

1994

On Intersecting Chains in Boolean AlgebrasPéter L. Erdös, Ákos Seress, László A. Székely. cpc, 3:57-62, 1994.

Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear TimeMartin Schönert, Ákos Seress. issac 1994: 154-157 [doi]

1993

Greedy Construction of Nearly Regular GraphsGyula O. H. Katona, Ákos Seress. ejc, 14(3):213-229, 1993. [doi]

The Cocycle Lattice of Binary Matroids László Lovász, Ákos Seress. ejc, 14(3):241-250, 1993. [doi]

1992

Structure Forest and Composition Factors for Small Base Groups in Nearly Linear TimeRobert Beals, Ákos Seress. stoc 1992: 116-125

Characterization of complete exterior sets of conicsAart Blokhuis, Ákos Seress, Henny A. Wilbrink. combinatorica, 12(2):143-147, 1992.

1991

Fast Monte Carlo Algorithms for Permutation GroupsLászló Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress. stoc 1991: 90-100

Nearly Linear Time Algorithms for Permutation Groups with a Small BaseLászló Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress. issac 1991: 200-209 [doi]

1990

On the Diameter of Finite GroupsLászló Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress. focs 1990: 857-865

1989

Some characterizations of type-1 lambda-designsÁkos Seress. JCT, 52(2):288-300, 1989. [doi]

1988

Fast Management of Permutation GroupsLászló Babai, Eugene M. Luks, Ákos Seress. focs 1988: 272-282

On the diameter of cayley graphs of the symmetric groupLászló Babai, Ákos Seress. JCT, 49(1):175-179, 1988. [doi]

The addition game: an abstraction of a communication problemDezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West. DM, 68(2-3):265-272, 1988. [doi]

Quick Gossiping by Conference CallsÁkos Seress. siamdm, 1(1):109-120, 1988.

1987

On the degree of transitivity of permutation groups: A short proofLászló Babai, Ákos Seress. JCT, 45(2):310-315, 1987. [doi]

Permutation Groups in NCLászló Babai, Eugene M. Luks, Ákos Seress. stoc 1987: 409-420

1986

Coloring graphs with locally few colorsPaul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress. DM, 59(1-2):21-34, 1986. [doi]

1983

Gossiping old ladiesÁkos Seress. DM, 46(1):75-81, 1983. [doi]