George B. Purdy

According to our database1, George B. Purdy authored at least 28 papers between 1974 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
S-CHIRP: Secure communication for heterogeneous IoTs with round-robin protection.
Proceedings of the IEEE International Conference on Consumer Electronics, 2018

2015
On Finding Ordinary or Monochromatic Intersection Points.
Nord. J. Comput., 2015

2014
A Pseudoline Counterexample to the Strong Dirac Conjecture.
Electr. J. Comb., 2014

2011
A Bichromatic Incidence Bound and an Application.
Discrete & Computational Geometry, 2011

Collinearities in Kinetic Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Lines, Circles, Planes and Spheres.
Discrete & Computational Geometry, 2010

Bichromatic and Equichromatic Lines in C2 and R2.
Discrete & Computational Geometry, 2010

2007
Similar simplices in a d-dimensional point set.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

1995
Two Combinatorial Problems in the Plane.
Discrete & Computational Geometry, 1995

1990
The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound.
Inf. Process. Lett., 1990

1988
Repeated Angles in E4.
Discrete & Computational Geometry, 1988

Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts.
Proceedings of the Advances in Cryptology, 1988

1987
Integer Division in Linear Time with Bounded Fan-In.
IEEE Trans. Computers, 1987

1986
Two results about points, lines and planes.
Discrete Mathematics, 1986

1985
Fingerprinting Long Forgiving Messages.
Proceedings of the Advances in Cryptology, 1985

1982
The independent sets of rank k of a matroid.
Discrete Mathematics, 1982

On a problem in combinatorial geometry.
Discrete Mathematics, 1982

A Software Protection Scheme.
Proceedings of the 1982 IEEE Symposium on Security and Privacy, 1982

1981
A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines.
Inf. Sci., 1981

Software Protection Using "Communal Key Cryptosystems".
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
Two-coloring inequalities for Euclidean arrangements in general position.
Discrete Mathematics, 1980

1979
The minimum genus of a two-point universal graph.
J. Comb. Theory, Ser. B, 1979

The maximal sizes of faces and vertices in an arrangement.
Discrete Mathematics, 1979

Triangles in arrangements of lines.
Discrete Mathematics, 1979

1978
Some Combinatorial Problems in the Plane.
J. Comb. Theory, Ser. A, 1978

1974
Spheres Tangent to All the Faces of a Simplex.
J. Comb. Theory, Ser. A, 1974

Some external problems in geometry.
Discrete Mathematics, 1974

A High Security Log-in Procedure.
Commun. ACM, 1974


  Loading...