David G. Cantor

According to our database, David G. Cantor authored at least 8 papers between 1962 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2000

Factoring Polynominals over <i>p</i>-Adic Fields.

David G. Cantor, Daniel M. Gordon

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1991

On Fast Multiplication of Polynomials over Arbitrary Algebras.

David G. Cantor, Erich L. Kaltofen

Acta Informatica, 1991

1989

On arithmetical algorithms over finite fields.

David G. Cantor

J. Comb. Theory A, 1989

1981

Irreducible Polynomials with Integral Coefficients Have Succinct Certificates.

David G. Cantor

J. Algorithms, 1981

1974

Optimal Routing in a Packet-Switched Computer Network.

David G. Cantor, Mario Gerla

IEEE Trans. Computers, 1974

1973

Sequences of Integers with Missing Differences.

David G. Cantor, Basil Gordon

J. Comb. Theory A, 1973

1971

On non-blocking switching networks.

David G. Cantor

Networks, 1971

1962

On The Ambiguity Problem of Backus Systems.

David G. Cantor

J. ACM, 1962