Eugene M. Luks

According to our database, Eugene M. Luks authored at least 35 papers between 1980 and 2015.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2015

Group Isomorphism with Fixed Subnormal Chains.

Eugene M. Luks

CoRR, 2015

2011

Polynomial-time normalizers.

Eugene M. Luks, Takunari Miyazaki

Discret. Math. Theor. Comput. Sci., 2011

2005

Generalizing Boolean Satisfiability III: Implementation.

Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes

J. Artif. Intell. Res., 2005

Combinatorics of Singly-Repairable Families.

Eugene M. Luks, Amitabha Roy

Electron. J. Comb., 2005

2004

Generalizing Boolean Satisfiability II: Theory.

Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes

J. Artif. Intell. Res., 2004

The Complexity of Symmetry-Breaking Formulas.

Eugene M. Luks, Amitabha Roy

Ann. Math. Artif. Intell., 2004

Implementing a Generalized Version of Resolution.

Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2002

Polynomial-time normalizers for permutation groups with restricted composition factors.

Eugene M. Luks, Takunari Miyazaki

Proceedings of the Symbolic and Algebraic Computation, 2002

Symmetry Breaking in Constraint Satisfaction.

Eugene M. Luks, Amitabha Roy

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2002

1999

Sylow Subgroups in Parallel.

William M. Kantor, Eugene M. Luks, Peter D. Mark

J. Algorithms, 1999

Hypergraph Isomorphism and Structural Equivalence of Boolean Functions.

Eugene M. Luks

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1997

Fast Management of Permutation Groups I.

László Babai, Eugene M. Luks, Ákos Seress

SIAM J. Comput., 1997

Some Algorithms for Nilpotent Permutation Groups.

Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright

J. Symb. Comput., 1997

1996

Multiplicative Equations over Commuting Matrices.

László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Symmetry-Breaking Predicates for Search Problems.

James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

1995

Fast Monte Carlo Algorithms for Permutation Groups.

László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress

J. Comput. Syst. Sci., 1995

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

Eugene M. Luks, Ákos Seress

Proceedings of the Groups and Computation, 1995

1994

Computing Normalizers in Permutation <i>p</i>-Groups.

Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1992

Computing in Solvable Matrix Groups

Eugene M. Luks

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Permutation Groups and Polynomial-Time Computation.

Eugene M. Luks

Proceedings of the Groups And Computation, 1991

Computing Composition Series in Primitive Groups.

László Babai, Eugene M. Luks, Ákos Seress

Proceedings of the Groups And Computation, 1991

1990

Computing in Quotient Groups

William M. Kantor, Eugene M. Luks

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Reduction of Group Constructions to Point Stabilizers.

Gene Cooperman, Larry Finkelstein, Eugene M. Luks

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988

Parallel Algorithms for Solvable Permutation Groups.

Eugene M. Luks, Pierre McKenzie

J. Comput. Syst. Sci., 1988

Fast Management of Permutation Groups

László Babai, Eugene M. Luks, Ákos Seress

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs.

Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber

J. ACM, 1987

Computing the composition factors of a permutation group in polynomial time.

Eugene M. Luks

Comb., 1987

Permutation Groups in NC

László Babai, Eugene M. Luks, Ákos Seress

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Parallel Algorithms for Permutation Groups and Graph Isomorphism

Eugene M. Luks

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Fast Parallel Computation with Permutation Groups

Eugene M. Luks, Pierre McKenzie

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1983

Canonical Labeling of Graphs

László Babai, Eugene M. Luks

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Computational Complexity and the Classification of Finite Simple Groups

László Babai, William M. Kantor, Eugene M. Luks

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time.

Eugene M. Luks

J. Comput. Syst. Sci., 1982

An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs

Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1980

Polynomial-Time Algorithms for Permutation Groups

Merrick L. Furst, John E. Hopcroft, Eugene M. Luks

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980