Nivio Ziviani

Nivio Ziviani
Born (1946-08-27) August 27, 1946
Belo Horizonte, Minas Gerais, Brazil
Residence Brazil
Nationality Brazilian
Fields Computer science
Institutions UFMG
Alma mater University of Waterloo
UFMG
Doctoral advisor Gaston Gonnet
Known for Akwan Information Technologies
Miner Technology Group
Notable awards Prêmio SBC de Mérito Científico (2011)
Ordem Nacional do Mérito Científico - Comendador
Website
Nivio Ziviani

Nivio Ziviani (Belo Horizonte - Brazil, August 27, 1946) is a Professor Emeritus[1] at the Department of Computer Science of the Federal University of Minas Gerais (UFMG). He has a Ph.D. in Computer Science from the University of Waterloo, Canada, 1982.[2] Nivio Ziviani is well known for his research in computer science,[3] mainly focused on Information Retrieval, Algorithms and Web Recommender Systems,[4] as can be seen in his DBLP[5] and Google Scholar.[6] He is member of the Brazilian Academy of Sciences[7] and the National Order of the Scientific Merit in the class Comendador.[8] In 2011 he received the Prize of Scientific Merit of the Brazilian Computer Science Society.[1]

Nivio Ziviani is author of the following books about algorithms:

He was the creator of one of the first search engines.[1] He co-founded the Miner Technology Group in 1998, which was acquired by Group Folha de S.Paulo / UOL in 1999, and a search engine company called Akwan Information Technologies in 2000, which was acquired by Google Inc. in 2005[1] - an acquisition that became worldwide news. With Akwan, Google bootstrapped its R&D Center for Latin America,[12][13] which is located in Belo Horizonte. Nowadays he is also co-founder and the Chairman of the Board of Zunnit Technologies,[14] a start-up company focused on software for recommending items of interest to Web users, and co-founder of Neemu.

At UFMG he coordinates the Laboratory for Treating Information (LATIN),[14] and is co-founder of the Information Retrieval Group at UFMG. He has co-authored over 100 refereed papers and 2 books in algorithm design and information retrieval, the latter his primary area of research. Nivio Ziviani was the General Co-Chair of the 28th ACM SIGIR Conference on Research and Development in Information Retrieval[15] and co-founder and member of the Steering Committee of the International Conference on String Processing and Information Retrieval (SPIRE).[15][16]

Research Impact

As a result of more than 30 years teaching and researching[17] he has a great list of graduate students and research projects. One example of his research projects with great impact is the C Minimal Perfect Hashing Library (CMPH),[18] which is an open source library with more than 25,400 downloads.[19]

References

  1. 1 2 3 4 "Professor da UFMG recebe prêmio de mérito científico da Sociedade Brasileira de Computação", Estado de Minas, 2011
  2. ↑ "Nivio Ziviani at Mathematics Genealogy Project", Mathematics Genealogy Project
  3. ↑ Professor da UFMG, Nívio Ziviani recebe prêmio nacional por mérito científico, 2011
  4. ↑ "Nivio Ziviani at ACM", Association for Computing Machinery
  5. ↑ "Nivio Ziviani at DBLP", DBLP
  6. ↑ "Nivio Ziviani at Google Scholar", Google Scholar
  7. ↑ "Nivio Ziviani at the Brazilian Academy of Sciences", Brazilian Academy of Sciences
  8. ↑ "Nivio Ziviani at Ministry of Science and Technology (Brazil)", Ministry of Science and Technology (Brazil)
  9. ↑ Projeto de Algoritmos Com implementações em Pascal e em C
  10. ↑ Diseño de Algoritmos com implementaciones en Pascal y C
  11. ↑ Projeto de Algoritmos Com implementações em Java e C++
  12. ↑ "Google compra empresa brasileira de busca", Universo Online, 2005
  13. ↑ Google monta base em Minas Gerais
  14. 1 2 "Accurate Indication", Fundação de Amparo à Pesquisa do Estado de São Paulo, 2012
  15. 1 2 "28th SIGIR", Special Interest Group on Information Retrieval
  16. ↑ SPIRE 2012
  17. ↑ Nivio Ziviani's Lattes
  18. ↑ "CMPH", SourceForge
  19. ↑ "CMPH Download Stats", SourceForge

See also

This article is issued from Wikipedia - version of the 11/27/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.