Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Luks, Eugene"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial-time normalizers for permutation groups with restricted composition factors
Eugene M. Luks
,
Takunari Miyazaki
Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC'2002 (Université de Lille, Lille, France, July 07-10, 2002)
, 2002, pp. 176-183
Sylow subgroups in parallel
William M. Kantor
,
Eugene M. Luks
,
Peter D. Mark
Journal of Algorithms
31
(1), 1999, pp. 132-195
Hypergraph isomorphism and structural equivalence of Boolean functions
Eugene M. Luks
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 652-658
Fast management of permutation groups I
László Babai
,
Eugene M. Luks
,
Ákos Seress
SIAM Journal on Computing
26
(5), 1997, pp. 1310-1342
Some algorithms for nilpotent permutation groups
Eugene M. Luks
,
Ferenc Rákóczi
,
Charles R.B. Wright
Journal Symbolic Computation
23
(4), 1997, pp. 335-354
Multiplicative equations over commuting matrices
László Babai
,
Robert Beals
,
Jin-yi Cai
,
Gábor Ivanyos
,
Eugene M. Luks
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 498-507
Fast Monte Carlo algorithms for permutation groups
László Babai
,
Gene Cooperman
,
Larry Finkelstein
,
Eugene Luks
,
Ákos Seress
Journal of Computer and System Sciences
50
(2), 1995, pp. 296-308
Computing normalizers in permutation
p
-groups
Eugene M. Luks
,
Ferenc Rákóczi
,
Charles R.B. Wright
Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation, ISSAC'94 (Oxford, England, United Kingdom, July 20-22, 1994)
, 1994, pp. 139-146
Computing in solvable matrix groups
Eugene M. Luks
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 111-120
Reduction of group constructions to point stabilizers
Gene Cooperman
,
Larry Finkelstein
,
Eugene Luks
Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC'89 (Portland, Oregon, July 17-19, 1989)
, 1989, pp. 351-356
Parallel algorithms for solvable permutation groups
Eugene M. Luks
,
Pierre McKenzie
Journal of Computer and System Sciences
37
, 1988, pp. 39-62
An
O(n^3\log n)
deterministic and an
O(n^3)
Las Vegas isomorphism test for trivalent graphs
Zvi Galil
,
Christoph M. Hoffmann
,
Eugene M. Luks
,
Claus P. Schnorr
,
Andreas Weber
Journal of the ACM
34
(3), 1987, July, pp. 513-531
Isomophism of bounded valence can be tested in polynomial time
Eugene M. Luks
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 42-49