|
|
About Me
I am a PhD candidate in the Theory Group of the Computer Science
Department at Stanford
University, preparing to graduate in 2008.
My advisor is Ashish Goel, Associate Professor in
Management Science and
Engineering (primary) and Computer Science (by courtesy). Thanks to his affiliation with MS&E I gained exposure to projects in both departments.
My research interests focus on the design and analysis of algorithms
applied to various types of communication networks: P2P, sensor nets, optical
networks, etc.
Many of my collaborators here at Stanford are part of the
Research on Algorithms for the
Internet group.
I graduated from Harvard
University, May 2002 (B.A. in Computer Science and
Mathematics, magna cum laude).
My resume (last updated 1/20/2007) provides a more
complete record of my research, teaching, and tutoring activities, as well
a list of selected honors I have earned while participating in various
mathemathics, physics, and computer science contests. I am proud to have earned
two medals for the Canadian team at the IMO (International
Math Olympiad).
Papers and Publications Other Projects
HP Labs collaboration with Xiaofan Lin and Brian Atkins: Active Layout Engine: Algorithms and Applications in Variable Data Printing
Student Activities
I was the organizer of Theory Lunches in 2004 and 2005 (see archives '04-'05). A link to the most current schedule for Theory Lunches can usually be found via the Theory Group Homepage.
In 2003-2005 I was the president/vice-president of the Stanford RSA group
(that's the Romanian Student Association). If you
would like to join the RSA mailing list, the best way to do it is to follow the "Join Us" tab from RSA homepage.
As a dual-citizen, I was also gladly participating in various Stanford Canadian Club activities. I'm
always
looking forward to try to think in French again with people from beautiful Montreal (one of my hometowns) or other French-speaking people from around the world.
My undergraduate advisor was Michael Mitzenmacher and I was very
fortunate to have the opportunity to learn and discuss with him in my late
undergraduate years about LDPC codes (my senior thesis), about small-world
phenomena, and about other beautiful applied theory problems.
Routelet Placement for Multipath Transport
submitting to BROADNETS 2008, London, UK, September 2008.
Prelim. Version (pdf)
Threshold Selecting: Best Possible Probability Distribution
for Crossover Selection in Genetic Algorithms
GECCO 2008, Atlanta, GA, July 2008.
Camera-ready Version (in preparation)
Reducing Maximum Stretch in Compact Routing
INFOCOM 2008, Phoeniz, AZ, April 2008.
Conference Version (pdf)
Routers with Very Small Buffers
ACM/SIGCOMM Computer Communication Review, 35(3):83-90, July 2005.
Journal Version (pdf)
Scale-Free Aggregation in Sensor Networks.
First International Workshop on ALGOSENSORS, Finland, 2004.
Journal Version (pdf)
Variations on Random Graph Models for the Web
Computer Science Group, Harvard University.
Technical Report (pdf)
Searching for Good Low-Density Parity-Check Codes: Theoretical and
Practical Approaches
Thesis advisor: Michael Mitzenmacher.
Undergraduate Thesis, Harvard
University
(pdf)