Search the dblp DataBase
Eugene M. Luks: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Implementing a Generalized Version of Resolution. [Citation Graph (0, 0)][DBLP]
AAAI, 2004, pp:55-60 [Conf] - Eugene M. Luks, Amitabha Roy
Symmetry Breaking in Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
AMAI, 2002, pp:- [Conf] - László Babai, William M. Kantor, Eugene M. Luks
Computational Complexity and the Classification of Finite Simple Groups [Citation Graph (0, 0)][DBLP]
FOCS, 1983, pp:162-171 [Conf] - László Babai, Eugene M. Luks, Ákos Seress
Fast Management of Permutation Groups [Citation Graph (0, 0)][DBLP]
FOCS, 1988, pp:272-282 [Conf] - Merrick L. Furst, John E. Hopcroft, Eugene M. Luks
Polynomial-Time Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP]
FOCS, 1980, pp:36-41 [Conf] - Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs [Citation Graph (0, 0)][DBLP]
FOCS, 1982, pp:118-125 [Conf] - Eugene M. Luks
Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time [Citation Graph (0, 0)][DBLP]
FOCS, 1980, pp:42-49 [Conf] - Eugene M. Luks
Parallel Algorithms for Permutation Groups and Graph Isomorphism [Citation Graph (0, 0)][DBLP]
FOCS, 1986, pp:292-302 [Conf] - Eugene M. Luks
Computing in Solvable Matrix Groups [Citation Graph (0, 0)][DBLP]
FOCS, 1992, pp:111-120 [Conf] - Eugene M. Luks, Pierre McKenzie
Fast Parallel Computation with Permutation Groups [Citation Graph (0, 0)][DBLP]
FOCS, 1985, pp:505-514 [Conf] - Gene Cooperman, Larry Finkelstein, Eugene M. Luks
Reduction of Group Constructions to Point Stabilizers. [Citation Graph (0, 0)][DBLP]
ISSAC, 1989, pp:351-356 [Conf] - Eugene M. Luks, Takunari Miyazaki
Polynomial-time normalizers for permutation groups with restricted composition factors. [Citation Graph (0, 0)][DBLP]
ISSAC, 2002, pp:176-183 [Conf] - Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright
Computing Normalizers in Permutation p-Groups. [Citation Graph (0, 0)][DBLP]
ISSAC, 1994, pp:139-146 [Conf] - James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy
Symmetry-Breaking Predicates for Search Problems. [Citation Graph (0, 0)][DBLP]
KR, 1996, pp:148-159 [Conf] - László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks
Multiplicative Equations over Commuting Matrices. [Citation Graph (0, 0)][DBLP]
SODA, 1996, pp:498-507 [Conf] - László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
Fast Monte Carlo Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP]
STOC, 1991, pp:90-100 [Conf] - László Babai, Eugene M. Luks
Canonical Labeling of Graphs [Citation Graph (0, 0)][DBLP]
STOC, 1983, pp:171-183 [Conf] - László Babai, Eugene M. Luks, Ákos Seress
Permutation Groups in NC [Citation Graph (0, 0)][DBLP]
STOC, 1987, pp:409-420 [Conf] - William M. Kantor, Eugene M. Luks
Computing in Quotient Groups [Citation Graph (0, 0)][DBLP]
STOC, 1990, pp:524-534 [Conf] - Eugene M. Luks
Hypergraph Isomorphism and Structural Equivalence of Boolean Functions. [Citation Graph (0, 0)][DBLP]
STOC, 1999, pp:652-658 [Conf] - Eugene M. Luks, Amitabha Roy
The Complexity of Symmetry-Breaking Formulas. [Citation Graph (0, 0)][DBLP]
Ann. Math. Artif. Intell., 2004, v:41, n:1, pp:19-45 [Journal] - Eugene M. Luks
Computing the composition factors of a permutation group in polynomial time. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1987, v:7, n:1, pp:87-99 [Journal] - Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. [Citation Graph (0, 0)][DBLP]
J. ACM, 1987, v:34, n:3, pp:513-531 [Journal] - Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability II: Theory. [Citation Graph (0, 0)][DBLP]
J. Artif. Intell. Res. (JAIR), 2004, v:22, n:, pp:481-534 [Journal] - William M. Kantor, Eugene M. Luks, Peter D. Mark
Sylow Subgroups in Parallel. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1999, v:31, n:1, pp:132-195 [Journal] - László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
Fast Monte Carlo Algorithms for Permutation Groups. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1995, v:50, n:2, pp:296-308 [Journal] - Eugene M. Luks
Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1982, v:25, n:1, pp:42-65 [Journal] - Eugene M. Luks, Pierre McKenzie
Parallel Algorithms for Solvable Permutation Groups. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1988, v:37, n:1, pp:39-62 [Journal] - Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright
Some Algorithms for Nilpotent Permutation Groups. [Citation Graph (0, 0)][DBLP]
J. Symb. Comput., 1997, v:23, n:4, pp:335-354 [Journal] - László Babai, Eugene M. Luks, Ákos Seress
Fast Management of Permutation Groups I. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1997, v:26, n:5, pp:1310-1342 [Journal] - Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability III: Implementation. [Citation Graph (0, 0)][DBLP]
J. Artif. Intell. Res. (JAIR), 2005, v:23, n:, pp:441-531 [Journal]
Combinatorics of Singly-Repairable Families. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002