George B. Purdy

Q: What Schools Are Affiliated With George B. Purdy

George B. Purdy is affiliated with the following schools: University of Cincinnati, University of California, Berkeley, ETH Zurich, Princeton University, University of Illinois Urbana-Champaign, Texas A&M University

George B. Purdy's AcademicInfluence.com Rankings

George B. Purdy

Mathematics

#1892

World Rank

#3006

Historical Rank

#765

USA Rank

Measure Theory

#4652

World Rank

#5448

Historical Rank

#1294

USA Rank

mathematics Degrees

Download Badge

Mathematics

George B. Purdy's Degrees

PhD Mathematics Princeton University
Masters Mathematics Princeton University

Why Is George B. Purdy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, George Barry Purdy was a mathematician and computer scientist who specialized in cryptography, combinatorial geometry and number theory. Purdy received his Ph.D. from the University of Illinois at Urbana–Champaign in 1972, officially under the supervision of Paul T. Bateman, but his de facto adviser was Paul Erdős. He was on the faculty in the mathematics department at Texas A&M University for 11 years, and was appointed the Geier Professor of computer science at the University of Cincinnati in 1986.

(See a Problem?)

George B. Purdy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A high security log-in procedure (1974) (141)
Extremal problems in combinatorial geometry (1996) (114)
Fingerprinting Long Forgiving Messages (1985) (113)
Some extremal problems in geometry (1971) (77)
SOME COMBINATORIAL PROBLEMS IN THE PLANE (1978) (42)
The Directions Determined by n Points in the Plane (1979) (32)
Some extremal problems in geometry IV (1976) (31)
On a problem in combinatorial geometry (1982) (25)
A carry-free algorithm for finding the greatest common divisor of two integers (1983) (22)
A Software Protection Scheme (1982) (21)
Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts (1988) (16)
And X, Some Extremal Problems in Geometry Iii (16)
Triangles in arrangements of lines (1979) (16)
Similar simplices in a d-dimensional point set (2007) (15)
On the number of regions determined by n lines in the projective plane (1980) (13)
Two results about points, lines and planes (1986) (13)
A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines (1981) (13)
On the quaternion representation of the Pauli spinor of an electron (2019) (13)
Some numerical results on Fekete polynomials (1975) (12)
Lines, Circles, Planes and Spheres (2009) (9)
Two combinatorial problems in the plane (1995) (8)
A Bichromatic Incidence Bound and an Application (2010) (7)
A proof of a consequence of Dirac's conjecture (1981) (7)
Triangles in arrangements of lines. II (1980) (7)
Bichromatic and Equichromatic Lines in ℂ2 and ℝ2 (2010) (6)
Elementary Problems: E1845-E1854 (1966) (6)
Integer Division in Linear Time with Bounded Fan-In (1987) (5)
Sums of distinct squares (1994) (4)
Two-coloring inequalities for Euclidean arrangements in general position (1980) (4)
Some Results Related to a Conjecture of Dirac's (2012) (3)
A Pseudoline Counterexample to the Strong Dirac Conjecture (2012) (3)
Spheres Tangent to All the Faces of a Simplex (1974) (3)
S-CHIRP: Secure communication for heterogeneous IoTs with round-robin protection (2017) (3)
Repeated Angles inE4 (1988) (3)
On finite sets inEk in which the diameter is frequently achieved (1982) (3)
The lattice triple packing of spheres in Euclidean space (1973) (3)
The maximal sizes of faces and vertices in an arrangement (1979) (2)
Some Extremal Problems in Geometry and the Theory of Numbers (1972) (1)
Software Protection Using "Communal Key Cryptosystems" (1981) (1)
Some external problems in geometry (1974) (1)
How often is a polygon bounded by three sides? (1982) (1)
The independent sets of rank k of a matroid (1982) (1)
Collinearities in Kinetic Point Sets (2011) (1)
Summing over a network without revealing summands (1989) (0)
Elementary Problems: E1766-E1775 (1965) (0)
Advanced Problems: 5340-5349 (1965) (0)
A binary algorithm for solving n by n systems of integer equations (1983) (0)
On Finding Ordinary Intersection Points (2009) (0)
The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound (1990) (0)
On Finding Ordinary or Monochromatic Intersection Points (2009) (0)
The Secure Generation of RSA Moduli Using Poor RNG (2012) (0)
The minimum genus of a two-point universal graph (1979) (0)
A Bichromatic Incidence Bound and an Application to Determined Planes (2010) (0)
Polytopes with prescribed contents of (n−1)-facets (1978) (0)
inimum Genus of a Two-Point (1979) (0)

This paper list is powered by the following services:

Other Resources About George B. Purdy

en.wikipedia.org

What Schools Are Affiliated With George B. Purdy?

George B. Purdy is affiliated with the following schools:

George B. Purdy's Academic­Influence.com Rankings