Ozalp Babaoglu, (Özalp Babaoğlu) a Turkish computer scientist and professor of CS at the University of Bologna. In 1977, at University of California, Berkeley, he wrote his Master's thesis Hardware implementation of the legal move generation and relative ordering functions for the game of chess, which describes a legal move generation approach in hardware by Alvin M. Despain [1]. In 1981, he received a Ph.D. from UC Berkeley where he was a principal designer of BSD Unix [2], and embarked on the development of 3BSD, which aimed to add virtual memory, page replacement and demand paging to Unix.
Ozalp Babaoglu [3]

Selected Publications

• Ozalp Babaoglu (1977). Hardware implementation of the legal move generation and relative ordering functions for the game of chess. Master's thesis, University of California, Berkeley
• Ozalp Babaoglu, William Joy (1981). Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits. Proceedings of the 8th SOSP, Operating Systems Review, Vol. 15, No. 5, pp. 78-86

External Links

• Özalp Babaoğlu from Wikipedia
• The Mathematics Genealogy Project - Özalp Babaoğlu
• UGU: Unix Guru Universe - Ozalp Babaoglu
• Ozalp Babaoglu

References

1. ^ Joe Condon, Ken Thompson (1982). Belle Chess Hardware. Advances in Computer Chess 3, Reprinted (1988) in Computer Chess Compendium
2. ^ Özalp Babaoğlu from Wikipedia
3. ^ Ozalp Babaoglu
4. ^ Scientific Commons: Ozalp Babaoglu
5. ^ DBLP: Özalp Babaoglu

What links here?