|
|
 |
|
James P. Cohoon |
|
|
| Favorites |
|
Quote |
|
"Sometimes my brother rather than snoring
plays his music loud all night long."
|
|
|
Result
|
|
Showing that two-terminal routing is
polynomial.
|
|
|
Teacher
|
|
Sister
Mary Joel of Saint Catherine's 1966 Sixth
Grade. |
|
|
Course
|
|
CS101X and the one I am doing right
now |
|
|
Book
|
|
|
|
Dance
|
|
|
|
Song
|
|
|
|
CD
|
|
|
|
Soundtrack
|
|
|
|
Sci-Fi Movie |
|
|
|
State |
|
|
|
Promotional
photo |
|
|
|
Family |
|
|
|
Brushes with
greatness |
|
Standing next to Gorbachev on
the Lawn.
Meeting Jesse Jackson.
Alleged being on Sixty Minutes
(relatives claim to have seen me).
|
|
|
Smartest
thing |
|
|
|
Bush |
|
|
|
Bike ride |
|
Seventy-five mile ride on the
Western and Old Dominion rail to trail |
|
|
Downhill
bike ride |
|
Virginia creeper rail to trail |
|
|
City in the
universe |
|
|
|
Top ten
places other than NYC |
Athens for the Parthenon
South Dakota Badlands for its
camping
Charlottesville for UVA
Paris for the Champs-Élysees
Minneapolis for its friendliness
Munich for its people
Rome for Saint Peter's Basilica
Salisbury for Stonehenge
Venice for its supernaturalness
Washington DC for democracy |
|
|
Top places
I have yet to go |
|
Jerusalem and Cairo for their
ancientness
Tokyo for its neon lights
Hiroshima for its lessons
Australia & New Zealand for final frontiers
Space for the real final frontier
Beijing for the Tiananmen
Square martyrs |
|
|
Baseball
player |
|
|
|
Honor |
|
Department's first annual best
teaching award |
|
|
|
| 2007 - 2008
Courses |
|
|
|
|
| Education |
PhD
in Computer Science from the University of Minnesota, 1982;
M.S. in Computer Science from Pennsylvania State University, 1978;
BS in Mathematics from Ramapo College of NJ, 1976;
High school diploma from Paramus Catholic High School
Grammar school diploma from Saint Catherine's School of Glen Rock,
NJ, 1968.
|
|
| Research
interests |
|
Algorithms, Computer Science Education,
Diversity and Education, swarms, physical design |
|
| Defining
publications |
An Introductory Course Format for Promoting Diversity and Retention , J. P.
Cohoon, SIGCSE Technical Symposium, 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. |
|
| Professional
service contributions |
|
ACM
Publications board; ACM Council, ACM-SIGBoard,
ACM-SIGDA Chair, Asia-Pacific Conference on
Circuits and Systems executive and programming
committees, Co-organizer of the first
ACM-sponsored workshop in Russia, Design
Automation Conference executive, programming,
and sponsor committees, Date executive and
programming committees, EuroDac executive
committees, ICCAD programming Committees,
NSF reviewer |
|
|
Honors |
|
Fulbright Fellowship, SIGDA Outstanding
Service Award, SIGDA Leadership Award, Design
Automation Fellowship Awards, CS Best Teaching
Award, UVa CS Best Teaching Award, Upsilon Pi
Epsilon, and first grade arithmetic and spelling medals from Saint Catherine's School
|
|
| Affiliations |
|
 |
| |
|
