Ákos Seress

发表

Connected, Bounded Degree, Triangle Avoidance Games

Nishali Mehta, Ákos Seress, 2011, Electron. J. Comb..

Computing Composition Series in Primitive Groups

László Babai, Ákos Seress, Eugene M. Luks, 1991, Groups And Computation.

Further Low-Level Algorithms

Ákos Seress, 2003 .

Fast Monte Carlo Algorithms for Permutation Groups

László Babai, Gene Cooperman, Ákos Seress, 1995, J. Comput. Syst. Sci..

Finding blocks of imprimitivity in small-base groups in nearly linear time

Ákos Seress, Martin Schönert, Á. Seress, 1994, ISSAC '94.

Coloring graphs with locally few colors

Vojtech Rödl, Zoltán Füredi, Paul Erdös, 1986, Discret. Math..

On the diameter of permutation groups

László Babai, Ákos Seress, L. Babai, 1992, Eur. J. Comb..

Permutation groups in NC

László Babai, Ákos Seress, Eugene M. Luks, 1987, STOC '87.

Greedy Construction of Nearly Regular Graphs

Gyula O. H. Katona, Ákos Seress, G. Katona, 1993, European journal of combinatorics (Print).

The Cocycle Lattice of Binary Matroids

László Lovász, Ákos Seress, L. Lovász, 1993, Eur. J. Comb..

Permutation Group Algorithms: Bibliography

Ákos Seress, 2003 .

Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday

Mario Szegedy, Ákos Seress, 2011, Discret. Math. Theor. Comput. Sci..

A Family of Half-Transitive Graphs

Cai Heng Li, Jing Chen, Ákos Seress, 2013, Electron. J. Comb..

On Erdős's Eulerian Trail Game

Tibor Szabó, Ákos Seress, 1999, Graphs Comb..

A data structure for a uniform approach to computations with finite groups

Ákos Seress, Max Neunhöffer, Á. Seress, 2006, ISSAC '06.

On the diameter of the symmetric group: polynomial bounds

László Babai, Ákos Seress, Robert Beals, 2004, SODA '04.

Groups and computation III : proceedings of the International Conference at the Ohio State University, June 15-19, 1999

William M. Kantor, Ákos Seress, 2001 .

On limit graphs of finite vertex-primitive graphs

Cheryl E. Praeger, Cai Heng Li, Vladimir Ivanovich Trofimov, 2007, J. Comb. Theory, Ser. A.

Some characterizations of type-1 lambda-designs

Ákos Seress, Á. Seress, 1989, J. Comb. Theory, Ser. A.

Distinguishing labeling of the actions of almost simple groups

Xuding Zhu, Tsai-Lien Wong, Ákos Seress, 2011, Comb..

Dense Graphs with Cycle Neighborhoods

Tibor Szabó, Ákos Seress, 1995, J. Comb. Theory, Ser. B.

The addition game: an abstraction of a communication problem

Douglas B. West, Dezsö Miklós, Ákos Seress, 1988, Discret. Math..

Characterization of complete exterior sets of conics

Aart Blokhuis, Ákos Seress, Henny A. Wilbrink, 1992, Comb..

On Hajnal's triangle-free game

Ákos Seress, Á. Seress, 1992, Graphs Comb..

Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time

Ákos Seress, Eugene M. Luks, 1995, Groups and Computation.

On the degree of transitivity of permutation groups: A short proof

László Babai, Ákos Seress, L. Babai, 1987, J. Comb. Theory, Ser. A.

Polynomial-time theory of matrix groups

László Babai, Ákos Seress, Robert Beals, 2009, STOC '09.

A note on the girth‐doubling construction for polygonal graphs

Ákos Seress, Eric Swartz, Á. Seress, 2011, J. Graph Theory.

Computing tensor decompositions of finite matrix groups

Ákos Seress, Nurullah Ankaralioglu, Á. Seress, 2011, Discret. Math. Theor. Comput. Sci..

On Intersecting Chains in Boolean Algebras

László A. Székely, Péter L. Erdös, Ákos Seress, 1994, Comb. Probab. Comput..

Gossiping old ladies

Ákos Seress, 1983, Discret. Math..

Fast Management of Permutation Groups I

László Babai, Ákos Seress, Eugene M. Luks, 1997, SIAM J. Comput..

Bounds on the diameter of Cayley graphs of the symmetric group

László Babai, Ákos Seress, L. Babai, 1988, Journal of Algebraic Combinatorics.

Erdős–Ko–Rado and Hilton–Milner Type Theorems for Intersecting Chains in Posets

László A. Székely, Péter L. Erdös, Ákos Seress, 2000, Comb..

The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space

Aart Blokhuis, Ákos Seress, 2002, Discret. Comput. Geom..

Permutations with Restricted Cycle Structure and an Algorithmic Application

Cheryl E. Praeger, Charles R. Leedham-Green, Ákos Seress, 2002, Combinatorics, Probability and Computing.

Large Families of Cospectral Graphs

Ákos Seress, 2000, Des. Codes Cryptogr..

Bounded Degree, Triangle Avoidance Graph Games

Nishali Mehta, Ákos Seress, 2013, Graphs Comb..

Fast management of permutation groups

László Babai, Ákos Seress, Eugene M. Luks, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Structure forest and composition factors for small base groups in nearly linear time

Ákos Seress, Robert Beals, 1992, STOC '92.

Quick gossiping without duplicate transmissions

Ákos Seress, 1986, Graphs Comb..

All Lambda-Designs With are Type-1

