Paulo Feofiloff
From Wikipedia, the free encyclopedia
Paulo Feofiloff is a German-born (and of Russian descendency) computer scientist and mathematician that is currently living in Brazil and teaching graduate courses on combinatorics at the Institute of Mathematics and Statistic (Portuguese: "Instituto de Matemática e Estatística", abbreviated as IME) of the University of São Paulo, São Paulo, Brazil.
Despite being retired, he has an active academic life, mostly producing texts that present a unusually clear point-of-view in the subjects treated. He is mostly interested in Graph Theory and the activity of computer programming as viewed by Edsger Wybe Dijkstra (with proofs that the algorithms described are correct) and has written some books for a Portuguese-speaking audience that are inspiring in both form and content.
[edit] Academic Background
In 1969's, he obtained a degree in Electrical Engineering at the Polytechnic School of the University of São Paulo.
After his undergraduate studies, he obtained his Master of Science degree in Applied Mathematics in 1974 under the supervision of Prof. Imre Simon. His thesis for his Master of Science degree was on Ramsey Theory.
After that, he got his PhD degree in Combinatorics and Optimization at the University of Waterloo, in Canada, 1983, under Prof. Daniel Haven Younger.
[edit] External links
- Prof. Paulo Feofiloff homepage
- Introduction to the Design of Algorithms (in Portuguese)
- Analysis of Algorithms (in Portuguese)