Alexandre Stauffer
Ph.D. Student in Computer Science
Theory Group at UC Berkeley
Email: my last name at cs.berkeley.edu
"Îäíî çíàþ, ÷òî ÿ áûë ñëåï, à òåïåðü âèæó."

"Efficient Broadcast on Random Geometric Graphs,"
with Milan Bradonjić, Robert Elsässer, Tobias Friedrich, and Thomas Sauerwald,
SODA (2010). 
"Probabilistic Heuristics for Disseminating Information in Networks,"
with Valmir C. Barbosa,
Transactions on Networking 15 (2007), 425-435.  [ArXiv]
"A Dissemination Strategy for Immunizing Scale-Free Networks,"
with Valmir C. Barbosa,
Physical Review E 74 (2006), 056105.  [ArXiv]
"Local Heuristics and the Emergence of Spanning Subgraphs in Complex Networks,"
with Valmir C. Barbosa,
Theoretical Computer Science 355 (2006), 80-95.  [ArXiv]
"A Study of the Edge-Switching Markov-Chain Method for the Generation of Random Graphs,"
with Valmir C. Barbosa,
Technical Report at ArXiv (2005).  [ArXiv]

2006-now
Ph.D. Student in Computer Science
Theory group, University of California, Berkeley
Advisor: Alistair Sinclair.
2006
Internship on Dynamic Networks
INSA de Lyon and INRIA Rhône-Alpes, France
Advisor: Eric Fleury.
2002-2005
M.Sc. in Computer Science
Universidade Federal do Rio de Janeiro, Brazil
Advisor: Valmir Barbosa.
1999-2003
B.Sc. in Computer Science
Universidade Federal do Rio de Janeiro, Brazil

Jul/2009
Probability Summer School, Cornell University
Jun/2009 & Mar/2009
Visitor at Columbia University, New York
Dec/2007
Invited participant at the Workshop on Analysis of Monte Carlo Methods, Harvard University
Jul/2007
Visitor at INSA de Lyon, France