|
Alexandre Stauffer
Ph.D. Student in Computer Science at UC Berkeley
Contact: my last name + at + cs.berkeley.edu
|
|
Bio
I am a graduate student in computer science at UC Berkeley working with Alistair Sinclair.
Before that, I have obtained a master's and a bachelor's degree in computer science at Universidade Federal do Rio de Janeiro (UFRJ),
Brazil, and have done an internship at Institut National des Sciences Appliquées (INSA), Lyon, France.
|
|
|
Research
My research interests intersect the broad area of algorithms, graphs, and theoretical computer science. My recent
works have been focused on developing and analyzing distributed algorithms and random graph models for complex networks,
on identifying patterns on real network data, and on studying the efficiency of Markov Chain Monte Carlo and Importance
Sampling algorithms for sampling/counting problems.
|
|
|
Random Stuff
I am currently organizing TGIF, a student seminar.
|
|
|
Relevant Publications
"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] |
|