Eugene M. Luks

	2011
37		Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes: Generalizing Boolean Satisfiability II: Theory CoRR abs/1109.2134: (2011)
36		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)
35		Eugene M. Luks, Takunari Miyazaki: Polynomial-time normalizers. Discrete Mathematics & Theoretical Computer Science 13(4): 61-96 (2011)
	2005
34		Eugene M. Luks, Amitabha Roy: Combinatorics of Singly-Repairable Families. Electr. J. Comb. 12: (2005)
33		Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes: Generalizing Boolean Satisfiability III: Implementation. J. Artif. Intell. Res. (JAIR) 23: 441-531 (2005)
	2004
32		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
31		Eugene M. Luks, Amitabha Roy: The Complexity of Symmetry-Breaking Formulas. Ann. Math. Artif. Intell. 41(1): 19-45 (2004)
30		Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes: Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. (JAIR) 22: 481-534 (2004)
	2002
29		Eugene M. Luks, Amitabha Roy: Symmetry Breaking in Constraint Satisfaction. AMAI 2002
28		Eugene M. Luks, Amitabha Roy: Symmetry Breaking in Constraint Satisfaction. ISAIM 2002
27		Eugene M. Luks, Takunari Miyazaki: Polynomial-time normalizers for permutation groups with restricted composition factors. ISSAC 2002: 176-183
	2000
26		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
	1999
25		Eugene M. Luks: Hypergraph Isomorphism and Structural Equivalence of Boolean Functions. STOC 1999: 652-658
24		William M. Kantor, Eugene M. Luks, Peter D. Mark: Sylow Subgroups in Parallel. J. Algorithms 31(1): 132-195 (1999)
	1997
23		Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright: Some Algorithms for Nilpotent Permutation Groups. J. Symb. Comput. 23(4): 335-354 (1997)
22		László Babai, Eugene M. Luks, Ákos Seress: Fast Management of Permutation Groups I. SIAM J. Comput. 26(5): 1310-1342 (1997)
	1996
21		James M. Crawford, Matthew L. Ginsberg, Eugene M. Luks, Amitabha Roy: Symmetry-Breaking Predicates for Search Problems. KR 1996: 148-159
20		László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks: Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507
	1995
19		László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress: Fast Monte Carlo Algorithms for Permutation Groups. J. Comput. Syst. Sci. 50(2): 296-308 (1995)
	1994
18		Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright: Computing Normalizers in Permutation p-Groups. ISSAC 1994: 139-146
	1992
17		Eugene M. Luks: Computing in Solvable Matrix Groups FOCS 1992: 111-120
	1991
16		László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress: Fast Monte Carlo Algorithms for Permutation Groups STOC 1991: 90-100
	1990
15		William M. Kantor, Eugene M. Luks: Computing in Quotient Groups STOC 1990: 524-534
	1989
14		Gene Cooperman, Larry Finkelstein, Eugene M. Luks: Reduction of Group Constructions to Point Stabilizers. ISSAC 1989: 351-356
	1988
13		László Babai, Eugene M. Luks, Ákos Seress: Fast Management of Permutation Groups FOCS 1988: 272-282
12		Eugene M. Luks, Pierre McKenzie: Parallel Algorithms for Solvable Permutation Groups. J. Comput. Syst. Sci. 37(1): 39-62 (1988)
	1987
11		László Babai, Eugene M. Luks, Ákos Seress: Permutation Groups in NC STOC 1987: 409-420
10		Eugene M. Luks: Computing the composition factors of a permutation group in polynomial time. Combinatorica 7(1): 87-99 (1987)
9		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)
	1986
8		Eugene M. Luks: Parallel Algorithms for Permutation Groups and Graph Isomorphism FOCS 1986: 292-302
	1985
7		Eugene M. Luks, Pierre McKenzie: Fast Parallel Computation with Permutation Groups FOCS 1985: 505-514
	1983
6		László Babai, William M. Kantor, Eugene M. Luks: Computational Complexity and the Classification of Finite Simple Groups FOCS 1983: 162-171
5		László Babai, Eugene M. Luks: Canonical Labeling of Graphs STOC 1983: 171-183
	1982
4		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
3		Eugene M. Luks: Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. J. Comput. Syst. Sci. 25(1): 42-65 (1982)
	1980
2		Merrick L. Furst, John E. Hopcroft, Eugene M. Luks: Polynomial-Time Algorithms for Permutation Groups FOCS 1980: 36-41
1		Eugene M. Luks: Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time FOCS 1980: 42-49

Coauthor Index

1	László Babai	[5] [6] [11] [13] [16] [19] [20] [22]
2	Robert Beals	[20]
3	Jin-Yi Cai (Jin-yi Cai)	[20]
4	Gene Cooperman	[14] [16] [19]
5	James M. Crawford	[21]
6	Heidi E. Dixon	[30] [32] [33] [36] [37]
7	Larry Finkelstein	[14] [16] [19]
8	Merrick L. Furst	[2]
9	Zvi Galil	[4] [9]
10	Matthew L. Ginsberg	[21] [30] [32] [33] [36] [37]
11	David K. Hofer	[32] [33] [36]
12	Christoph M. Hoffmann	[4] [9]
13	John E. Hopcroft	[2]
14	Gábor Ivanyos	[20]
15	William M. Kantor	[6] [15] [24]
16	Peter D. Mark	[24]
17	Pierre McKenzie	[7] [12]
18	Takunari Miyazaki	[27] [35]
19	Andrew J. Parkes	[30] [32] [33] [36] [37]
20	Ferenc Rakoczi	[18] [23]
21	Amitabha Roy	[21] [28] [29] [31] [34]
22	Claus-Peter Schnorr	[4] [9]
23	Ákos Seress	[11] [13] [16] [19] [22]
24	Andreas Weber	[4] [9]
25	Charles R. B. Wright	[18] [23]
26	F. Frances Yao (Frances F. Yao, Foong Frances Yao)	[26]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page