Eugene M. Luks

40 papers A* 17B 3Journal 16Unranked 4

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	Group Isomorphism with Fixed Subnormal Chains. CoRR Eugene M. Luks
2011	J	`jnl`	Generalizing Boolean Satisfiability II: Theory CoRR Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
2011	J	`jnl`	Generalizing Boolean Satisfiability III: Implementation CoRR Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
2011	J	`jnl`	Polynomial-time normalizers. Discret. Math. Theor. Comput. Sci. Eugene M. Luks, Takunari Miyazaki
2005	J	`jnl`	Combinatorics of Singly-Repairable Families. Electron. J. Comb. Eugene M. Luks, Amitabha Roy
2005	J	`jnl`	Generalizing Boolean Satisfiability III: Implementation. J. Artif. Intell. Res. Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
2004	J	`jnl`	Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
2004	A*	`conf`	Implementing a Generalized Version of Resolution. AAAI Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
2004	J	`jnl`	The Complexity of Symmetry-Breaking Formulas. Ann. Math. Artif. Intell. Eugene M. Luks, Amitabha Roy
2002	B	`conf`	Polynomial-time normalizers for permutation groups with restricted composition factors. ISSAC Eugene M. Luks, Takunari Miyazaki
2002	—	`conf`	Symmetry Breaking in Constraint Satisfaction. AI&M Eugene M. Luks, Amitabha Roy
2000	A*	`ed.`	Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA STOC F. Frances Yao, Eugene M. Luks
1999	A*	`conf`	Hypergraph Isomorphism and Structural Equivalence of Boolean Functions. STOC Eugene M. Luks
1999	J	`jnl`	Sylow Subgroups in Parallel. J. Algorithms William M. Kantor, Eugene M. Luks, Peter D. Mark
1997	J	`jnl`	Fast Management of Permutation Groups I. SIAM J. Comput. László Babai, Eugene M. Luks, Ákos Seress
1997	J	`jnl`	Some Algorithms for Nilpotent Permutation Groups. J. Symb. Comput. Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright
1996	A*	`conf`	Multiplicative Equations over Commuting Matrices. SODA László Babai, Robert Beals, Jin-Yi Cai, Gábor Ivanyos, Eugene M. Luks
1996	A*	`conf`	Symmetry-Breaking Predicates for Search Problems. KR James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy
1995	—	`conf`	Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. Groups and Computation Eugene M. Luks, Ákos Seress
1995	J	`jnl`	Fast Monte Carlo Algorithms for Permutation Groups. J. Comput. Syst. Sci. László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
1994	B	`conf`	Computing Normalizers in Permutation ISSAC Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright
1992	A*	`conf`	Computing in Solvable Matrix Groups FOCS Eugene M. Luks
1991	—	`conf`	Computing Composition Series in Primitive Groups. Groups And Computation László Babai, Eugene M. Luks, Ákos Seress
1991	A*	`conf`	Fast Monte Carlo Algorithms for Permutation Groups STOC László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
1991	—	`conf`	Permutation Groups and Polynomial-Time Computation. Groups And Computation Eugene M. Luks
1990	A*	`conf`	Computing in Quotient Groups STOC William M. Kantor, Eugene M. Luks
1989	B	`conf`	Reduction of Group Constructions to Point Stabilizers. ISSAC Gene Cooperman, Larry Finkelstein, Eugene M. Luks
1988	A*	`conf`	Fast Management of Permutation Groups FOCS László Babai, Eugene M. Luks, Ákos Seress
1988	J	`jnl`	Parallel Algorithms for Solvable Permutation Groups. J. Comput. Syst. Sci. Eugene M. Luks, Pierre McKenzie
1987	J	`jnl`	An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. J. ACM Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
1987	J	`jnl`	Computing the composition factors of a permutation group in polynomial time. Comb. Eugene M. Luks
1987	A*	`conf`	Permutation Groups in NC STOC László Babai, Eugene M. Luks, Ákos Seress
1986	A*	`conf`	Parallel Algorithms for Permutation Groups and Graph Isomorphism FOCS Eugene M. Luks
1985	A*	`conf`	Fast Parallel Computation with Permutation Groups FOCS Eugene M. Luks, Pierre McKenzie
1983	A*	`conf`	Canonical Labeling of Graphs STOC László Babai, Eugene M. Luks
1983	A*	`conf`	Computational Complexity and the Classification of Finite Simple Groups FOCS László Babai, William M. Kantor, Eugene M. Luks
1982	A*	`conf`	An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs FOCS Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
1982	J	`jnl`	Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. J. Comput. Syst. Sci. Eugene M. Luks
1980	A*	`conf`	Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time FOCS Eugene M. Luks
1980	A*	`conf`	Polynomial-Time Algorithms for Permutation Groups FOCS Merrick L. Furst, John E. Hopcroft, Eugene M. Luks