I got my Computer Science PhD at University of Maryland, College Park on November, 2007. I started my PhD studies in 2003, and advanced to candidacy in 2006. My PhD advisor was David Mount. The topic of my dissertation is approximate range searching in the absolute error model.
I will be going back to Brazil in December, 2007, as required by my CAPES fellowship and my J1 VISA status. Then, I will be a Postdoc student in the department COPPE - Sistemas at UFRJ, until I can get a faculty position at some good Brazilian university. My Postdoc advisor is Celina Figueiredo.
In 2002, I obtained my Master degree in the department COPPE - Sistemas at UFRJ, Rio de Janeiro, Brazil. I'm specially interested in computational geometry, but I like anything related to algorithms (data structures, randomization, graphs, bioinformatics, complexity theory...). During my free time, I go rock climbing at places like Seneca Rocks, WV, or write random articles for Wikipedia.
email:
Publications
Approximate Range Searching: The Absolute Model; Guilherme D. da Fonseca; in WADS 2007, Lecture Notes in Computer Science vol 4619 pp 2 - 14, 2007.
[ DOI ]
[ PDF file ]
[ PostScript file ]
[ QUICK ABSTRACT ]
Approximate Range Searching: The Absolute Model; Guilherme D. da Fonseca and David M. Mount; Technical report CS-TR-4873, Computers Science Department, University of Maryland, 2007.
[ Link ]
[ PDF file ]
[ PostScript file ]
[ QUICK ABSTRACT ]
Algorithms for the homogeneous set sandwich problem; Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vinícius G. P. de Sá, and Jeremy Spinrad; Algorithmica vol 46/2 pp 149-180, 2006.
[ DOI ]
[ PDF file ]
[ PostScript file ]
[ QUICK ABSTRACT ]
Faster deterministic and randomized algorithms on the Homogeneous Set Sandwich Problem; Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vinícius G. P. de Sá and Jeremy Spinrad; in III Workshop on Efficient and Experimental Algorithms (WEA2004), Lecture Notes in Computer Science vol 3058 pp 243 - 252, 2004.
[ DOI ]
[ PDF file ]
[ PostScript file ]
[ QUICK ABSTRACT ]
Kinetic hanger;
Guilherme D. da Fonseca, Celina M. H. de Figueiredo and Paulo C. P. Carvalho; Information Processing Letters vol 89/3 pp 151 - 157, 2004.
[ DOI ]
[ PDF file ]
[ PostScript file ]
[ QUICK ABSTRACT ]
Kinetic heap-ordered trees: tight analysis and faster algorithms; Guilherme D. da Fonseca and Celina M. H. de Figueiredo; Information Processing Letters vol 85/3 pp 165 - 169, 2002.
[ DOI ]
[ PDF file ]
[ PostScript file ]
[ QUICK ABSTRACT ]
The stable marriage problem with restricted pairs; Vânia M. F. Dias, Guilherme D. da Fonseca, Celina M. H. de Figueiredo and Jayme L. Szwarcfiter; Theoretical Computer Science vol 306 pp 391 - 405, 2003.
[ DOI ]
[ PostScript file ]
[ QUICK ABSTRACT ]
Stable marriages with restricted pairs (conference version); Vânia M. F. Dias, Guilherme D. da Fonseca, Celina M. H. de Figueiredo and Jayme L. Szwarcfiter; in Brazilian Symposium on Graphs, Algorithms and Combinatorics, Electronic Notes in Discrete Mathematics vol 7, 2001.
Approximate Range Searching in the Absolute Error Model. Proposal for my preliminary exam.
[ PDF file ]
Documents in Portuguese
Introdução aos Algoritmos Randomizados (Capítulo Geometria Computacional); Celina M. H. de Figueiredo, Manoel J. M. S. Lemos, Vinícius G. P. de Sá e Guilherme D. da Fonseca; 26° Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, 2007.
[ Link ]
[ PDF file ]
[ PostScript file ]
Apostila Introdutória de Algoritmos. Projeto desenvolvido em conjunto com Celina Figueiredo com bolsa FAPERJ em 2003.
[ PDF file ]
Listas de Prioridades Cinéticas. Tese de Mestrado, Engenharia de Sistemas e Computação, COPPE, UFRJ, 2003.
[ PDF file ]
[ PostScript file ]
Listas de Prioridades Cinéticas. Apresentação da defesa de mestrado, 2003.
[ OpenOffice Impress file ]
Casamentos Estáveis com Casais Proibidos. Projeto final de graduação. Bacharelado em Ciência da Computação, UFRJ, 2000.
[ PDF file ] [ Word DOC file ]
Teaching Experience
Fall 2007: CMSC 330 - Organization of Programming Languages. Working for Atif Memon as a teaching TA.
Spring 2007: CMSC 754 - Computational Geometry. Worked for David Mount as a grading TA.
Fall 2006: CMSC 330 - Organization of Programming Languages. Worked for Marvin Zelkowitz as a teaching TA.
Summer 2006: CMSC 330 - Organization of Programming Languages. Worked as an instructor teaching the class, mentored by Larry Herman.
Spring 2006: CMSC 330 - Organization of Programming Languages. Worked for Jeff Foster as a teaching TA.
Fall 2005: CMSC 420 - Data Structures. Worked for Michelle Hugue as a grading TA.
Spring 2005: CMSC 420 - Data Structures. Worked for Michelle Hugue as a grading TA.
Fall 2004: CMSC 351 - Algorithms. Worked for Clyde Kruskal as a grading TA.
Spring 2004: CMSC 330 - Organization of Programming Languages. Worked for Larry Herman as a teaching TA.
Fall 2003: CMSC 330 - Organization of Programming Languages. Worked for Larry Herman as a grading TA.