From UT Austin in 1996. I did this over a six year period part time
while working at AMD. I also took extra time for class projects, as
can be seen under the
University Projects. Thesis was
Binary
Adders (at UTAustin.com) reviewed all known adder configuration of the time, and was
the first to solve the multilevel carry skip adder optimization
problem for an arbitrary process. There was an earlier paper claiming
to have solved this problem, but my algorithm produced more optimal adders
given the same assumptions.
Degree verification (at UTAustin).