I have graduated! I was a member of the theory of computation group, in
the
algorithms subgroup. I have been working mainly on
high-dimensional computational geometry under the supervision of my
advisor, Piotr Indyk.
Some of my ''theory'' interests include combinatorial optimizations,
and approximation algorithms. My PhD thesis was on Algorithmic Embeddings.
My masters thesis was on Clustering in High Dimensions.
Before grad school, I double-majored in Computer Science and Mathematics. Before coming to MIT, I have graduated from
Informatics High School, in Bucharest, Romania.
"A Simplified and Dynamic Unified Structure" (with Erik Demaine),
In Proc. of LATIN '04 (also invited to TCS journal)
"Fast Approximation Pattern Matching with Few Indels via Embeddings"
(with
Piotr Indyk),
In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA '05).
"Low-Distortion Embeddings of General Metrics Into the Line"
(with
Julia Chuzhoy,
Piotr Indyk,
and Anastasios Sidiropoulos)
in the Proceedings of the 37th Symposium on Theory of Computing (STOC 05).
"Embedding Ultrametrics Into Low-Dimensional Spaces"
(with
Julia Chuzhoy,
Piotr Indyk,
and Anastasios
Sidiropoulos)
in the Proceedings of the ACM-SIAM Symposium on Computational
Geometry (SoCG '06).
"Approximation Algorithms for Embedding General Metrics Into Trees"
(with
Piotr Indyk,
and Anastasios
Sidiropoulos)
In Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007).