We stand with Ukraine  

William C. Calhoun

Orcid: 0000-0003-1139-3447

Affiliations:
  • Bloomsburg University, Department of Mathematics, Computer Science, and Statistics, PA, USA


According to our database1, William C. Calhoun authored at least 9 papers between 1993 and 2012.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Triviality and Minimality in the Degrees of Monotone Complexity.
[BibTeX]
[DOI]
William C. Calhoun
J. Log. Comput., 2012

2008
Predicting the types of file fragments.
[BibTeX]
[DOI]
William C. Calhoun
,
Drue Coles
Digit. Investig., 2008

Perfect distance forests.
[BibTeX]
[DOI]
William C. Calhoun
,
John B. Polhill
Australas. J Comb., 2008

2006
Degrees of monotone complexity.
[BibTeX]
[DOI]
William C. Calhoun
J. Symb. Log., 2006

2005
Totally magic labelings of graphs.
[BibTeX]
[DOI]
William C. Calhoun
,
Kevin Ferland
,
Lisa Lister
,
John B. Polhill
Australas. J Comb., 2005

2002
Panel on integrating security concepts into existing computer courses.
[BibTeX]
[DOI]
Paul Mullins
,
Jim Wolfe
,
Michael Fry
,
Erik L. Wynters
,
William C. Calhoun
,
Robert Montante
,
William Oblitey
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

2001
Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees.
[BibTeX]
[DOI]
William C. Calhoun
,
Manuel Lerman
J. Symb. Log., 2001

1996
The Pi<sub>2</sub><sup>0</sup> Enumeration Degrees Are Not Dense.
[BibTeX]
[DOI]
William C. Calhoun
,
Theodore A. Slaman
J. Symb. Log., 1996

1993
Incomparable Prime Ideals of Recursively Enumerable Degrees.
[BibTeX]
[DOI]
William C. Calhoun
Ann. Pure Appl. Log., 1993


  Loading...