default search action
Eugene M. Luks
Person information
- affiliation: University of Oregon, Eugene, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [i3]Eugene M. Luks:
Group Isomorphism with Fixed Subnormal Chains. CoRR abs/1511.00151 (2015) - 2011
- [j13]Eugene M. Luks, Takunari Miyazaki:
Polynomial-time normalizers. Discret. Math. Theor. Comput. Sci. 13(4): 61-96 (2011) - [i2]Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability II: Theory. CoRR abs/1109.2134 (2011) - [i1]Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability III: Implementation. CoRR abs/1109.2142 (2011)
2000 – 2009
- 2005
- [j12]Eugene M. Luks, Amitabha Roy:
Combinatorics of Singly-Repairable Families. Electron. J. Comb. 12 (2005) - [j11]Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability III: Implementation. J. Artif. Intell. Res. 23: 441-531 (2005) - 2004
- [j10]Eugene M. Luks, Amitabha Roy:
The Complexity of Symmetry-Breaking Formulas. Ann. Math. Artif. Intell. 41(1): 19-45 (2004) - [j9]Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. 22: 481-534 (2004) - [c23]Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes:
Implementing a Generalized Version of Resolution. AAAI 2004: 55-60 - 2002
- [c22]Eugene M. Luks, Amitabha Roy:
Symmetry Breaking in Constraint Satisfaction. AI&M 2002 - [c21]Eugene M. Luks, Takunari Miyazaki:
Polynomial-time normalizers for permutation groups with restricted composition factors. ISSAC 2002: 176-183 - 2000
- [e1]F. Frances Yao, Eugene M. Luks:
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA. ACM 2000, ISBN 1-58113-184-4 [contents]
1990 – 1999
- 1999
- [j8]William M. Kantor, Eugene M. Luks, Peter D. Mark:
Sylow Subgroups in Parallel. J. Algorithms 31(1): 132-195 (1999) - [c20]Eugene M. Luks:
Hypergraph Isomorphism and Structural Equivalence of Boolean Functions. STOC 1999: 652-658 - 1997
- [j7]Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright:
Some Algorithms for Nilpotent Permutation Groups. J. Symb. Comput. 23(4): 335-354 (1997) - [j6]László Babai
, Eugene M. Luks, Ákos Seress:
Fast Management of Permutation Groups I. SIAM J. Comput. 26(5): 1310-1342 (1997) - 1996
- [c19]James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy:
Symmetry-Breaking Predicates for Search Problems. KR 1996: 148-159 - [c18]László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks:
Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507 - 1995
- [j5]László Babai
Fast Monte Carlo Algorithms for Permutation Groups. J. Comput. Syst. Sci. 50(2): 296-308 (1995) - [c17]Eugene M. Luks, Ákos Seress:
Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. Groups and Computation 1995: 169-181 - 1994
- [c16]Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright:
Computing Normalizers in Permutation p-Groups. ISSAC 1994: 139-146 - 1992
- [c15]Eugene M. Luks:
Computing in Solvable Matrix Groups. FOCS 1992: 111-120 - 1991
- [c14]László Babai, Eugene M. Luks, Ákos Seress:
Computing Composition Series in Primitive Groups. Groups And Computation 1991: 1-16 - [c13]Eugene M. Luks:
Permutation Groups and Polynomial-Time Computation. Groups And Computation 1991: 139-175 - [c12]László Babai
Fast Monte Carlo Algorithms for Permutation Groups. STOC 1991: 90-100 - 1990
- [c11]William M. Kantor, Eugene M. Luks:
Computing in Quotient Groups. STOC 1990: 524-534
1980 – 1989
- 1989
- [c10]Gene Cooperman, Larry Finkelstein, Eugene M. Luks:
Reduction of Group Constructions to Point Stabilizers. ISSAC 1989: 351-356 - 1988
- [j4]Eugene M. Luks, Pierre McKenzie:
Parallel Algorithms for Solvable Permutation Groups. J. Comput. Syst. Sci. 37(1): 39-62 (1988) - [c9]László Babai
Fast Management of Permutation Groups. FOCS 1988: 272-282 - 1987
- [j3]Eugene M. Luks:
Computing the composition factors of a permutation group in polynomial time. Comb. 7(1): 87-99 (1987) - [j2]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. J. ACM 34(3): 513-531 (1987) - [c8]László Babai
Permutation Groups in NC. STOC 1987: 409-420 - 1986
- [c7]Eugene M. Luks:
Parallel Algorithms for Permutation Groups and Graph Isomorphism. FOCS 1986: 292-302 - 1985
- [c6]Eugene M. Luks, Pierre McKenzie:
Fast Parallel Computation with Permutation Groups. FOCS 1985: 505-514 - 1983
- [c5]László Babai
Computational Complexity and the Classification of Finite Simple Groups. FOCS 1983: 162-171 - [c4]László Babai
Canonical Labeling of Graphs. STOC 1983: 171-183 - 1982
- [j1]Eugene M. Luks:
Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. J. Comput. Syst. Sci. 25(1): 42-65 (1982) - [c3]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. FOCS 1982: 118-125 - 1980
- [c2]Merrick L. Furst, John E. Hopcroft, Eugene M. Luks:
Polynomial-Time Algorithms for Permutation Groups. FOCS 1980: 36-41 - [c1]Eugene M. Luks:
Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time. FOCS 1980: 42-49
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: