A sixth workshop (called
recitations by the registrar's sign-up system)
for the Spring 2018 CSC 280/CSC 480 was created on November 8th.
So if sections hitting their caps caused you trouble when trying
to sign up, please go back and look again as to what is open.
Also, even if you already signed up for a workshop but you are
in one that is crowded, e.g., that is at its cap, it would be a
good idea to consider quickly add/dropping workshops to change
yourself to a less crowded workshop, though currently
almost all are filled.
The professors Hemaspaandra
(Lane of URCS, left;
Edith of RIT-CS, right), on their 41st Adirondack mountaintop,
demonstrating the power of nonunary encodings
Lane A. Hemaspaandra
Note: Pre-marriage name = Lane A. Hemachandra.
Computer Science Department
University of Rochester
Rochester, NY 14627-0226
Email: ID = lane.hemaspaandra
DOMAIN = icloud.com
Phone +1-585-275-1203 Fax +1-585-273-4556
Here are two videos made by Lane for our graduate-student
A 12-minute video (in .m4v format) from 2010
case it below doesn't have the video ready to roll but rather says
that this video is not supported in your browser---I've tested it just on Safari and Firefox and it seems ok in both for me---here is the video as an
A 3-minute video (in .m4v format) from 2016 of Lane proving---very quickly as this was during a "2-Minute Madness" session in which each speaker got only 2 minutes in which to speak---a special case of a theorem from his 1989 Information and Computation paper with Jin-Yi Cai, namely, proving that if there is a polynomial-time function that given any Boolean formula outputs a list of two values one of which is its number of satisfying assignments, then #SAT itself is outright in polynomial time:
slides from Lane's Talk on Lewis Carroll's 1876 Election System
presentation made by Christopher Homan about the paper
"Power Balance and Apportionment Algorithms for the United States Congress,"
L. Hemaspaandra, K. Rajasethupathy,
P. Sethupathy, and M. Zimand,
ACM Journal of Experimental Algorithmics,
#1, August 1998.