Ákos Seress, 2001, Des. Codes Cryptogr..

Fast Monte Carlo algorithms for permutation groups

László Babai, Gene Cooperman, Ákos Seress, 1991, STOC '91.

Quick Gossiping Without Duplicate Transmissions

Ákos Seress, 1989 .

On vertex-transitive, non-Cayley graphs of order pqr

Ákos Seress, 1998, Discret. Math..

Graphs of Prescribed Girth and Bi-Degree

Zoltán Füredi, Felix Lazebnik, Ákos Seress, 1995, J. Comb. Theory, Ser. B.

Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order

Ákos Seress, Á. Seress, 2005, Des. Codes Cryptogr..

Nearly linear time algorithms for permutation groups with a small base

László Babai, Gene Cooperman, Ákos Seress, 1991, ISSAC '91.

The vertex primitive and vertex bi-primitive s-arc regular graphs

Cai Heng Li, Ákos Seress, Liang Niu, 2010, J. Comb. Theory, Ser. B.

Disconnected Colors in Generalized Gallai‐Colorings

Shinya Fujita, András Gyárfás, Colton Magnant, 2013, J. Graph Theory.

A group theoretic approach to (0, 2)-geometries

Tim Penttila, Ákos Seress, Alexander Hulpke, 2006 .

On the bandwidth of 3-dimensional Hamming graphs

L. H. Harper, Ákos Seress, Sergei L. Bezrukov, 2008, Theor. Comput. Sci..

On Dowling geometries of infinite groups

Ákos Seress, Peter A. Brooksbank, Hongxun Qin, 2004, J. Comb. Theory A.

PERM: A Program Computing Strong Generating Sets

Ákos Seress, Iván Weisz, 1991, Groups And Computation.

Construction of 2-closed M-representations

Ákos Seress, Á. Seress, 2012, ISSAC.

Symmetrical path-cycle covers of a graph and polygonal graphs

Cai Heng Li, Ákos Seress, 2007, J. Comb. Theory, Ser. A.

Black-box recognition of finite simple groups of Lie type by statistics of element orders

László Babai, William M. Kantor, Ákos Seress, 2002 .

Decidability in elementary analysis, II

Ákos Seress, Harvey M. Friedman, 1990 .

The Minimal Base Size of Primitive Solvable Permutation Groups

Ákos Seress, Á. Seress, 1996 .

Dimensional dual arcs – a survey

Tim Penttila, Ákos Seress, Alexander Hulpke, 2006 .

Towards effective algorithms for linear groups

Tim Penttila, Ákos Seress, Alexander Hulpke, 2006 .

Extremely Primitive Classical Groups

Cheryl E. Praeger, Ákos Seress, Timothy C. Burness, 2012 .

A Reduction Algorithm for Large-Base Primitive Permutation Groups

Cheryl E. Praeger, Maska Law, Ákos Seress, 2006 .

The cocycle lattice of binary matroids, II

László Lovász, Ákos Seress, 1995 .

Residual properties of free groups and probabilistic methods

László Pyber, Ákos Seress, John D. Dixon, 2003 .

RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS

Kay Magaard, Ákos Seress, E. A. O'Brien, 2008, Journal of the Australian Mathematical Society.

Short Presentations for Three-Dimensional Unitary Groups☆

Ákos Seress, Alexander Hulpke, 2001 .

On the diameter of permutation groups

Ákos Seress, Harald Andrés Helfgott, 2014 .

An embedding theorem for partial linear spaces

Klaus Metsch, Ákos Seress, Aart Blokhuis, 1991 .

Prime Power Graphs for Groups of Lie Type

William M. Kantor, Ákos Seress, Á. Seress, 2002 .

Bases for Primitive Permutation Groups and a Conjecture of Babai

Ákos Seress, Aner Shalev, David Gluck, 1998 .

A reduction algorithm for matrix groups with an extraspecial normal subgroup

Ákos Seress, Peter A. Brooksbank, Alice C. Niemeyer, 2006 .

Majorana representations of the symmetric group of degree 4

Sergey Shpectorov, Ákos Seress, Dmitrii V. Pasechnik, 2010 .

Binary Relations

Thomas Breuer, Steve Linton, Johannes Meier, 2003 .

A black-box group algorithm for recognizing finite symmetric and alternating groups, I

Cheryl E. Praeger, Ákos Seress, Robert Beals, 2003 .

Estimation Problems and Randomised Group Algorithms

Cheryl E. Praeger, Ákos Seress, Alice C. Niemeyer, 2013 .

Characterising vertex-star transitive and edge-star transitive graphs

Michael Giudici, Anne Thomas, Ákos Seress, 2015 .

On sets of points in PG(2,q) without tangents

Ha Henny Wilbrink, Ákos Seress, Aart Blokhuis, 1991 .

Black Box Classical Groups

William M. Kantor, Ákos Seress, Á. Seress, 2001 .

Large element orders and the characteristic of Lie-type simple groups ✩

William M. Kantor, Ákos Seress, Á. Seress, 2009 .

Primitive Groups with no Regular Orbits on the Set of Subsets

Ákos Seress, 1997 .

The Primitive Permutation Groups of Squarefree Degree

Ákos Seress, Cai Heng Li, Á. Seress, 2003 .

Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules

Cheryl E. Praeger, Ákos Seress, Robert Beals, 2005 .

Maximal triangle-free graphs with restrictions on the degrees

Zoltán Füredi, Ákos Seress, Z. Füredi, 1994 .