Computing the structure of finite algebras

Introduction to automata theory, languages and computation

Mathematics and Computers in Simulation · 1981 · 10.9K citations

Computing, Computer Science, Mathematics +10

Isomorphism of graphs of bounded valence can be tested in polynomial time

Eugene M. Luks · Journal of Computer and System Sciences · 1982 · 660 citations

Computing, Computer Science, Mathematics +11

Probabilistic Algorithms in Finite Fields

Michael O. Rabin · SIAM Journal on Computing · 1980 · 319 citations

Natural Sciences, Computer Science, Mathematics +15

A new algorithm for factoring polynomials over finite fields

David G. Cantor, Hans Zassenhaus · Mathematics of Computation · 1981 · 292 citations

Computing, Computer Science, Mathematics +6

Probabilistic algorithms in finite fields

Michael Ben-Or · 1981 · 161 citations

Natural Sciences, Computer Science, Mathematics +15