Arithmetic of Finite Fields

No abstract is available for this paper.

• Publication year

  1982

• Venue

  Information Processing Letters

• Publication date

  1982-03-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0020-0190(82)90130-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Probabilistic algorithms in finite fields

  1980cited by this paper
• Analysis of a Simple Factorization Algorithm

  1976cited by this paper

• Univariate Polynomial Factorization Over Finite Fields

  1998cites this paper
• The consensus problem in fault-tolerant computing

  1993cites this paper
• Hierarchical representations of collections of small rectangles

  1988cites this paper
• On the reliability of consensus-based fault-tolerant distributed computing systems

  1987cites this paper
• An O(log n) expected rounds randomized byzantine generals protocol

  1987cites this paper
• Reaching approximate agreement in the presence of faults

  1986cites this paper
• Storing a collection of polygons using quadtrees

  1985cites this paper
• Bounds on information exchange for Byzantine agreement

  1985cites this paper
• The Quadtree and Related Hierarchical Data Structures

  1984cites this paper
• Byzantine generals in action

  1984cites this paper
• Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.

  1984cites this paper