Analysis of a CS1 approach for attracting diverse and inexperienced students to computing majors, J. P.
Cohoon and L. Tychonievich, SIGCSE Technical Symposium, pp. 165 - 170, Dallas, TX, 2011. Shows a
Longitudinal analysis of an effective CS1 curriculum that broadly encourages all types of students to computer science.
An introductory course format for promoting diversity and retention, J. P.
Cohoon, SIGCSE Technical Symposium, pp. 395 - 399, Covington, Kentucky, 2007. Shows a
promising approach for attracting a diverse
computer science undergraduate community.
Java Program Design: Third edition, J.P. Cohoon and J. W. Davidson,
McGraw-Hill, 2006. Seeks to attract a diverse
audience to computing through motivating
examples.
C++ Program Design: Third Edition, J.P. Cohoon and J. W. Davidson, McGraw-Hill, 2002.
Brings easy visualization to introductory
object-oriented programming.
A fast method for generalized Starting
temperature determination in homogeneous
two-stage simulated annealing systems, J. M.
Varanelli and J. P. Cohoon, Computers and
Operations Research, pp. 481-503, 1999. Allows
the power of conventional simulated annealing in
a fraction of the time.
Distributed genetic algorithms for the floorplan
design problem, J. P. Cohoon, S. U. Hegde,
W. N. Martin, and D. S. Richards, IEEE
Transactions on Computer-Aided Design of
Integrated Circuits and Systems, April 1991, pp.
483-492. Couples punctuated equilibria and
parallel computing to produce fast, near optimal
solutions for a major VLSI problem.
An optimal Steiner tree algorithm for a net
whose terminals lie on the perimeter of a
rectangle, J. P. Cohoon, J. S. Salowe, and
D. S. Richards, IEEE Transactions on
Computer-Aided Design of Integrated Circuits and
Systems, April 1990, pp. 398-407. Put three
algorithmicians in a room and you get
optimality.
Beaver: a computational-geometry-based tool for
switchbox routing, J. P. Cohoon and P. L.
Heck, IEEE Transactions on Computer-Aided Design
of Integrated Circuits and Systems, June
1988, pp. 684-697. Shows the advantages of a
greedy expert system approach to the "toughest"
of routing problems.
Genetic placement, J. P. Cohoon and W. D.
Paris, IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems, 1987,
pp. 956-964. Introduces the power of genetic
algorithms to VLSI physical design.
A fast Line
Intersection routing method for optimal wirings,
J. P. Cohoon, Allerton Conference on
Communication Control, 1984, pp. 488-497.
Demonstrates how to route VLSI computer chips in
polynomial time. |
