default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge B. Purdy
Person information
- affiliation: University of Cincinnati, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c10]Mike Borowczak
, George B. Purdy:
S-CHIRP: Secure communication for heterogeneous IoTs with round-robin protection. ICCE 2018: 1-6- 2017
- [c9]Carla Purdy, Yasaswy Kasarabada, George B. Purdy:
Hardware implementation of the Baillie-PSW primality test. MWSCAS 2017: 651-654 - [i6]Mike Borowczak, George B. Purdy:
S-CHIRP: Secure Communication for Heterogeneous IoTs with Round-Robin Protection. CoRR abs/1710.00381 (2017) - 2015
- [j21]George B. Purdy, Justin W. Smith:
On Finding Ordinary or Monochromatic Intersection Points. Nord. J. Comput. 15(2): 141-153 (2015) - 2014
- [j20]Ben Lund, George B. Purdy, Justin W. Smith:
A Pseudoline Counterexample to the Strong Dirac Conjecture. Electron. J. Comb. 21(2): 2 (2014) - [c8]Naren Ramesh, George B. Purdy, Carla Purdy, Justin W. Smith:
A hardware implementation of Hough Transform based on parabolic duality. MWSCAS 2014: 145-148 - 2013
- [c7]Anusha Mantha, George B. Purdy, Carla Purdy:
Improving reliability in DNA-based computations. MWSCAS 2013: 1047-1050 - 2012
- [i5]Ben D. Lund, George B. Purdy, Justin W. Smith:
Some Results Related to a Conjecture of Dirac's. CoRR abs/1202.3110 (2012) - [i4]George B. Purdy:
The Secure Generation of RSA Moduli Using Poor RNG. CoRR abs/1202.4366 (2012) - 2011
- [j19]Ben D. Lund, George B. Purdy, Justin W. Smith:
A Bichromatic Incidence Bound and an Application. Discret. Comput. Geom. 46(4): 611-625 (2011) - [c6]Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth:
Collinearities in Kinetic Point Sets. CCCG 2011 - [i3]Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth:
Collinearities in Kinetic Point Sets. CoRR abs/1105.3078 (2011) - 2010
- [j18]George B. Purdy, Justin W. Smith:
Bichromatic and Equichromatic Lines in C2 and R2. Discret. Comput. Geom. 43(3): 563-576 (2010) - [j17]George B. Purdy, Justin W. Smith:
Lines, Circles, Planes and Spheres. Discret. Comput. Geom. 44(4): 860-882 (2010) - [i2]Ben D. Lund, George B. Purdy, Justin W. Smith:
A Bichromatic Incidence Bound and an Application to Determined Planes. CoRR abs/1006.3878 (2010)
2000 – 2009
- 2009
- [i1]George B. Purdy, Justin W. Smith:
On Finding Ordinary or Monochromatic Intersection Points. CoRR abs/0910.0286 (2009) - 2007
- [c5]Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir:
Similar simplices in a d-dimensional point set. SCG 2007: 232-238
1990 – 1999
- 1995
- [j16]Paul Erdös, George B. Purdy:
Two Combinatorial Problems in the Plane. Discret. Comput. Geom. 13: 441-443 (1995) - 1990
- [j15]Carla Neaderhouser Purdy, George B. Purdy:
The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound. Inf. Process. Lett. 34(1): 43-46 (1990)
1980 – 1989
- 1988
- [j14]George B. Purdy:
Repeated Angles in E4. Discret. Comput. Geom. 3: 73-75 (1988) - [c4]Gustavus J. Simmons, George B. Purdy:
Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts. EUROCRYPT 1988: 35-49 - 1987
- [j13]Carla Neaderhouser Purdy, George B. Purdy:
Integer Division in Linear Time with Bounded Fan-In. IEEE Trans. Computers 36(5): 640-644 (1987) - 1986
- [j12]George B. Purdy:
Two results about points, lines and planes. Discret. Math. 60: 215-218 (1986) - 1985
- [c3]G. R. Blakley, Catherine Meadows, George B. Purdy:
Fingerprinting Long Forgiving Messages. CRYPTO 1985: 180-189 - 1982
- [j11]George B. Purdy:
The independent sets of rank k of a matroid. Discret. Math. 38(1): 87-91 (1982) - [j10]Paul Erdös, George B. Purdy, Ernst G. Straus:
On a problem in combinatorial geometry. Discret. Math. 40(1): 45-52 (1982) - [c2]George B. Purdy, Gustavus J. Simmons, James Studier:
A Software Protection Scheme. S&P 1982: 99-103 - 1981
- [j9]G. R. Blakley, George B. Purdy:
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. 24(1): 71-91 (1981) - [c1]George B. Purdy, Gustavus J. Simmons, James Studier:
Software Protection Using "Communal Key Cryptosystems". CRYPTO 1981: 79 - 1980
- [j8]George B. Purdy, John E. Wetzel:
Two-coloring inequalities for Euclidean arrangements in general position. Discret. Math. 31(1): 53-58 (1980)
1970 – 1979
- 1979
- [j7]George B. Purdy:
Triangles in arrangements of lines. Discret. Math. 25(2): 157-163 (1979) - [j6]George B. Purdy, Thomas Strommer:
The maximal sizes of faces and vertices in an arrangement. Discret. Math. 28(3): 331-334 (1979) - [j5]George B. Purdy:
The minimum genus of a two-point universal graph. J. Comb. Theory B 26(1): 75-77 (1979) - 1978
- [j4]Paul Erdös, George B. Purdy:
Some Combinatorial Problems in the Plane. J. Comb. Theory A 25(2): 205-210 (1978) - 1974
- [j3]George B. Purdy:
A High Security Log-in Procedure. Commun. ACM 17(8): 442-445 (1974) - [j2]George B. Purdy:
Some external problems in geometry. Discret. Math. 7(3-4): 305-315 (1974) - [j1]George B. Purdy:
Spheres Tangent to All the Faces of a Simplex. J. Comb. Theory A 17(1): 131-133 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
